Lazy multiplication of formal power series
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Average-case analysis in an elementary course on algorithms
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Randomized binary search trees
Journal of the ACM (JACM)
Real-Time Performance of Sorting Algorithms
Real-Time Systems
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The calculation of average distance in mesh structures
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A note on the expected distribution of degrees in random binary trees
ACM SIGCSE Bulletin
Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
Logic minimization using exclusive OR gates
Proceedings of the 38th annual Design Automation Conference
On String Replacement Exponentiation
Designs, Codes and Cryptography
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Teaching empirical analysis of algorithms
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Binary search tree recursions with harmonic toll functions
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
A heuristic to accelerate in-situ permutation algorithms
Information Processing Letters
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Genetic Programming and Evolvable Machines
A bijection between ordered trees and 2-Motzkin paths and its many consequences
Discrete Mathematics
Tirage a pile ou face de mots de Fibonacci
Discrete Mathematics
Random lattices, threshold phenomena and efficient reduction algorithms
Theoretical Computer Science
On the robustness of interconnections in random graphs: a symbolic approach
Theoretical Computer Science
Adapting RVR Simulation Techniques for Residual Connectedness Network Reliability Models
IEEE Transactions on Computers
Asymptotic analysis of (3, 2, 1)-shell sort
Random Structures & Algorithms
Average number of distinct part sizes in a random Carlitz composition
European Journal of Combinatorics
Sorting algorithms for broadcast communications: mathematical analysis
Theoretical Computer Science
Some results on tries with adaptive branching
Theoretical Computer Science
Matchsimile: a flexible approximate matching tool for searching proper names
Journal of the American Society for Information Science and Technology
Asymptotic analysis of an optimized quicksort algorithm
Information Processing Letters
NC coloring algorithms for permutation graphs
Nordic Journal of Computing
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
C2P: Clustering based on Closest Pairs
Proceedings of the 27th International Conference on Very Large Data Bases
ICALP '01 Proceedings of the 28th 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
Some Results on Tries with Adaptive Branching
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Trade-Offs between Density and Robustness in Random Interconnection Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Modified Binary Searching for Static Tables
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Metric Index for Approximate String Matching
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Beyond External Computing: Analysis of the Cycle Structure of Permutations
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Journal of Symbolic Computation
Coloring permutation graphs in parallel
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Generalized covariances of multi-dimensional Brownian excursion local times
Theoretical Computer Science - Latin American theoretical informatics
Consecutive patterns in permutations
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Optimal binary search trees with costs depending on the access paths
Theoretical Computer Science
Analysis of multiple quickselect variants
Theoretical Computer Science
Analysis of a randomized rendezvous algorithm
Information and Computation
Computer algebra handbook
An algorithm to generate exactly once every tiling with lozenges of a domain
Theoretical Computer Science - Special issue: Tilings of the plane
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Reliable Detection of Episodes in Event Sequences
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Lyndon words, permutations and trees
Theoretical Computer Science - WORDS
A bijection between directed column-convex polyominoes and ordered trees of height at most three
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Combinatorics of periods in strings
Journal of Combinatorial Theory Series A
Lock-Gain Based Graph Partitioning
Journal of Heuristics
Forbidden subgraphs in connected graphs
Theoretical Computer Science
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
The rotation correspondence is asymptotically a dilatation
Random Structures & Algorithms
Permuting in place: analysis of two stopping rules
Journal of Algorithms
Random Structures & Algorithms
The Journal of Supercomputing
Cycles in random k-ary maps and the poor performance of random number generation
Journal of Algorithms
Foundations of Security for Hash Chains in Ad Hoc Networks
Cluster Computing
Reliable detection of episodes in event sequences
Knowledge and Information Systems
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
Towards a complete characterization of tries
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
Journal of the ACM (JACM)
Using computer algebra systems in the teaching of analysis of recursive functions
Journal of Computing Sciences in Colleges
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Combinatorics, Probability and Computing
Generating all permutations by context-free grammars in Chomsky normal form
Theoretical Computer Science - Algebraic methods in language processing
Reductions in binary search trees
Theoretical Computer Science
The scientific works of Rainer Kemp (1949-2004)
Theoretical Computer Science
Pattern statistics and Vandermonde matrices
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Minimal change list for Lucas strings and some graph theoretic consequences
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Efficient iteration in admissible combinatorial classes
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
The number of distinct values in a geometrically distributed sample
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
ACM Computing Surveys (CSUR)
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
The left-right-imbalance of binary search trees
Theoretical Computer Science
Introduction to partially ordered patterns
Discrete Applied Mathematics
Asymptotic distributions for Random Median Quicksort
Journal of Discrete Algorithms
Enumeration and random generation of accessible automata
Theoretical Computer Science
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Scaling of program fitness spaces
Evolutionary Computation
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
Fault tolerant mutual and k-mutual exclusion algorithms for single-hop mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Trees with exponentially growing costs
Information and Computation
Analytical study of a stochastic plant growth model: Application to the GreenLab model
Mathematics and Computers in Simulation
Binary Search Trees, Recurrent Properties andWave Equations
Fundamenta Informaticae
Partial difference equation and the maximum principle
Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
The number of convex permutominoes
Information and Computation
Efficient Adaptive In-Place Radix Sorting
Informatica
Generating all permutations by context-free grammars in Greibach normal form
Theoretical Computer Science
Repeated patterns in genetic programming
Natural Computing: an international journal
Randomness Preserving Deletions on Special Binary Search Trees
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
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Noncommutative algebra, multiple harmonic sums and applications in discrete probability
Journal of Symbolic Computation
Note: Moves and displacements of particular elements in Quicksort
Theoretical Computer Science
Journal of Symbolic Computation
The relevant prefixes of coloured Motzkin walks: An average case analysis
Theoretical Computer Science
Structural complexity of random binary trees
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
An analysis of exponentiation based on formal languages
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Tablatures for stringed instruments and generating functions
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
A new sequential mining approach to XML document similarity computation
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Crossover bias in genetic programming
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Stream ciphers using a random update function: study of the entropy of the inner state
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Enumeration results for alternating tree families
European Journal of Combinatorics
On the subtree size profile of binary search trees
Combinatorics, Probability and Computing
Data-specific analysis of string sorting
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Average case analysis of algorithms
Algorithms and theory of computation handbook
Smooth movement and Manhattan path based Random Waypoint mobility
Information Processing Letters
Post-processing hierarchical community structures: Quality improvements and multi-scale view
Theoretical Computer Science
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Theoretical Computer Science
The analysis of Range Quickselect and related problems
Theoretical Computer Science
Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Developing RFID database models for analysing moving tags in supply chain management
ER'11 Proceedings of the 30th international conference on Conceptual modeling
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Average complexity of Moore's and Hopcroft's algorithms
Theoretical Computer Science
A master theorem for discrete divide and conquer recurrences
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Repeated patterns in tree genetic programming
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Data mining of gene expression microarray via weighted prefix trees
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
General Theory of Information Transfer and Combinatorics
Pattern matching statistics on correlated sources
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Counting occurrences for a finite set of words: Combinatorial methods
ACM Transactions on Algorithms (TALG)
The fraction of large random trees representing a given Boolean function in implicational logic
Random Structures & Algorithms
Objective function-based clustering
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Note: Rooted tree statistics from Matula numbers
Discrete Applied Mathematics
Binary Search Trees, Recurrent Properties andWave Equations
Fundamenta Informaticae
Pattern 1 j+10 j Avoiding Binary Words
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Visits to Level r by Dyck Paths
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Increasing the efficiency of quicksort using a neural network based algorithm selection model
Information Sciences: an International Journal
Optimal partitioning for dual pivot quicksort
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Guessing singular dependencies
Journal of Symbolic Computation
Minors of a class of Riordan arrays related to weighted partial Motzkin paths
European Journal of Combinatorics
| Hi-index | 0.02 |