Projective planes and congestion-free networks
Discrete Applied Mathematics
Multiple access communications using combinatorial designs
Theoretical aspects of computer science
Upper Bounds on the Size of One-Way Quantum Finite Automata
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Multiple Access Communications Using Combinatorial Designs
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Mediated digraphs and quantum nonlocality
Discrete Applied Mathematics - Special issue: Max-algebra
Linear work suffix array construction
Journal of the ACM (JACM)
Communication: Mediated digraphs and quantum nonlocality
Discrete Applied Mathematics
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
The complexity of minimum difference cover
Journal of Discrete Algorithms
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.89 |