| Publication | Date of Publication | Type |
|---|
Tail bounds for detection times in mobile hyperbolic graphs
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2025-03-19 | Paper |
Cover and hitting times of hyperbolic random graphs
Random Structures & Algorithms | 2024-11-20 | Paper |
| Cover and hitting times of hyperbolic random graphs | 2024-08-22 | Paper |
| Label propagation on binomial random graphs | 2023-02-07 | Paper |
Quasi-random words and limits of word sequences
LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
| Cover and Hitting Times of Hyperbolic Random Graphs | 2022-07-14 | Paper |
| Tail bounds for detection times in mobile hyperbolic graphs | 2022-02-28 | Paper |
Quasi-random words and limits of word sequences
European Journal of Combinatorics | 2021-09-02 | Paper |
On the second largest component of random hyperbolic graphs
SIAM Journal on Discrete Mathematics | 2019-11-20 | Paper |
A Bound for the Diameter of Random Hyperbolic Graphs
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Spectral gap of random hyperbolic graphs and related parameters
The Annals of Applied Probability | 2018-06-29 | Paper |
Spectral gap of random hyperbolic graphs and related parameters
The Annals of Applied Probability | 2018-06-29 | Paper |
Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
FIFO Queues Are Bad for Rumor Spreading
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Approximate testing with relative error
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
Discrete Applied Mathematics | 2016-06-22 | Paper |
Repetition-free longest common subsequence of random sequences
Discrete Applied Mathematics | 2016-06-22 | Paper |
Adaptive rumor spreading
Web and Internet Economics | 2016-01-08 | Paper |
| Types of perfect matchings in toroidal square grids | 2014-06-12 | Paper |
Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
Discrete Applied Mathematics | 2014-05-06 | Paper |
Counting perfect matchings in the geometric dual
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
On-line approximate string matching with bounded errors
Theoretical Computer Science | 2012-01-09 | Paper |
| Counting perfect matchings of cubic graphs in the geometric dual | 2010-10-28 | Paper |
Satisfying states of triangulations of a convex \(n\)-gon
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Satisfying states of triangulations of a convex \(n\)-gon
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Satisfying states of triangulations of a convex \(n\)-gon
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On-Line Approximate String Matching with Bounded Errors
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A concentration bound for the longest increasing subsequence of a randomly chosen involution
Discrete Applied Mathematics | 2006-08-17 | Paper |
Expected length of the longest common subsequence for large alphabets
Advances in Mathematics | 2005-11-22 | Paper |
| Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs | 2005-03-22 | Paper |
The chilean highway problem
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2086245 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086425 (Why is no real title available?) | 2004-08-11 | Paper |
Electronic jury voting protocols
Theoretical Computer Science | 2004-08-10 | Paper |
Approximate testing with error relative to input size.
Journal of Computer and System Sciences | 2003-08-13 | Paper |
Largest planar matching in random bipartite graphs
Random Structures & Algorithms | 2003-04-02 | Paper |
Alternation in interaction
Computational Complexity | 2002-06-02 | Paper |
Min-max-boundary domain decomposition
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1306876 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1222827 (Why is no real title available?) | 1998-11-11 | Paper |
Linearity testing in characteristic two
IEEE Transactions on Information Theory | 1997-08-07 | Paper |
| scientific article; zbMATH DE number 919602 (Why is no real title available?) | 1997-06-03 | Paper |
No polynomial bound for the period of the parallel chip firing game on graphs
Theoretical Computer Science | 1997-02-27 | Paper |
Games on line graphs and sand piles
Theoretical Computer Science | 1994-04-13 | Paper |
A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer
Parallel Computing | 1992-06-28 | Paper |
