Optimal disk I/O with parallel block transfer
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Expected deadlock time in a multiprocessing system
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A random model for analyzing region quadtrees
Pattern Recognition Letters
ACM SIGACT News
ACM Computing Surveys (CSUR)
Simple randomized mergesort on parallel disks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Future directions in program transformation
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Randomized binary search trees
Journal of the ACM (JACM)
Program specialization via algorithmic unfold/fold transformations
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Uniform asymptotics of some Abel sums arising in coding theory
Theoretical Computer Science
Real-time properties of indirect recursive procedures
Information and Computation
An Algorithm for General Set Unification and Its Complexity
Journal of Automated Reasoning
A Strahler bijection between Dyck paths and planar trees
Discrete Mathematics
Bubble sort: an archaeological algorithmic analysis
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
Random Arc Allocation and Applications
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Average-Case Quantum Query Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Handbook of massive data sets
Cuckoo hashing: further analysis
Information Processing Letters
Regular expression searching on compressed text
Journal of Discrete Algorithms
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing
Mappings on Decomposable Combinatorial Structures: Analytic Approach
Combinatorics, Probability and Computing
General urn models with several types of balls and Gaussian limiting fields
Random Structures & Algorithms
Random Structures & Algorithms
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Reductions in binary search trees
Theoretical Computer Science
Distribution sort with randomized cycling
Journal of the ACM (JACM)
Average case analysis of DJ graphs
Journal of Discrete Algorithms
On the degree distribution of the nodes in increasing trees
Journal of Combinatorial Theory Series A
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Level of nodes in increasing trees revisited
Random Structures & Algorithms
Binary Search Trees, Recurrent Properties andWave Equations
Fundamenta Informaticae
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Perfect hashing as an almost perfect subtype test
ACM Transactions on Programming Languages and Systems (TOPLAS)
Functionally-Generalised MOQA Operations
Electronic Notes in Theoretical Computer Science (ENTCS)
Reconstruction of Partial Orders and List Representation as Random Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
A new approach for ACET based scheduling of soft real-time systems
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
A Simple, Fast, and Compact Static Dictionary
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Deterministic edge weights in increasing tree families
Combinatorics, Probability and Computing
On the distribution of distances between specified nodes in increasing trees
Discrete Applied Mathematics
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
A combinatorial approach to the analysis of bucket recursive trees
Theoretical Computer Science
Generalized Stirling permutations, families of increasing trees and urn models
Journal of Combinatorial Theory Series A
Algorithms and theory of computation handbook
Average case analysis of algorithms
Algorithms and theory of computation handbook
A lightweight media access protocol for a WDM-based distributed shared memory system
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Towards modular average-case timing in real-time languages: an application to real-time Java
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Analysis of statistics for generalized stirling permutations
Combinatorics, Probability and Computing
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
Binary Search Trees, Recurrent Properties andWave Equations
Fundamenta Informaticae
| Hi-index | 0.00 |