Andrzej Pelc

Alexander A. Schwarzmann

Inf. Comput., 2017

Deterministic distributed construction of T-dominating sets in time T.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Leader Election in Trees with Customized Advice.

[BibT_eX]

[DOI]

Barun Gorain

CoRR, 2017

Impact of Knowledge on Election Time in Anonymous Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Short Labeling Schemes for Topology Recognition in Wireless Tree Networks.

[BibT_eX]

[DOI]

Barun Gorain

Proceedings of the Structural Information and Communication Complexity, 2017

Deterministic Graph Exploration with Advice.

[BibT_eX]

[DOI]

Barun Gorain

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Broadcasting in Geometric Radio Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Topology recognition and leader election in colored networks.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Theor. Comput. Sci., 2016

Exploration of Faulty Hamiltonian Graphs.

[BibT_eX]

[DOI]

David Caissy

Int. J. Found. Comput. Sci., 2016

Topology recognition with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Rendezvous in networks in spite of delay faults.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Algorithmica, 2016

Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees.

[BibT_eX]

[DOI]

Christian Glacet

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Asynchronous Broadcasting with Bivalent Beeps.

[BibT_eX]

[DOI]

Kokouvi Hounkanli

Proceedings of the Structural Information and Communication Complexity, 2016

Deterministic Meeting of Sniffing Agents in the Plane.

[BibT_eX]

[DOI]

Samir Elouasbi

Proceedings of the Structural Information and Communication Complexity, 2016

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC.

[BibT_eX]

[DOI]

Kokouvi Hounkanli

Proceedings of the Algorithms for Sensor Systems, 2016

2015

Deterministic Broadcasting and Gossiping with Beeps.

[BibT_eX]

[DOI]

Kokouvi Hounkanli

CoRR, 2015

Deterministic Rendezvous with Detection Using Beeps.

[BibT_eX]

[DOI]

Samir Elouasbi

Proceedings of the Algorithms for Sensor Systems, 2015

2014

Price of asynchrony in mobile agents computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Efficient Grid Exploration with a stationary Token.

[BibT_eX]

[DOI]

Anas Tiane

Int. J. Found. Comput. Sci., 2014

Leader election for anonymous asynchronous agents in arbitrary networks.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Distributed Comput., 2014

Time versus space trade-offs for rendezvous in trees.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Election vs. Selection: Two Ways of Finding the Largest Node in a Graph.

[BibT_eX]

[DOI]

CoRR, 2014

Time versus cost tradeoffs for deterministic rendezvous in networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Fault-Tolerant Rendezvous in Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Fast Rendezvous with Advice.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2014

2013

Worst-case optimal exploration of terrains with obstacles.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Use Knowledge to Learn Faster: Topology Recognition with Advice.

[BibT_eX]

[DOI]

Emanuele Guido Fusco

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Local Decision and Verification with Bounded-Size Outputs.

[BibT_eX]

[DOI]

Heger Arfaoui

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Anonymous Meeting in Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

How to meet asynchronously at polynomial cost.

[BibT_eX]

[DOI]

Vincent Villain

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Learning a Ring Cheaply and Fast.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Deterministic Polynomial Approach in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Choosing the best among peers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Announcing the 2012 Edsger W. Dijkstra prize in distributed computing.

[BibT_eX]

[DOI]

SIGARCH Comput. Archit. News, 2012

Deterministic rendezvous in networks: A comprehensive survey.

[BibT_eX]

[DOI]

Networks, 2012

Deterministic network exploration by a single agent with Byzantine tokens.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Collecting Information by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Time vs. space trade-offs for rendezvous in trees.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Gathering despite mischief.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization.

[BibT_eX]

[DOI]

Samir Elouasbi

Proceedings of the Structural Information and Communication Complexity, 2012

Tree Exploration by a Swarm of Mobile Agents.

[BibT_eX]

[DOI]

Mélanie Roy

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Electing a Leader in Multi-hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Decidability Classes for Mobile Agents Computing.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Knowledge, Level of Symmetry, and Time of Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Tree exploration with logarithmic memory.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

How many oblivious robots can explore a line.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Deterministic gathering of anonymous agents in arbitrary networks

[BibT_eX]

[DOI]

CoRR, 2011

DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2011

Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Communication Complexity of Consensus in Anonymous Message Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Efficient Distributed Communication in Ad-Hoc Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

The diameter and connectivity of networks with random dependent faults.

[BibT_eX]

[DOI]

Networks, 2010

Communication algorithms with advice.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Fault-tolerant strategies in the Iterated Prisoner's Dilemma.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

How Much Memory Is Needed for Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Drawing Maps with Advice.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimal Exploration of Terrains with Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Delays induce an exponential memory gap for rendezvous in trees.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

How to Meet Asynchronously (Almost) Everywhere.

[BibT_eX]

[DOI]

Arnaud Labourel

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Distributed Tree Comparison with Nodes of Limited Memory.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

Asynchronous Deterministic Rendezvous in Bounded Terrains.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

How to meet when you forget: log-space rendezvous in arbitrary graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Fault-Tolerant Sequential Scan.

[BibT_eX]

[DOI]

Paola Flocchini

Nicola Santoro

Theory Comput. Syst., 2009

Consensus and Mutual Exclusion in a Multiple Access Channel.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Optimality and Competitiveness of Exploring Polygons by Mobile Robots.

[BibT_eX]

[DOI]

Arnaud Labourel

Proceedings of the Algorithms, 2009

2008

Broadcasting in Geometric Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Acknowledged broadcasting in ad hoc radio networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Tree exploration with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Impact of Asynchrony on the Behavior of Rational Selfish Agents.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Special issue on DISC 07.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Impact of memory size on graph exploration capability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Broadcasting in UDG Radio Networks with Missing and Inaccurate Information.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Deterministic Rendezvous in Trees with Little Memory.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Trade-offs between the size of advice and broadcasting time in trees.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Fast Radio Broadcasting with Advice.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

Impact of Information on the Complexity of Asynchronous Radio Broadcasting.

[BibT_eX]

[DOI]

Tiziana Calamoneri

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Algorithmic aspects of radio communication.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

Communication in Random Geometric Radio Networks with Positively Correlated Random Faults.

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile and Wireless Networks, 7th International Conference, 2008

2007

Preface.

[BibT_eX]

[DOI]

Michel Raynal

Theor. Comput. Sci., 2007

Efficient Exploration of Faulty Trees.

[BibT_eX]

[DOI]

Euripides Markou

Theory Comput. Syst., 2007

Broadcasting in geometric radio networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Activating anonymous ad hoc radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2007

Optimal Deterministic Broadcasting in Known Topology Radio Networks.

[BibT_eX]

[DOI]

Distributed Comput., 2007

Searching for a Black Hole in Synchronous Tree Networks.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Assigning Bookmarks in Perfect Binary Trees.

[BibT_eX]

Ars Comb., 2007

Tree exploration with logarithmic memory.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Broadcasting in udg radio networks with unknown topology.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Communication in Networks with Random Dependent Faults.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Fast Adaptive Diagnosis with a Minimum Number of Tests.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Distributed Computing with Advice: Information Sensitivity of Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Deterministic M2M multicast in radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Voting Mechanisms in Asynchronous Byzantine Environments.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2006

Exploring Planar Graphs Using Unoriented Maps.

[BibT_eX]

[DOI]

Stefan Dobrev

J. Interconnect. Networks, 2006

Fast Broadcasting with Byzantine Faults.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Complexity of Searching for a Black Hole.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

Oracle size: a new measure of difficulty for communication tasks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Gathering Few Fat Mobile Robots in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Tree Exploration with an Oracle.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Gathering Asynchronous Oblivious Mobile Robots in a Ring.

[BibT_eX]

[DOI]

Ralf Klasing

Euripides Markou

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Broadcasting with locally bounded Byzantine faults.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Waking Up Anonymous Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

Feasibility and complexity of broadcasting with random transmission failures.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Asynchronous Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005

2004

Time of Deterministic Broadcasting in Radio Networks with Local Knowledge.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Distributed Colouring and Communication in Rings with Local Knowledge.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Optimal Decision Strategies in Byzantine Environments.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2004

Searching for a Black Hole in Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Graph Exploration by a Finite Automaton.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Collective Tree Exploration.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Polynomial Deterministic Rendezvous in Arbitrary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Deterministic M2M Multicast in Radio Networks: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

Trade-Offs Between Load and Degree in Virtual Path Layouts.

[BibT_eX]

[DOI]

Andrzej Lingas

Parallel Process. Lett., 2003

Enhancing Hyperlink Structure for Improving Web Performance.

[BibT_eX]

[DOI]

J. Web Eng., 2003

Linear-Time Prime Decomposition Of Regular Prefix Codes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Deterministic Computations on a PRAM with Static Processor and Memory Faults.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Labeling trees with a condition at distance two.

[BibT_eX]

[DOI]

Tiziana Calamoneri

Electron. Notes Discret. Math., 2003

Faster Deterministic Broadcasting in Ad Hoc Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Time of Radio Broadcasting.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Broadcasting in undirected ad hoc radio networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Leader Election in Rings with Nonunique Labels.

[BibT_eX]

Stefan Dobrev

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

Randomized Algorithms for Determining the Majority on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Searching games with errors - fifty years of coping with liars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The impact of information on broadcasting time in linear radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Deterministic broadcasting in ad hoc radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2002

Prime Decompositions of Regular Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

Tree exploration with little memory.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Deterministic Broadcasting Time in Radio Networks of Unknown Topology.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

Optimal Graph Exploration without Good Maps.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Transducers with Set Output.

[BibT_eX]

[DOI]

Wojciech Fraczak

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

The Wakeup Problem in Synchronous Broadcast Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Fault-Tolerant Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Danny Krizanc

J. Algorithms, 2001

Faster broadcasting in unknown radio networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Assigning labels in an unknown anonymous network with a leader.

[BibT_eX]

[DOI]

Distributed Comput., 2001

Deterministic Radio Broadcasting at Low Cost.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Tradeoffs between knowledge and time of communication in geometric radio networks.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Fast distributed graph coloring with O(Delta) colors.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Distributed coloring and communication in rings with local knowledge.

[BibT_eX]

[DOI]

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000

Power consumption in packet radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Better Adaptive Diagnosis of Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2000

Impact of topographic information on graph exploration efficiency.

[BibT_eX]

[DOI]

Networks, 2000

Optimal Broadcasting in Faulty Trees.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes.

[BibT_eX]

[DOI]

Algorithmica, 2000

Efficient Communication in Unknown Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Deterministic broadcasting in unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The wakeup problem in synchronous broadcast systems (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Assigning labels in unknown anonymous networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Deterministic Broadcasting Time with Partial Knowledge of the Network.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Strategies for Hotlink Assignments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

The Impact of Knowledge on Broadcasting Time in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Approximate Maxima Finding of Continuous Functions under Restricted Budget.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Optimal Diagnosis of Heterogeneous Systems with Random Faults.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1998

Time and Cost Trade-Offs in Gossiping.

[BibT_eX]

[DOI]

Artur Czumaj

SIAM J. Discret. Math., 1998

Broadcasting in Unlabeled Tori.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Broadcasting with linearly bounded transmission faults.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Minimum-time multidrop broadcast.

[BibT_eX]

[DOI]

Arthur M. Farley

Andrzej Proskurowski

Discret. Appl. Math., 1998

Perfect Broadcasting in Unlabeled Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Reliable Fault Diagnosis with Few Tests.

[BibT_eX]

[DOI]

Eli Upfal

Comb. Probab. Comput., 1998

Exploring Unknown Undirected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems.

[BibT_eX]

Anthony Spatharis

Proceedings of the SIROCCO'98, 1998

Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract).

[BibT_eX]

[DOI]

Danny Krizanc

Proceedings of the Algorithms, 1998

1997

Globally Optimal Diagnosis in Systems with Random Faults.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

Broadcasting with a Bounded Fraction of Faulty Nodes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures.

[BibT_eX]

[DOI]

Piotr Berman

J. Algorithms, 1997

Transition-Optimal Token Distribution.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Power Consumption in Packet Radio Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

An Optimal Algorithm for Broadcasting Multiple Messages in Trees.

[BibT_eX]

Andrzej Lingas

Proceedings of the SIROCCO'97, 1997

Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Universally Fault-Tolerant Broadcasting in Trees.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Reliable Computations on Faulty EREW PRAM.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Efficient Gossiping by Packets in Networks with Random Faults.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Adaptive Broadcasting with Faulty Nodes.

[BibT_eX]

[DOI]

Parallel Comput., 1996

Fault-tolerant broadcasting and gossiping in communication networks.

[BibT_eX]

[DOI]

Networks, 1996

Reliable Broadcasting in Hypercubes with Random Link and Node Failures.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

System Diagnosis with Smallest Risk of Error.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Efficient fault location with small risk.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

The Complexity of Data Mining on the Web (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Anonymous Wireless Rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1995

Token Transfer in a Faulty Network.

[BibT_eX]

[DOI]

Adam Malinowski

RAIRO Theor. Informatics Appl., 1995

Hop-congestion trade-offs for high-speed networks.

[BibT_eX]

[DOI]

Danny Krizanc

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Fast Fault-tolerant Broadcasting and Gossiping.

[BibT_eX]

Proceedings of the Structure, Information and Communication Complexity, 1995

Broadcasting with universal lists.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

Fast Deterministic Simulation of Computations on Faulty Parallel Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1994

Sorting on a Mesh-Connected Computer with Delaying Links.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Reliable Token Despersal with Random Faults.

[BibT_eX]

[DOI]

Adam Malinowski

Parallel Process. Lett., 1994

Reliable distributed diagnosis for multiprocessor systems with random faults.

[BibT_eX]

[DOI]

Piotr Berman

Networks, 1994

Optimal Coteries and Voting Schemes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Searching with Local Constraints on Error Patterns.

[BibT_eX]

[DOI]

K. B. Lakshmanan

Eur. J. Comb., 1994

Fast gossiping with short unreliable messages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Almost Safe Group Testing with Few Tests.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

The Buffer Potential of a Network.

[BibT_eX]

Proceedings of the Structural Information and Communication Complexity, 1994

Reliable Minimum Finding Comparator Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Waking up an Anonymous Faulty Network from a Single Source.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Fault-Tolerant Linear Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, 1994

1993

A Clustered Failure Model for the Memory Array Reconfiguration Problem.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

Diagnosis and Repair in Multiprocessor Systems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

Optimal communication in networks with randomly distributed byzantine faults.

[BibT_eX]

[DOI]

Networks, 1993

Fast Diagnosis of Multiprocessor Systems with Random Faults.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

Finding a Target Subnetwork in Sparse Networks with Random Faults.

[BibT_eX]

[DOI]

Claire Kenyon

Inf. Process. Lett., 1993

Sparse Networks Supporting Efficient Reliable Broadcasting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Efficient Distributed Diagnosis in the Presence of Random Faults.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS-23, 1993

1992

Optimal Fault Diagnosis in Comparison Models.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Complexity of Fault Diagnosis in Comparison Models.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Almost Safe Gossiping in Bounded Degree Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Broadcasting time in Sparse Networks with Faulty Transmissions.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1992

Reliable communication in networks with Byzantine link failures.

[BibT_eX]

[DOI]

Networks, 1992

1991

Undirected Graph Models for System-Level Fault Diagnosis.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1991

Motion Planning, Two-Directional Point Representations, and Ordered Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Searching with a Forbidden Lie Pattern in Responses.

[BibT_eX]

[DOI]

K. B. Lakshmanan

Inf. Process. Lett., 1991

Orders with Level Diagrams.

[BibT_eX]

[DOI]

Ivan Rival

Eur. J. Comb., 1991

Optimal Broadcasting in Faulty Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

1990

Drawing orders with few slopes.

[BibT_eX]

[DOI]

Ivan Rival

Discret. Math., 1990

Reliable diagnosis and repair in constant-degree multiprocessor systems.

[BibT_eX]

[DOI]

Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

Distributed probabilistic fault diagnosis for multiprocessor systems.

[BibT_eX]

[DOI]

Piotr Berman

Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1989

Weakly Adaptive Comparison Searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Searching with Known Error Probability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Detecting errors in searching games.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

Ulam's searching game with lies.

[BibT_eX]

[DOI]

Daniele Mundici

J. Comb. Theory A, 1989

1988

Prefix search with a lie.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

Solution of Ulam's problem on binary search with two lies.

[BibT_eX]

[DOI]

Daniele Mundici

J. Comb. Theory A, 1988

1987

Solution of Ulam's problem on searching with a lie.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

1986

Lie Patterns in Search Procedures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1984

Idempotent Ideals on Abelian Groups.

[BibT_eX]

[DOI]