| 2017 | IMC | A high-performance algorithm for identifying frequent items in data streams. | Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler |
| 2016 | FOCS | Optimal Quantile Approximation in Streams. | Zohar S. Karnin, Kevin J. Lang, Edo Liberty |
| 2016 | ICDT | A Framework for Estimating Stream Expression Cardinalities. | Anirban Dasgupta, Kevin J. Lang, Lee Rhodes, Justin Thaler |
| 2016 | ICML | Stratified Sampling Meets Machine Learning. | Edo Liberty, Kevin J. Lang, Konstantin Shmakov |
| 2013 | IJCAI | Bargaining for Revenue Shares on Tree Trading Networks. | Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley |
| 2012 | FUN | Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. | Kevin J. Lang |
| 2012 | WWW | Handling forecast errors while bidding for display advertising. | Kevin J. Lang, Benjamin Moseley, Sergei Vassilvitskii |
| 2011 | WSDM | Efficient online ad serving in a display advertising exchange. | Kevin J. Lang, Joaquin Delgado, Dongming Jiang, Bhaskar Ghosh, Shirshanka Das, Amita Gajewar, Swaroop Jagadish, Arathi Seshan, Chavdar Botev, Michael Ortega-Binderberger, Sunil Nagaraj, Raymie Stata |
| 2010 | WWW | Empirical comparison of algorithms for network community detection. | Jure Leskovec, Kevin J. Lang, Michael W. Mahoney |
| 2009 | WAW | Information Theoretic Comparison of Stochastic Graph Models: Some Experiments. | Kevin J. Lang |
| 2008 | ICDE | Efficient Discovery of Authoritative Resources. | Ravi Kumar, Kevin J. Lang, Cameron Marlow, Andrew Tomkins |
| 2008 | WWW | Statistical properties of community structure in large social and information networks. | Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney |
| 2008 | SODA | An algorithm for improving graph partitions. | Reid Andersen, Kevin J. Lang |
| 2007 | CIKM | Finding dense and isolated submarkets in a sponsored search spending graph. | Kevin J. Lang, Reid Andersen |
| 2007 | WAW | Local Partitioning for Directed Graphs Using PageRank. | Reid Andersen, Fan R. K. Chung, Kevin J. Lang |
| 2006 | FOCS | Local Graph Partitioning using PageRank Vectors. | Reid Andersen, Fan R. K. Chung, Kevin J. Lang |
| 2006 | WWW | Communities from seed sets. | Reid Andersen, Kevin J. Lang |
| 2004 | IPCO | A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts. | Kevin J. Lang, Satish Rao |
| 1999 | SPAA | BOS is Boss: A Case for Bulk-Synchronous Object Systems. | Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao |
| 1996 | SPAA | Towards Efficiency and Portability: Programming with the BSP Model. | Mark W. Goudreau, Kevin J. Lang, Satish Rao, Torsten Suel, Thanasis Tsantilas |
| 1995 | ICML | Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's. | Kevin J. Lang |
| 1994 | COLT | Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. | Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter |
| 1993 | SODA | Finding Near-Optimal Cuts: An Empirical Evaluation. | Kevin J. Lang, Satish Rao |
| 1992 | COLT | Random DFA's Can Be Approximately Learned from Sparse Uniform Examples. | Kevin J. Lang |
| 1988 | ICASSP | Phoneme recognition: neural networks vs. hidden Markov models. | Alex Waibel, Toshiyuki Hanazawa, Geoffrey E. Hinton, Kiyohiro Shikano, Kevin J. Lang |
| 1986 | OOPSLA | Oaklisp: an Object-Oriented Scheme with First Class Types. | Kevin J. Lang, Barak A. Pearlmutter |
| 1985 | IJCAI | Shape Recognition and Illusory Conjunctions. | Geoffrey E. Hinton, Kevin J. Lang |