| Publication | Date of Publication | Type |
|---|
Robustness: a new form of heredity motivated by dynamic networks
Theoretical Computer Science | 2020-01-16 | Paper |
Counting in one-hop beeping networks
Theoretical Computer Science | 2019-06-06 | Paper |
Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
Algorithmica | 2019-05-07 | Paper |
Design patterns in beeping algorithms: examples, emulation, and analysis
Information and Computation | 2018-12-21 | Paper |
| Deterministic leader election in O(D+ n) time with messages of size O(1) | 2018-08-16 | Paper |
| Design patterns in beeping algorithms | 2018-07-18 | Paper |
On the concentration of the height of binary search trees
Automata, Languages and Programming | 2018-07-04 | Paper |
Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds
Information and Computation | 2016-11-18 | Paper |
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
Information and Computation | 2016-03-10 | Paper |
Analysis of fully distributed splitting and naming probabilistic procedures and applications
Theoretical Computer Science | 2015-05-22 | Paper |
On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science | 2014-01-10 | Paper |
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
Information and Computation | 2014-01-10 | Paper |
Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
Structural Information and Communication Complexity | 2013-12-17 | Paper |
On the number of indecomposable permutations with a given number of cycles
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
An optimal bit complexity randomized distributed MIS algorithm
Distributed Computing | 2012-02-06 | Paper |
| scientific article; zbMATH DE number 5855082 (Why is no real title available?) | 2011-02-22 | Paper |
About randomised distributed graph colouring and graph partition algorithms
Information and Computation | 2010-10-22 | Paper |
Uniform election in trees and polyominoids
Discrete Applied Mathematics | 2010-10-11 | Paper |
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Efficient Simulations by Queue Machines
SIAM Journal on Computing | 2006-06-01 | Paper |
Cantorian tableaux and permanents
L'Enseignement Mathématique. 2e Série | 2005-09-28 | Paper |
Constant bounds on the moments of the height of binary search trees
Theoretical Computer Science | 2002-07-15 | Paper |
Hard tiling problems with simple tiles
Discrete & Computational Geometry | 2002-02-07 | Paper |
| scientific article; zbMATH DE number 1670865 (Why is no real title available?) | 2001-12-06 | Paper |
| scientific article; zbMATH DE number 1670648 (Why is no real title available?) | 2001-11-11 | Paper |
Strategy and Complexity of The Game of Squares
Bulletin of the London Mathematical Society | 2000-03-21 | Paper |
| scientific article; zbMATH DE number 1408356 (Why is no real title available?) | 2000-02-29 | Paper |
| scientific article; zbMATH DE number 1400022 (Why is no real title available?) | 2000-02-06 | Paper |
| scientific article; zbMATH DE number 1304322 (Why is no real title available?) | 1999-06-17 | Paper |
Automaticity. II: Descriptional complexity in the unary case
Theoretical Computer Science | 1998-07-22 | Paper |
Fast and scalable parallel algorithms for knapsack-like problems.
Journal of Parallel and Distributed Computing | 1997-08-07 | Paper |
Separating words with machines and groups
RAIRO - Theoretical Informatics and Applications | 1996-11-17 | Paper |
On the Generation of Random Binary Search Trees
SIAM Journal on Computing | 1996-02-25 | Paper |
| scientific article; zbMATH DE number 512978 (Why is no real title available?) | 1994-06-13 | Paper |
Analytic variations on quadtrees
Algorithmica | 1994-03-20 | Paper |
| scientific article; zbMATH DE number 432810 (Why is no real title available?) | 1993-10-20 | Paper |
More languages of generalised star height 1
Theoretical Computer Science | 1993-04-22 | Paper |
Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time
Information and Computation | 1992-09-27 | Paper |
On O(Tlog T) reduction from RAM computations to satisfiability
Theoretical Computer Science | 1991-01-01 | Paper |
Strong time bounds: Non-computable bounds and a hierarchy theorem
Theoretical Computer Science | 1990-01-01 | Paper |
Random access machines with multi-dimensional memories
Information Processing Letters | 1990-01-01 | Paper |
Separating strings with small automata
Information Processing Letters | 1989-01-01 | Paper |
Algorithms for maximum independent sets
Journal of Algorithms | 1986-01-01 | Paper |
Alternation with restrictions on looping
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3952008 (Why is no real title available?) | 1984-01-01 | Paper |
<i>N</i> by <i>N</i> Checkers is Exptime Complete
SIAM Journal on Computing | 1984-01-01 | Paper |
Fast probabilistic RAM simulation of single tape turing machine computations
Information and Control | 1984-01-01 | Paper |
Storage allocation is NP-hard
Information Processing Letters | 1980-01-01 | Paper |
The emptiness of complement problem for semi extended regular expressions requires \(c^n\) space
Information Processing Letters | 1979-01-01 | Paper |
A bounded storage algorithm for copying cyclic structures
Communications of the ACM | 1977-01-01 | Paper |
A simple solution to the interleaved memory bandwidth problem
Information Processing Letters | 1975-01-01 | Paper |
Bounds for Some Functions Concerning Dynamic Storage Allocation
Journal of the ACM | 1974-01-01 | Paper |
An Estimate of the Store Size Necessary for Dynamic Storage Allocation
Journal of the ACM | 1971-01-01 | Paper |
