Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Random regular graphs with edge faults: expansion through cores
Theoretical Computer Science
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Almost all graphs with average degree 4 are 3-colorable
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Random graphs, random triangle-free graphs, and random partial orders
Computational Discrete Mathematics
Reconciling simplicity and realism in parallel disk modelsy
Parallel Computing - Parallel data-intensive algorithms and applications
On the critical exponents of random k-SAT
Random Structures & Algorithms
Random Regular Graphs with Edge Faults: Expansion through Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Asymptotic enumeration of sparse graphs with a minimum degree constraint
Journal of Combinatorial Theory Series A
Analysis of edge deletion processes on faulty random regular graphs
Theoretical Computer Science - Latin American theoretical informatics
A probabilistic analysis of randomly generated binary constraint satisfaction problems
Theoretical Computer Science
Almost all graphs with average degree 4 are 3-colorable
Journal of Computer and System Sciences - STOC 2002
The pure literal rule threshold and cores in random hypergraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
A novel giant-subgraph phase-transition in sparse random k-partite graphs
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Random Structures & Algorithms
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms
The k-orientability thresholds for Gn, p
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Large-deviations/thermodynamic approach to percolation on the complete graph
Random Structures & Algorithms
The k-core and branching processes
Combinatorics, Probability and Computing
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
Random Structures & Algorithms
Protean Graphs with a Variety of Ranking Schemes
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Protean graphs with a variety of ranking schemes
Theoretical Computer Science
A novel giant-subgraph phase-transition in sparse random k-partite graphs
Discrete Applied Mathematics
A spatial web graph model with local influence regions
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Random graphs with forbidden vertex degrees
Random Structures & Algorithms
Rank-Based Attachment Leads to Power Law Graphs
SIAM Journal on Discrete Mathematics
Rank-based models of network structure and the discovery of content
WAW'11 Proceedings of the 8th international conference on Algorithms and models for the web graph
External-memory network analysis algorithms for naturally sparse graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
The rigidity transition in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Cores of random r-partite hypergraphs
Information Processing Letters
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: The cook-book approach to the differential equation method
Computer Science Review
Visual exploration of collaboration networks based on graph degeneracy
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
To stay or not to stay: modeling engagement dynamics in social graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |