Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kevin J. Lang
2010 – today
- 2013
[i3]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley: Bargaining for Revenue Shares on Tree Trading Networks. CoRR abs/1304.5822 (2013)- 2012
[c26]Kevin J. Lang: Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. FUN 2012: 270-281
[c25]Kevin J. Lang, Benjamin Moseley, Sergei Vassilvitskii: Handling forecast errors while bidding for display advertising. WWW 2012: 371-380- 2011
[c24]Kevin J. Lang, Joaquin Delgado, Dongming Jiang, Bhaskar Ghosh, Shirshanka Das, Amita Gajewar, Swaroop Jagadish, Arathi Seshan, Chavdar Botev, Michael Bindeberger-Ortega, Sunil Nagaraj, Raymie Stata: Efficient online ad serving in a display advertising exchange. WSDM 2011: 307-316- 2010
[c23]Jure Leskovec, Kevin J. Lang, Michael W. Mahoney: Empirical comparison of algorithms for network community detection. WWW 2010: 631-640
[i2]Jure Leskovec, Kevin J. Lang, Michael W. Mahoney: Empirical Comparison of Algorithms for Network Community Detection. CoRR abs/1004.3539 (2010)
2000 – 2009
- 2009
[j7]Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Mathematics 6(1): 29-123 (2009)
[c22]Kevin J. Lang: Information Theoretic Comparison of Stochastic Graph Models: Some Experiments. WAW 2009: 1-12
[c21]Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia: Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. SEA 2009: 197-208- 2008
[j6]Reid Andersen, Fan R. K. Chung, Kevin J. Lang: Local Partitioning for Directed Graphs Using PageRank. Internet Mathematics 5(1): 3-22 (2008)
[c20]Ravi Kumar, Kevin J. Lang, Cameron Marlow, Andrew Tomkins: Efficient Discovery of Authoritative Resources. ICDE 2008: 1495-1497
[c19]
[c18]Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney: Statistical properties of community structure in large social and information networks. WWW 2008: 695-704
[i1]Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. CoRR abs/0810.1355 (2008)- 2007
[j5]Reid Andersen, Fan R. K. Chung, Kevin J. Lang: Using PageRank to Locally Partition a Graph. Internet Mathematics 4(1): 35-64 (2007)
[c17]Kevin J. Lang, Reid Andersen: Finding dense and isolated submarkets in a sponsored search spending graph. CIKM 2007: 613-622
[c16]Reid Andersen, Fan R. K. Chung, Kevin J. Lang: Local Partitioning for Directed Graphs Using PageRank. WAW 2007: 166-178- 2006
[c15]Reid Andersen, Fan R. K. Chung, Kevin J. Lang: Local Graph Partitioning using PageRank Vectors. FOCS 2006: 475-486
[c14]- 2005
[c13]- 2004
[c12]Kevin J. Lang, Satish Rao: A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. IPCO 2004: 325-337
1990 – 1999
- 1999
[j4]Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas: Portable and Efficient Parallel Computing Using the BSP Model. IEEE Trans. Computers 48(7): 670-689 (1999)
[c11]Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao: BOS is Boss: A Case for Bulk-Synchronous Object Systems. SPAA 1999: 115-125- 1998
[j3]Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu, Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas, Rob H. Bisseling: BSPlib: The BSP programming library. Parallel Computing 24(14): 1947-1980 (1998)
[c10]Kevin J. Lang, Barak A. Pearlmutter, Rodney A. Price: Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm. ICGI 1998: 1-12- 1996
[c9]Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas: Towards Efficiency and Portability: Programming with the BSP Model. SPAA 1996: 1-12- 1995
[c8]Kevin J. Lang: Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's. ICML 1995: 340-343- 1994
[c7]Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter: Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. COLT 1994: 159-164- 1993
[c6]- 1992
[c5]Kevin J. Lang: Random DFA's Can Be Approximately Learned from Sparse Uniform Examples. COLT 1992: 45-52- 1990
[j2]Kevin J. Lang, Alex Waibel, Geoffrey E. Hinton: A time-delay neural network architecture for isolated word recognition. Neural Networks 3(1): 23-43 (1990)
[c4]Eric B. Baum, Kevin J. Lang: Constructing Hidden Units Using Examples and Queries. NIPS 1990: 904-910
1980 – 1989
- 1989
[c3]Kevin J. Lang, Geoffrey E. Hinton: Dimensionality Reduction and Prior Knowledge in E-Set Recognition. NIPS 1989: 178-185- 1988
[j1]Kevin J. Lang, Barak A. Pearlmutter: Oaklisp: An Object-Oriented Dialect of Scheme. Lisp and Symbolic Computation 1(1): 39-51 (1988)- 1986
[c2]Kevin J. Lang, Barak A. Pearlmutter: Oaklisp: an Object-Oriented Scheme with First Class Types. OOPSLA 1986: 30-37- 1985
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-05 01:45 CEST by the dblp team



