Analysis of new variants of coalesced hashing
ACM Transactions on Database Systems (TODS)
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
The average complexity of depth-first search with backtracking and cutoff
IBM Journal of Research and Development
On the asymptotic analysis of the Euclidean algorithm
Journal of Symbolic Computation
The synchronization of periodic routing messages
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
Basic techniques for design and analysis of algorithms
ACM Computing Surveys (CSUR)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Selecting training inputs via greedy rank covering
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Binary search tree recursions with harmonic toll functions
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
A self-similarity structure generated by King's walk
Discrete Mathematics - Algebraic and topological methods in graph theory
Deterministic Built-in Pattern Generation for Sequential Circuits
Journal of Electronic Testing: Theory and Applications
New Applications of the Incompressibility Method
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An asymptotic theory for recurrence relations based on minimization and maximization
Theoretical Computer Science
Analysis of multiple quickselect variants
Theoretical Computer Science
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Regexpcount, a symbolic package for counting problems on regular expressions and words
Fundamenta Informaticae - Special issue on computing patterns in strings
Mappings on Decomposable Combinatorial Structures: Analytic Approach
Combinatorics, Probability and Computing
Comparisons in Hoare's Find Algorithm
Combinatorics, Probability and Computing
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information Processing Letters
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The algorithm of pipelined gossiping
Journal of Systems Architecture: the EUROMICRO Journal
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
On quickselect, partial sorting and multiple quickselect
Information Processing Letters
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
Improved distance sensitivity oracles via random sampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization
New fixed-parameter algorithms for the minimum quartet inconsistency problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Algorithm design and analysis techniques
Algorithms and theory of computation handbook
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Bandwidth reservation for bursty traffic in the presence of resource availability uncertainty
Computer Communications
| Hi-index | 0.00 |