default search action
Kevin J. Lang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Nikita Ivkin, Edo Liberty, Kevin J. Lang, Zohar S. Karnin, Vladimir Braverman:
Streaming Quantiles Algorithms with Small Space and Update Time. Sensors 22(24): 9612 (2022)
2010 – 2019
- 2019
- [i8]Nikita Ivkin, Edo Liberty, Kevin J. Lang, Zohar S. Karnin, Vladimir Braverman:
Streaming Quantiles Algorithms with Small Space and Update Time. CoRR abs/1907.00236 (2019) - 2017
- [c32]Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler:
A high-performance algorithm for identifying frequent items in data streams. Internet Measurement Conference 2017: 268-282 - [i7]Daniel Anderson, Pryce Bevan, Kevin J. Lang, Edo Liberty, Lee Rhodes, Justin Thaler:
A High-Performance Algorithm for Identifying Frequent Items in Data Streams. CoRR abs/1705.07001 (2017) - [i6]Kevin J. Lang:
Back to the Future: an Even More Nearly Optimal Cardinality Estimation Algorithm. CoRR abs/1708.06839 (2017) - 2016
- [c31]Zohar S. Karnin, Kevin J. Lang, Edo Liberty:
Optimal Quantile Approximation in Streams. FOCS 2016: 71-78 - [c30]Anirban Dasgupta
, Kevin J. Lang, Lee Rhodes, Justin Thaler:
A Framework for Estimating Stream Expression Cardinalities. ICDT 2016: 6:1-6:17 - [c29]Edo Liberty, Kevin J. Lang, Konstantin Shmakov:
Stratified Sampling Meets Machine Learning. ICML 2016: 2320-2329 - [i5]Zohar S. Karnin, Kevin J. Lang, Edo Liberty:
Almost Optimal Streaming Quantiles Algorithms. CoRR abs/1603.05346 (2016) - 2015
- [i4]Anirban Dasgupta, Kevin J. Lang, Lee Rhodes, Justin Thaler:
A Framework for Estimating Stream Expression Cardinalities. CoRR abs/1510.01455 (2015) - 2014
- [j10]Kevin J. Lang:
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. Theory Comput. Syst. 54(4): 659-688 (2014) - 2013
- [c28]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. IJCAI 2013: 129-135 - [i3]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. CoRR abs/1304.5822 (2013) - 2012
- [c27]Kevin J. Lang:
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. FUN 2012: 270-281 - [c26]Kevin J. Lang, Benjamin Moseley, Sergei Vassilvitskii:
Handling forecast errors while bidding for display advertising. WWW 2012: 371-380 - 2011
- [c25]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:
Efficient online ad serving in a display advertising exchange. WSDM 2011: 307-316 - 2010
- [c24]Jure Leskovec
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
- [j9]Jure Leskovec
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Math. 6(1): 29-123 (2009) - [c23]Kevin J. Lang:
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments. WAW 2009: 1-12 - [c22]Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow. SEA 2009: 197-208 - 2008
- [j8]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Partitioning for Directed Graphs Using PageRank. Internet Math. 5(1): 3-22 (2008) - [c21]Ravi Kumar, Kevin J. Lang, Cameron Marlow, Andrew Tomkins:
Efficient Discovery of Authoritative Resources. ICDE 2008: 1495-1497 - [c20]Reid Andersen, Kevin J. Lang:
An algorithm for improving graph partitions. SODA 2008: 651-660 - [c19]Jure Leskovec
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
- [j7]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Using PageRank to Locally Partition a Graph. Internet Math. 4(1): 35-64 (2007) - [c18]Kevin J. Lang, Reid Andersen:
Finding dense and isolated submarkets in a sponsored search spending graph. CIKM 2007: 613-622 - [c17]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Partitioning for Directed Graphs Using PageRank. WAW 2007: 166-178 - 2006
- [c16]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Graph Partitioning using PageRank Vectors. FOCS 2006: 475-486 - [c15]Reid Andersen, Kevin J. Lang:
Communities from seed sets. WWW 2006: 223-232 - 2005
- [c14]Kevin J. Lang:
Fixing two weaknesses of the Spectral Method. NIPS 2005: 715-722 - 2004
- [c13]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
- [j6]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) - [c12]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
- [j5]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 Comput. 24(14): 1947-1980 (1998) - [c11]Kevin J. Lang, Barak A. Pearlmutter
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm. ICGI 1998: 1-12 - 1996
- [c10]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
- [c9]Kevin J. Lang:
Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's. ICML 1995: 340-343 - 1994
- [c8]Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter
Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. COLT 1994: 159-164 - 1993
- [j4]Kevin J. Lang, Warren D. Smith:
A Test Suite for Chess Programs. J. Int. Comput. Games Assoc. 16(3): 152-161 (1993) - [c7]Kevin J. Lang, Satish Rao:
Finding Near-Optimal Cuts: An Empirical Evaluation. SODA 1993: 212-221 - 1992
- [c6]Kevin J. Lang:
Random DFA's Can Be Approximately Learned from Sparse Uniform Examples. COLT 1992: 45-52 - 1990
- [j3]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) - [c5]Eric B. Baum, Kevin J. Lang:
Constructing Hidden Units Using Examples and Queries. NIPS 1990: 904-910
1980 – 1989
- 1989
- [j2]Alexander Waibel, Toshiyuki Hanazawa, Geoffrey E. Hinton, Kiyohiro Shikano, Kevin J. Lang:
Phoneme recognition using time-delay neural networks. IEEE Trans. Acoust. Speech Signal Process. 37(3): 328-339 (1989) - [c4]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 Symb. Comput. 1(1): 39-51 (1988) - [c3]Alex Waibel, Toshiyuki Hanazawa, Geoffrey E. Hinton, Kiyohiro Shikano, Kevin J. Lang:
Phoneme recognition: neural networks vs. hidden Markov models. ICASSP 1988: 107-110 - 1986
- [c2]Kevin J. Lang, Barak A. Pearlmutter
Oaklisp: an Object-Oriented Scheme with First Class Types. OOPSLA 1986: 30-37 - 1985
- [c1]Geoffrey E. Hinton, Kevin J. Lang:
Shape Recognition and Illusory Conjunctions. IJCAI 1985: 252-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: