| Publication | Date of Publication | Type |
|---|
A meta-theorem for distributed certification
Algorithmica | 2024-01-25 | Paper |
Energy-efficient distributed algorithms for synchronous networks
Structural Information and Communication Complexity | 2024-01-11 | Paper |
The Minimum Clique Routing Problem on Cycles
| 2023-11-16 | Paper |
scientific article; zbMATH DE number 7765409 (Why is no real title available?)
| 2023-11-14 | Paper |
Communication complexity meets cellular automata: necessary conditions for intrinsic universality
Natural Computing | 2023-09-08 | Paper |
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
| 2023-04-21 | Paper |
Three notes on distributed property testing
| 2023-02-03 | Paper |
Local certification of graphs with bounded genus
Discrete Applied Mathematics | 2022-12-08 | Paper |
A meta-theorem for distributed certification
| 2022-11-11 | Paper |
Distributed interactive proofs for the recognition of some geometric intersection graph classes
| 2022-11-11 | Paper |
Connectivity and connected components in the number-in-hand computation model
| 2022-10-25 | Paper |
The multiple traveling salesman problem on spiders
| 2022-03-24 | Paper |
The role of randomness in the broadcast congested clique model
Information and Computation | 2021-11-25 | Paper |
Compact distributed certification of planar graphs
Algorithmica | 2021-06-30 | Paper |
Compact Distributed Certification of Planar Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Communications in cellular automata
| 2021-01-20 | Paper |
Graph reconstruction in the congested clique
Journal of Computer and System Sciences | 2020-06-09 | Paper |
The impact of locality in the broadcast congested clique model
SIAM Journal on Discrete Mathematics | 2020-03-20 | Paper |
On distributed Merlin-Arthur decision protocols
| 2020-03-03 | Paper |
The impact of locality on the detection of cycles in the broadcast congested clique model
| 2020-02-12 | Paper |
Two rounds are enough for reconstructing any graph (class) in the congested clique model
| 2019-01-30 | Paper |
Distributed testing of excluded subgraphs
| 2018-08-16 | Paper |
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model
Networks | 2018-04-27 | Paper |
The effect of range and bandwidth on the round complexity in the congested clique model
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Brief announcement: A hierarchy of congested clique models, from broadcast to unicast
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
Cellular Automata and Discrete Complex Systems | 2015-08-04 | Paper |
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Distributed Computing | 2015-07-22 | Paper |
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Solving the density classification problem with a large diffusion and small amplification cellular automaton
Physica D | 2014-04-04 | Paper |
Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata
Theoretical Computer Science | 2013-02-19 | Paper |
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Erratum to: ``Communication complexity and intrinsic universality in cellular automata
Theoretical Computer Science | 2012-01-04 | Paper |
Traced communication complexity of cellular automata
Theoretical Computer Science | 2011-07-18 | Paper |
Communication complexity in number-conserving and monotone cellular automata
Theoretical Computer Science | 2011-07-14 | Paper |
On dissemination thresholds in regular and irregular graph classes
Algorithmica | 2011-03-02 | Paper |
Communication complexity and intrinsic universality in cellular automata
Theoretical Computer Science | 2011-01-10 | Paper |
Average long-lived memoryless consensus: the three-value case
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Minimal proper interval completions
Information Processing Letters | 2010-04-19 | Paper |
Average long-lived binary consensus: quantifying the stabilizing role played by memory
Theoretical Computer Science | 2010-04-06 | Paper |
Distributed computing of efficient routing schemes in generalized chordal graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
Algorithms and Computation | 2009-01-29 | Paper |
Small Alliances in Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Minimal Proper Interval Completions
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
On Dissemination Thresholds in Regular and Irregular Graph Classes
Lecture Notes in Computer Science | 2008-04-15 | Paper |
scientific article; zbMATH DE number 2119689 (Why is no real title available?)
| 2004-11-29 | Paper |
Cellular automata and communication complexity
Theoretical Computer Science | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2086231 (Why is no real title available?)
| 2004-08-11 | Paper |
Domino tilings and related models: Space of configurations of domains with holes
Theoretical Computer Science | 2004-08-10 | Paper |
AT-free graphs: Linear bounds for the oriented diameter
Discrete Applied Mathematics | 2004-08-06 | Paper |
Complexity of approximating the oriented diameter of chordal graphs
Journal of Graph Theory | 2004-03-29 | Paper |
scientific article; zbMATH DE number 1944404 (Why is no real title available?)
| 2003-11-10 | Paper |
Tiling with bars under tomographic constraints.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1953095 (Why is no real title available?)
| 2003-07-25 | Paper |
Bilateral orientations and domination
| 2001-10-24 | Paper |
Tiling allowing rotations only
Theoretical Computer Science | 1999-06-21 | Paper |
Complexity of tile rotation problems
Theoretical Computer Science | 1998-06-30 | Paper |
