| Publication | Date of Publication | Type |
|---|
Exploration of convex terrains by a deterministic automaton with pebbles
Theoretical Computer Science | 2026-03-20 | Paper |
Want to gather? No need to chatter!
SIAM Journal on Computing | 2025-01-14 | Paper |
Graph exploration by a deterministic memoryless automaton with pebbles
Discrete Applied Mathematics | 2024-08-09 | Paper |
| System diagnosis with smallest risk of error | 2024-06-05 | Paper |
| Approximate maxima finding of continuous functions under restricted budget (extended abstract) | 2024-06-05 | Paper |
Deterministic treasure hunt and rendezvous in arbitrary connected graphs
Information Processing Letters | 2024-03-13 | Paper |
Deterministic rendezvous in infinite trees
Theoretical Computer Science | 2024-01-02 | Paper |
Impact of knowledge on the cost of treasure hunt in trees
Networks | 2023-12-12 | Paper |
| Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. | 2023-12-08 | Paper |
Four shades of deterministic leader election in anonymous networks
Distributed Computing | 2023-11-21 | Paper |
Deterministic Leader Election in Anonymous Radio Networks
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Almost universal anonymous rendezvous in the plane
Algorithmica | 2023-10-06 | Paper |
Deterministic size discovery and topology recognition in radio networks with short labels
Information and Computation | 2023-05-19 | Paper |
Fast deterministic simulation of computations on faulty parallel machines
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Power consumption in packet radio networks (extended abstract)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Reliable minimum finding comparator networks
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| scientific article; zbMATH DE number 7561402 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7525472 (Why is no real title available?) | 2022-05-11 | Paper |
| Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract) | 2021-12-20 | Paper |
Advice complexity of treasure hunt in geometric terrains
Information and Computation | 2021-11-25 | Paper |
Finding the size and the diameter of a radio network using short labels
Theoretical Computer Science | 2021-04-08 | Paper |
Want to Gather? No Need to Chatter!
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Short labeling schemes for topology recognition in wireless tree networks
Theoretical Computer Science | 2021-03-09 | Paper |
Building a nest by an automaton
Algorithmica | 2021-02-01 | Paper |
Deterministic broadcasting in ad hoc radio networks
Distributed Computing | 2020-12-03 | Paper |
Assigning labels in an unknown anonymous network with a leader
Distributed Computing | 2020-12-03 | Paper |
Deterministic treasure hunt in the plane with angular hints
Algorithmica | 2020-10-21 | Paper |
Deterministic treasure hunt in the plane with angular hints
Algorithmica | 2020-10-21 | Paper |
| Deterministic Graph Exploration with Advice | 2020-05-27 | Paper |
Deciding and verifying network properties locally with few output bits
Distributed Computing | 2020-04-23 | Paper |
Global synchronization and consensus using beeps in a fault-prone multiple access channel
Theoretical Computer Science | 2020-01-16 | Paper |
Anonymous Meeting in Networks
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Gathering despite mischief | 2019-05-10 | Paper |
Sparse networks supporting efficient reliable broadcasting
Automata, Languages and Programming | 2019-03-29 | Paper |
Deterministic graph exploration with advice
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Deterministic graph exploration with advice
ACM Transactions on Algorithms | 2019-03-28 | Paper |
| Explorable families of graphs | 2019-01-30 | Paper |
Impact of knowledge on election time in anonymous networks
Algorithmica | 2019-01-11 | Paper |
Time vs. information tradeoffs for leader election in anonymous trees
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Gathering despite mischief
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Reaching a target in the plane with no information
Information Processing Letters | 2018-10-19 | Paper |
Deterministic gathering with crash faults
Networks | 2018-10-04 | Paper |
Deterministic distributed construction of \(T\)-dominating sets in time \(T\)
Discrete Applied Mathematics | 2018-09-25 | Paper |
Deterministic Meeting of Sniffing Agents in the Plane*
Fundamenta Informaticae | 2018-07-18 | Paper |
Time vs. information tradeoffs for leader election in anonymous trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Optimal diagnosis of heterogeneous systems with random faults
IEEE Transactions on Computers | 2018-07-09 | Paper |
Use of information, memory and randomization in asynchronous gathering
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Short labeling schemes for topology recognition in wireless tree networks
Lecture Notes in Computer Science | 2018-04-12 | Paper |
On deterministic rendezvous at a node of agents with arbitrary velocities
Information Processing Letters | 2018-03-16 | Paper |
Deterministic rendezvous with detection using beeps
International Journal of Foundations of Computer Science | 2017-04-26 | Paper |
Exploration of Faulty Hamiltonian Graphs
International Journal of Foundations of Computer Science | 2017-03-28 | Paper |
Asynchronous broadcasting with bivalent beeps
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Deterministic meeting of sniffing agents in the plane
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Rendezvous in networks in spite of delay faults
Distributed Computing | 2016-07-05 | Paper |
Communication complexity of consensus in anonymous message passing systems
Fundamenta Informaticae | 2016-05-11 | Paper |
Anonymous meeting in networks
Algorithmica | 2016-03-29 | Paper |
Convergecast and broadcast by power-aware mobile agents
Algorithmica | 2016-03-23 | Paper |
Deterministic rendezvous with detection using beeps
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Topology recognition with advice
Information and Computation | 2016-03-10 | Paper |
Time versus cost tradeoffs for deterministic rendezvous in networks
Distributed Computing | 2016-03-01 | Paper |
Topology recognition and leader election in colored networks
Theoretical Computer Science | 2016-02-26 | Paper |
Fast rendezvous with advice
Theoretical Computer Science | 2015-12-11 | Paper |
Knowledge, level of symmetry, and time of leader election
Distributed Computing | 2015-09-29 | Paper |
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Time versus cost tradeoffs for deterministic rendezvous in networks
1321.68318 | 2015-09-03 | Paper |
Deterministic polynomial approach in the plane
Distributed Computing | 2015-07-08 | Paper |
How to meet asynchronously at polynomial cost
SIAM Journal on Computing | 2015-06-24 | Paper |
Minimizing congestion of layouts for ATM networks with faulty links
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Oracle size, a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing | 2015-03-03 | Paper |
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Tree exploration with logarithmic memory | 2014-12-18 | Paper |
Delays induce an exponential memory gap for rendezvous in trees
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Efficient grid exploration with a stationary token
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Tree exploration with logarithmic memory
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Leader election for anonymous asynchronous agents in arbitrary networks
Distributed Computing | 2014-07-11 | Paper |
Time versus space trade-offs for rendezvous in trees
Distributed Computing | 2014-07-11 | Paper |
Fault-tolerant rendezvous in networks
Automata, Languages, and Programming | 2014-07-01 | Paper |
| How to meet asynchronously (almost) everywhere | 2014-05-22 | Paper |
Broadcasting in UDG radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Price of asynchrony in mobile agents computing
Theoretical Computer Science | 2014-02-11 | Paper |
Leader election in ad hoc radio networks: a keen ear helps
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Theoretical Computer Science | 2014-01-13 | Paper |
Worst-case optimal exploration of terrains with obstacles
Information and Computation | 2013-11-29 | Paper |
Deterministic Polynomial Approach in the Plane
Automata, Languages, and Programming | 2013-08-07 | Paper |
Learning a ring cheaply and fast
Automata, Languages, and Programming | 2013-08-07 | Paper |
Distributed tree comparison with nodes of limited memory
Networks | 2013-08-06 | Paper |
Computing without communicating: ring exploration by asynchronous oblivious robots
Algorithmica | 2013-08-05 | Paper |
Broadcasting in UDG radio networks with missing and inaccurate information
Distributed Computing | 2013-06-28 | Paper |
Distributed computing with advice: information sensitivity of graph coloring
Distributed Computing | 2013-06-28 | Paper |
Broadcasting in UDG radio networks with unknown topology
Distributed Computing | 2013-06-28 | Paper |
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing | 2013-06-20 | Paper |
Activating anonymous ad hoc radio networks
Distributed Computing | 2013-06-20 | Paper |
Broadcasting in undirected ad hoc radio networks
Distributed Computing | 2013-06-07 | Paper |
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Theory of Computing Systems | 2013-04-15 | Paper |
How many oblivious robots can explore a line
Information Processing Letters | 2013-04-04 | Paper |
Collecting information by power-aware mobile agents
Lecture Notes in Computer Science | 2013-03-13 | Paper |
How to meet when you forget: log-space rendezvous in arbitrary graphs
Distributed Computing | 2013-02-04 | Paper |
Deterministic network exploration by anonymous silent agents with local traffic reports
Automata, Languages, and Programming | 2012-11-01 | Paper |
Knowledge, level of symmetry, and time of leader election
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Choosing the best among peers
Theoretical Computer Science | 2012-08-08 | Paper |
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters | 2012-07-25 | Paper |
Drawing maps with advice
Journal of Parallel and Distributed Computing | 2012-07-13 | Paper |
Decidability classes for mobile agents computing
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
How much memory is needed for leader election
Distributed Computing | 2012-02-06 | Paper |
Fault-tolerant strategies in the iterated prisoner's dilemma
Information Processing Letters | 2012-01-18 | Paper |
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science | 2011-12-07 | Paper |
Efficient distributed communication in ad-hoc radio networks
Automata, Languages and Programming | 2011-07-07 | Paper |
Trade-offs between the size of advice and broadcasting time in trees
Algorithmica | 2011-07-01 | Paper |
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation | 2011-01-13 | Paper |
The diameter and connectivity of networks with random dependent faults
Networks | 2010-11-24 | Paper |
Drawing maps with advice
Lecture Notes in Computer Science | 2010-09-10 | Paper |
How much memory is needed for leader election
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Optimal Exploration of Terrains with Obstacles
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Distributed tree comparison with nodes of limited memory
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Asynchronous deterministic rendezvous in bounded terrains
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters | 2010-06-09 | Paper |
Communication algorithms with advice
Journal of Computer and System Sciences | 2010-05-25 | Paper |
Fast radio broadcasting with advice
Theoretical Computer Science | 2010-04-06 | Paper |
Remembering without memory: tree exploration by asynchronous oblivious robots
Theoretical Computer Science | 2010-04-06 | Paper |
Deterministic rendezvous in graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Consensus and Mutual Exclusion in a Multiple Access Channel
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Why Do We Believe Theorems?
Philosophia Mathematica | 2009-10-15 | Paper |
Fault-tolerant sequential scan
Theory of Computing Systems | 2009-09-18 | Paper |
Broadcasting with locally bounded byzantine faults
Information Processing Letters | 2009-08-27 | Paper |
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
Automata, Languages and Programming | 2009-07-14 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Gathering few fat mobile robots in the plane
Theoretical Computer Science | 2009-03-02 | Paper |
Tree exploration with advice
Information and Computation | 2008-12-03 | Paper |
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Deterministic Rendezvous in Trees with Little Memory
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Impact of memory size on graph exploration capability
Discrete Applied Mathematics | 2008-09-29 | Paper |
Communication in Networks with Random Dependent Faults
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Fast Radio Broadcasting with Advice
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Fast Adaptive Diagnosis with a Minimum Number of Tests
Algorithms and Computation | 2008-05-27 | Paper |
Broadcasting in geometric radio networks
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Gathering Asynchronous Oblivious Mobile Robots in a Ring
Algorithms and Computation | 2008-04-24 | Paper |
| Impact of asynchrony on the behavior of rational selfish agents | 2008-03-19 | Paper |
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science | 2008-03-05 | Paper |
Searching for a Black Hole in Synchronous Tree Networks
Combinatorics, Probability and Computing | 2008-01-18 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
Automata, Languages and Programming | 2007-11-28 | Paper |
| Assigning bookmarks in perfect binary trees. | 2007-09-21 | Paper |
Tree Exploration with an Oracle
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Labeling trees with a condition at distance two
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Efficient exploration of faulty trees
Theory of Computing Systems | 2007-03-12 | Paper |
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science | 2007-02-26 | Paper |
Collective tree exploration
Networks | 2007-02-15 | Paper |
FAST BROADCASTING WITH BYZANTINE FAULTS
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
Randomized Algorithms for Determining the Majority on Graphs
Combinatorics, Probability and Computing | 2007-02-07 | Paper |
Better adaptive diagnosis of hypercubes
IEEE Transactions on Computers | 2007-01-09 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Deterministic M2M multicast in radio networks
Theoretical Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Deterministic rendezvous in graphs
Algorithmica | 2006-10-16 | Paper |
Labeling trees with a condition at distance two
Discrete Mathematics | 2006-08-04 | Paper |
| Complexity of searching for a black hole | 2006-08-03 | Paper |
Optimal decision strategies in Byzantine environments
Journal of Parallel and Distributed Computing | 2006-05-22 | Paper |
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science | 2006-04-28 | Paper |
| Transducers with set output | 2006-02-06 | Paper |
Broadcasting in unlabeled hypercubes with a linear number of messages.
Information Processing Letters | 2006-01-17 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Graph exploration by a finite automaton
Theoretical Computer Science | 2005-12-06 | Paper |
LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
Texts in Theoretical Computer Science. An EATCS Series | 2005-04-27 | Paper |
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
Theoretical Computer Science | 2005-04-06 | Paper |
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing | 2005-02-21 | Paper |
Optimal graph exploration without good maps
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2119714 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2113969 (Why is no real title available?) | 2004-11-05 | Paper |
Tree exploration with little memory
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2089985 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080232 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080261 (Why is no real title available?) | 2004-08-04 | Paper |
scientific article; zbMATH DE number 1998328 (Why is no real title available?)
(available as arXiv preprint) | 2003-10-29 | Paper |
Deterministic broadcasting time with partial knowledge of the network.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962806 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962770 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1947407 (Why is no real title available?) | 2003-07-08 | Paper |
The impact of information on broadcasting time in linear radio networks.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1735313 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1696532 (Why is no real title available?) | 2002-07-22 | Paper |
Faster broadcasting in unknown radio networks
Information Processing Letters | 2002-07-14 | Paper |
Deterministic radio broadcasting at low cost
Networks | 2002-07-01 | Paper |
| Fast distributed graph coloring with \(O(\Delta)\) colors | 2002-03-24 | Paper |
Searching games with errors -- fifty years of coping with liars
Theoretical Computer Science | 2002-03-03 | Paper |
Optimal adaptive fault diagnosis for simple multiprocessor systems
Networks | 2002-01-27 | Paper |
| scientific article; zbMATH DE number 1688360 (Why is no real title available?) | 2002-01-09 | Paper |
Efficient communication in unknown networks
Networks | 2001-10-14 | Paper |
Fault-tolerant broadcasting in radio networks
Journal of Algorithms | 2001-07-29 | Paper |
The wakeup problem in synchronous broadcast systems
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| Impact of topographic information on graph exploration efficiency | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1515321 (Why is no real title available?) | 2000-10-10 | Paper |
Optimal broadcasting in faulty trees
Journal of Parallel and Distributed Computing | 2000-08-27 | Paper |
Power consumption in packet radio networks
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1445388 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1405786 (Why is no real title available?) | 2000-03-27 | Paper |
Exploring Unknown Undirected Graphs
Journal of Algorithms | 2000-03-19 | Paper |
An optimal algorithm for broadcasting multiple messages in trees
Journal of Parallel and Distributed Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1303571 (Why is no real title available?) | 1999-06-17 | Paper |
Minimum-time multidrop broadcast
Discrete Applied Mathematics | 1999-05-30 | Paper |
| scientific article; zbMATH DE number 1267563 (Why is no real title available?) | 1999-03-22 | Paper |
Reliable Fault Diagnosis with Few Tests
Combinatorics, Probability and Computing | 1999-02-02 | Paper |
Approximate maxima finding of continuous functions under restricted budget
Theoretical Computer Science | 1999-01-12 | Paper |
System diagnosis with smallest risk of error
Theoretical Computer Science | 1999-01-12 | Paper |
Broadcasting with linearly bounded transmission faults
Discrete Applied Mathematics | 1998-11-19 | Paper |
Perfect broadcasting in unlabeled networks
Discrete Applied Mathematics | 1998-11-03 | Paper |
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
Hop-Congestion Trade-Offs for High-Speed Networks
International Journal of Foundations of Computer Science | 1997-09-29 | Paper |
| Fault-tolerant broadcasting and gossiping in communication networks | 1997-07-06 | Paper |
Reliable broadcasting in hypercubes with random link and node failures
Combinatorics, Probability and Computing | 1997-05-22 | Paper |
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
Journal of Algorithms | 1997-05-20 | Paper |
Anonymous wireless rings
Theoretical Computer Science | 1997-02-28 | Paper |
Adaptive broadcasting with faulty nodes
Parallel Computing | 1997-02-27 | Paper |
Reliable computations on faulty EREW PRAM
Theoretical Computer Science | 1997-02-27 | Paper |
| Broadcasting with universal lists | 1996-11-25 | Paper |
| scientific article; zbMATH DE number 935188 (Why is no real title available?) | 1996-10-14 | Paper |
Efficient Gossiping by Packets in Networks with Random Faults
SIAM Journal on Discrete Mathematics | 1996-06-05 | Paper |
Token transfer in a faulty network
RAIRO - Theoretical Informatics and Applications | 1996-05-27 | Paper |
| scientific article; zbMATH DE number 751136 (Why is no real title available?) | 1995-05-04 | Paper |
Almost Safe Group Testing with Few Tests
Combinatorics, Probability and Computing | 1995-01-25 | Paper |
Reliable distributed diagnosis for multiprocessor systems with random faults
Networks | 1995-01-11 | Paper |
Fast diagnosis of multiprocessor systems with random faults
RAIRO - Theoretical Informatics and Applications | 1995-01-02 | Paper |
Fast gossiping with short unreliable messages
Discrete Applied Mathematics | 1994-12-11 | Paper |
Finding a target subnetwork in sparse networks with random faults
Information Processing Letters | 1994-09-25 | Paper |
Optimal coteries and voting schemes
Information Processing Letters | 1994-08-03 | Paper |
Searching with local constraints on error patterns
European Journal of Combinatorics | 1994-07-19 | Paper |
Sorting on a Mesh-Connected Computer with Delaying Links
SIAM Journal on Discrete Mathematics | 1994-05-12 | Paper |
Optimal communication in networks with randomly distributed byzantine faults
Networks | 1994-05-09 | Paper |
Almost Safe Gossiping in Bounded Degree Networks
SIAM Journal on Discrete Mathematics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 90553 (Why is no real title available?) | 1993-01-16 | Paper |
Reliable communication in networks with Byzantine link failures
Networks | 1992-10-13 | Paper |
Broadcasting in complete networks with faulty nodes using unreliable calls
Information Processing Letters | 1992-06-28 | Paper |
Crooked diagrams with few slopes
Order | 1992-06-25 | Paper |
Searching with a forbidden lie pattern in responses
Information Processing Letters | 1991-01-01 | Paper |
Orders with level diagrams
European Journal of Combinatorics | 1991-01-01 | Paper |
Motion Planning,Two-Directional Point Representation, and Ordered Sets
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
Drawing orders with few slopes
Discrete Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4167784 (Why is no real title available?) | 1990-01-01 | Paper |
Searching with known error probability
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4185611 (Why is no real title available?) | 1989-01-01 | Paper |
Detecting errors in searching games
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Ulam's searching game with lies
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Weakly adaptive comparison searching
Theoretical Computer Science | 1989-01-01 | Paper |
Prefix search with a lie
Journal of Combinatorial Theory. Series A | 1988-01-01 | Paper |
Solution of Ulam's problem on binary search with two lies
Journal of Combinatorial Theory. Series A | 1988-01-01 | Paper |
Invariant measures on abelian metric groups
Colloquium Mathematicum | 1987-01-01 | Paper |
Solution of Ulam's problem on searching with a lie
Journal of Combinatorial Theory. Series A | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047591 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4014726 (Why is no real title available?) | 1986-01-01 | Paper |
| Invariant Ideals and Borel Sets | 1986-01-01 | Paper |
Lie patterns in search procedures
Theoretical Computer Science | 1986-01-01 | Paper |
On the existence of measures on σ-algebras
Fundamenta Mathematicae | 1985-01-01 | Paper |
Extensions of invariant measures on Euclidean spaces
Fundamenta Mathematicae | 1985-01-01 | Paper |
Idempotent ideals on abelian groups
Journal of Symbolic Logic | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3948644 (Why is no real title available?) | 1984-01-01 | Paper |
| The Nonexistence of Maximal Invariant Measures on Abelian Groups | 1984-01-01 | Paper |
Combinatorics on σ-algebras and problem of Banach
Fundamenta Mathematicae | 1984-01-01 | Paper |
| On a Problem of Banach | 1983-01-01 | Paper |
| Semiregular Invariant Measures on Abelian Groups | 1982-01-01 | Paper |
Solution of a problem of Ulam on countable sequences of sets
Fundamenta Mathematicae | 1981-01-01 | Paper |
Ideals on the real line and Ulam's problem
Fundamenta Mathematicae | 1981-01-01 | Paper |
On families of σ-complete ideals
Fundamenta Mathematicae | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3675872 (Why is no real title available?) | 1978-01-01 | Paper |
