Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Log-log plot
OpenAlex ID:
C195292467
Graphs over time: densification laws, shrinking diameters and possible explanations
2005
·
Jure Leskovec
, Jon Kleinberg
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
2,879
Maximizing Social Influence in Nearly Optimal Time
2013
·
Christian Borgs
, Michael Brautbar
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
1,023
Robust log-based anomaly detection on unstable log data
2019
·
Xu Zhang
, Yong Xu
, et al.
·
ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)
·
992
An 0(n log n) sorting network
1983
·
M. Ajtai
, J. Komlós
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
877
Parallel Merge Sort
1988
·
Richard Cole
·
SIAM Journal on Computing
·
828
Noise-tolerant learning, the parity problem, and the statistical query model
2003
·
Avrim Blum
, Adam Kalai
, et al.
·
Journal of the ACM
·
791
PDF
On the normal concentration of divisors, 2
2009
·
HELMUT MAIER
, GÉRALD TENENBAUM
·
Mathematical Proceedings of the Cambridge Philosophical Society
·
733
Simple Constructions of Almost k‐wise Independent Random Variables
1992
·
Noga Alon
, Oded Goldreich
, et al.
·
Random Structures and Algorithms
·
653
Koorde: A Simple Degree-Optimal Distributed Hash Table
2003
·
M. Frans Kaashoek
, David R. Karger
·
Lecture notes in computer science
·
646
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
1993
·
James B. Orlin
·
Operations Research
·
541
Deterministic coin tossing with applications to optimal parallel list ranking
1986
·
Richard Cole
, Uzi Vishkin
·
Information and Control
·
513
Detecting high log-densities: an O ( n ¼ ) approximation for densest k -subgraph
2010
·
Aditya Bhaskara
, Moses Charikar
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
426
Finding minimum-cost circulations by canceling negative cycles
1989
·
Andrew V. Goldberg
, Robert E. Tarjan
·
Journal of the ACM
·
424
PDF
Log-logarithmic worst-case range queries are possible in space Θ(N)
1983
·
Dan E. Willard
·
Information Processing Letters
·
413
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
1993
·
Daniel M. Gordon
·
SIAM Journal on Discrete Mathematics
·
380
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
1986
·
Stephen Cook
, Cynthia Dwork
, et al.
·
SIAM Journal on Computing
·
370
The Average Distance in a Random Graph with Given Expected Degrees
2004
·
Fan Chung
, Linyuan Lu
·
Internet Mathematics
·
338
PDF
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
1999
·
Monika R. Henzinger
, Valerie King
·
Journal of the ACM
·
336
PDF
The Locality of Distributed Symmetry Breaking
2016
·
Leonid Barenboim
, Michael Elkin
, et al.
·
Journal of the ACM
·
334
PDF
Fast parallel circuits for the quantum Fourier transform
2002
·
R. Cleve
, J. Watrous
·
Annual Symposium on Foundations of Computer Science
·
320
PDF
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
2006
·
Eli Ben‐Sasson
, Oded Goldreich
, et al.
·
SIAM Journal on Computing
·
313
A faster strongly polynomial minimum cost flow algorithm
1988
·
James Orlin
·
ACM Symposium on Theory of Computing (STOC)
·
296
PDF
Faster integer multiplication
2007
·
Martin Fürer
·
ACM Symposium on Theory of Computing (STOC)
·
292
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
2000
·
Jaikumar Radhakrishnan
, Amnon Ta-Shma
·
SIAM Journal on Discrete Mathematics
·
291
On computing the length of longest increasing subsequences
1975
·
Michael L. Fredman
·
Discrete Mathematics
·
281
PDF
Show more works
View as search
Works count:
2,645
Citation count:
61,380
Year
Topic
Type