Andrzej Pelc

According to our database1, Andrzej Pelc authored at least 261 papers between 1984 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel.
Theor. Comput. Sci., 2020

Deterministic Leader Election in Anonymous Radio Networks.
CoRR, 2020

2019
Deterministic Rendezvous Algorithms.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Deterministic Graph Exploration with Advice.
ACM Trans. Algorithms, 2019

Want to Gather? No Need to Chatter!
CoRR, 2019

Cost vs. Information Tradeoffs for Treasure Hunt in the Plane.
CoRR, 2019

Impact of Knowledge on Election Time in Anonymous Networks.
Algorithmica, 2019

Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Constant-Length Labeling Schemes for Deterministic Radio Broadcast.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Building a Nest by an Automaton.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Deterministic gathering with crash faults.
Networks, 2018

Use of information, memory and randomization in asynchronous gathering.
J. Comput. Syst. Sci., 2018

Reaching a target in the plane with no information.
Inf. Process. Lett., 2018

On deterministic rendezvous at a node of agents with arbitrary velocities.
Inf. Process. Lett., 2018

Deterministic Meeting of Sniffing Agents in the Plane.
Fundam. Inform., 2018

Information Complexity of Treasure Hunt in Geometric Terrains.
CoRR, 2018

Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane.
CoRR, 2018

Explorable Families of Graphs.
Proceedings of the Structural Information and Communication Complexity, 2018

Deterministic Treasure Hunt in the Plane with Angular Hints.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Finding the Size of a Radio Network with Short Labels.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees.
ACM Trans. Algorithms, 2017

Decidability classes for mobile agents computing.
J. Parallel Distributed Comput., 2017

Deterministic Rendezvous with Detection Using Beeps.
Int. J. Found. Comput. Sci., 2017

Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015).
Inf. Comput., 2017

Deterministic distributed construction of T-dominating sets in time T.
Discret. Appl. Math., 2017

Leader Election in Trees with Customized Advice.
CoRR, 2017

Short Labeling Schemes for Topology Recognition in Wireless Tree Networks.
Proceedings of the Structural Information and Communication Complexity, 2017

2016
Broadcasting in Geometric Radio Networks.
Encyclopedia of Algorithms, 2016

Topology recognition and leader election in colored networks.
Theor. Comput. Sci., 2016

Exploration of Faulty Hamiltonian Graphs.
Int. J. Found. Comput. Sci., 2016

Topology recognition with advice.
Inf. Comput., 2016

Time versus cost tradeoffs for deterministic rendezvous in networks.
Distributed Computing, 2016

Rendezvous in networks in spite of delay faults.
Distributed Computing, 2016

Anonymous Meeting in Networks.
Algorithmica, 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.
Algorithmica, 2016

Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Asynchronous Broadcasting with Bivalent Beeps.
Proceedings of the Structural Information and Communication Complexity, 2016

Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
Fast rendezvous with advice.
Theor. Comput. Sci., 2015

How to Meet Asynchronously at Polynomial Cost.
SIAM J. Comput., 2015

Tradeoffs between cost and information for rendezvous and treasure hunt.
J. Parallel Distributed Comput., 2015

Communication Complexity of Consensus in Anonymous Message Passing Systems.
Fundam. Inform., 2015

Knowledge, level of symmetry, and time of leader election.
Distributed Computing, 2015

Deterministic polynomial approach in the plane.
Distributed Computing, 2015

Deterministic Broadcasting and Gossiping with Beeps.
CoRR, 2015

2014
Price of asynchrony in mobile agents computing.
Theor. Comput. Sci., 2014

Gathering Despite Mischief.
ACM Trans. Algorithms, 2014

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports.
ACM Trans. Algorithms, 2014

Efficient Grid Exploration with a stationary Token.
Int. J. Found. Comput. Sci., 2014

Leader election for anonymous asynchronous agents in arbitrary networks.
Distributed Computing, 2014

Time versus space trade-offs for rendezvous in trees.
Distributed Computing, 2014

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

Fault-Tolerant Rendezvous in Networks.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs.
Theor. Comput. Sci., 2013

Delays Induce an Exponential Memory Gap for Rendezvous in Trees.
ACM Trans. Algorithms, 2013

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.
Theory Comput. Syst., 2013

Leader election in ad hoc radio networks: A keen ear helps.
J. Comput. Syst. Sci., 2013

Worst-case optimal exploration of terrains with obstacles.
Inf. Comput., 2013

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.
Algorithmica, 2013

Use Knowledge to Learn Faster: Topology Recognition with Advice.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Local Decision and Verification with Bounded-Size Outputs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Learning a Ring Cheaply and Fast.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Choosing the best among peers.
Theor. Comput. Sci., 2012

How to meet asynchronously (almost) everywhere.
ACM Trans. Algorithms, 2012

Announcing the 2012 Edsger W. Dijkstra prize in distributed computing.
SIGARCH Computer Architecture News, 2012

Deterministic rendezvous in networks: A comprehensive survey.
Networks, 2012

Distributed tree comparison with nodes of limited memory.
Networks, 2012

Drawing maps with advice.
J. Parallel Distributed Comput., 2012

Deterministic network exploration by a single agent with Byzantine tokens.
Inf. Process. Lett., 2012

How to meet when you forget: log-space rendezvous in arbitrary graphs.
Distributed Computing, 2012

Collecting Information by Power-Aware Mobile Agents.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Time vs. space trade-offs for rendezvous in trees.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization.
Proceedings of the Structural Information and Communication Complexity, 2012

Tree Exploration by a Swarm of Mobile Agents.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Electing a Leader in Multi-hop Radio Networks.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Consensus and Mutual Exclusion in a Multiple Access Channel.
IEEE Trans. Parallel Distrib. Syst., 2011

Asynchronous deterministic rendezvous in bounded terrains.
Theor. Comput. Sci., 2011

Tree exploration with logarithmic memory.
ACM Trans. Algorithms, 2011

How many oblivious robots can explore a line.
Inf. Process. Lett., 2011

Optimality and competitiveness of exploring polygons by mobile robots.
Inf. Comput., 2011

How much memory is needed for leader election.
Distributed Computing, 2011

Deterministic gathering of anonymous agents in arbitrary networks
CoRR, 2011

Trade-offs Between the Size of Advice and Broadcasting Time in Trees.
Algorithmica, 2011

DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Efficient Distributed Communication in Ad-Hoc Radio Networks.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Fast radio broadcasting with advice.
Theor. Comput. Sci., 2010

Remembering without memory: Tree exploration by asynchronous oblivious robots.
Theor. Comput. Sci., 2010

The diameter and connectivity of networks with random dependent faults.
Networks, 2010

Communication algorithms with advice.
J. Comput. Syst. Sci., 2010

Fault-tolerant strategies in the Iterated Prisoner's Dilemma.
Inf. Process. Lett., 2010

Broadcasting in UDG radio networks with missing and inaccurate information.
Distributed Computing, 2010

Communication in Random Geometric Radio Networks with Positively Correlated Random Faults.
Ad Hoc & Sensor Wireless Networks, 2010

Optimal Exploration of Terrains with Obstacles.
Proceedings of the Algorithm Theory, 2010

2009
Gathering few fat mobile robots in the plane.
Theor. Comput. Sci., 2009

Fault-Tolerant Sequential Scan.
Theory Comput. Syst., 2009

Distributed computing with advice: information sensitivity of graph coloring.
Distributed Computing, 2009

Broadcasting in UDG radio networks with unknown topology.
Distributed Computing, 2009

2008
Broadcasting in Geometric Radio Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Gathering asynchronous oblivious mobile robots in a ring.
Theor. Comput. Sci., 2008

Acknowledged broadcasting in ad hoc radio networks.
Inf. Process. Lett., 2008

Tree exploration with advice.
Inf. Comput., 2008

Impact of Asynchrony on the Behavior of Rational Selfish Agents.
Fundam. Inform., 2008

Special issue on DISC 07.
Distributed Computing, 2008

Impact of memory size on graph exploration capability.
Discret. Appl. Math., 2008

Deterministic Rendezvous in Trees with Little Memory.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Impact of Information on the Complexity of Asynchronous Radio Broadcasting.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Algorithmic aspects of radio communication.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007
Preface.
Theor. Comput. Sci., 2007

Feasibility and complexity of broadcasting with random transmission failures.
Theor. Comput. Sci., 2007

Efficient Exploration of Faulty Trees.
Theory Comput. Syst., 2007

Broadcasting in geometric radio networks.
J. Discrete Algorithms, 2007

Activating anonymous ad hoc radio networks.
Distributed Computing, 2007

Optimal Deterministic Broadcasting in Known Topology Radio Networks.
Distributed Computing, 2007

Searching for a Black Hole in Synchronous Tree Networks.
Combinatorics, Probability & Computing, 2007

Assigning Bookmarks in Perfect Binary Trees.
Ars Comb., 2007

Tree exploration with logarithmic memory.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Communication in Networks with Random Dependent Faults.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Fast Adaptive Diagnosis with a Minimum Number of Tests.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Asynchronous deterministic rendezvous in graphs.
Theor. Comput. Sci., 2006

Deterministic M2M multicast in radio networks.
Theor. Comput. Sci., 2006

Voting Mechanisms in Asynchronous Byzantine Environments.
Parallel Processing Letters, 2006

Collective tree exploration.
Networks, 2006

Optimal decision strategies in Byzantine environments.
J. Parallel Distributed Comput., 2006

Exploring Planar Graphs Using Unoriented Maps.
Journal of Interconnection Networks, 2006

Fast Broadcasting with Byzantine Faults.
Int. J. Found. Comput. Sci., 2006

Complexity of Searching for a Black Hole.
Fundam. Inform., 2006

Randomized Algorithms for Determining the Majority on Graphs.
Combinatorics, Probability & Computing, 2006

Deterministic Rendezvous in Graphs.
Algorithmica, 2006

Oracle size: a new measure of difficulty for communication tasks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Tree Exploration with an Oracle.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism.
Theor. Comput. Sci., 2005

Graph exploration by a finite automaton.
Theor. Comput. Sci., 2005

Transducers with Set Output.
Journal of Automata, Languages and Combinatorics, 2005

Broadcasting with locally bounded Byzantine faults.
Inf. Process. Lett., 2005

Broadcasting in undirected ad hoc radio networks.
Distributed Computing, 2005

Waking Up Anonymous Ad Hoc Radio Networks.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005

2004
Optimal graph exploration without good maps.
Theor. Comput. Sci., 2004

Faster Deterministic Broadcasting in Ad Hoc Radio Networks.
SIAM J. Discrete Math., 2004

Time of Deterministic Broadcasting in Radio Networks with Local Knowledge.
SIAM J. Comput., 2004

Tree exploration with little memory.
J. Algorithms, 2004

Leader Election in Rings with Nonunique Labels.
Fundam. Inform., 2004

Distributed Colouring and Communication in Rings with Local Knowledge.
Combinatorics, Probability & Computing, 2004

Searching for a Black Hole in Tree Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Polynomial Deterministic Rendezvous in Arbitrary Graphs.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Deterministic M2M Multicast in Radio Networks: (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.
Proceedings of the Approximation, 2004

2003
Deterministic broadcasting time with partial knowledge of the network.
Theor. Comput. Sci., 2003

Trade-Offs Between Load and Degree in Virtual Path Layouts.
Parallel Processing Letters, 2003

Enhancing Hyperlink Structure for Improving Web Performance.
J. Web Eng., 2003

Linear-Time Prime Decomposition Of Regular Prefix Codes.
Int. J. Found. Comput. Sci., 2003

Deterministic Computations on a PRAM with Static Processor and Memory Faults.
Fundam. Inform., 2003

Labeling trees with a condition at distance two.
Electron. Notes Discret. Math., 2003

Time of Radio Broadcasting.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Deterministic Rendezvous in Graphs.
Proceedings of the Algorithms, 2003

2002
Searching games with errors - fifty years of coping with liars.
Theor. Comput. Sci., 2002

The impact of information on broadcasting time in linear radio networks.
Theor. Comput. Sci., 2002

Deterministic radio broadcasting at low cost.
Networks, 2002

Deterministic broadcasting in ad hoc radio networks.
Distributed Computing, 2002

Prime Decompositions of Regular Prefix Codes.
Proceedings of the Implementation and Application of Automata, 2002

Deterministic Broadcasting Time in Radio Networks of Unknown Topology.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
The Wakeup Problem in Synchronous Broadcast Systems.
SIAM J. Discrete Math., 2001

Efficient communication in unknown networks.
Networks, 2001

Fault-Tolerant Broadcasting in Radio Networks.
J. Algorithms, 2001

Faster broadcasting in unknown radio networks.
Inf. Process. Lett., 2001

Assigning labels in an unknown anonymous network with a leader.
Distributed Computing, 2001

Tradeoffs between knowledge and time of communication in geometric radio networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Fast distributed graph coloring with O(Delta) colors.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Distributed coloring and communication in rings with local knowledge.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
Power consumption in packet radio networks.
Theor. Comput. Sci., 2000

Better Adaptive Diagnosis of Hypercubes.
IEEE Trans. Computers, 2000

Impact of topographic information on graph exploration efficiency.
Networks, 2000

Optimal Broadcasting in Faulty Trees.
J. Parallel Distributed Comput., 2000

Reliable Minimum Finding Comparator Networks.
Fundam. Inform., 2000

Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes.
Algorithmica, 2000

Deterministic broadcasting in unknown radio networks.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

The wakeup problem in synchronous broadcast systems (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Assigning labels in unknown anonymous networks (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Strategies for Hotlink Assignments.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Optimal adaptive fault diagnosis for simple multiprocessor systems.
Networks, 1999

An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
J. Parallel Distributed Comput., 1999

Exploring Unknown Undirected Graphs.
J. Algorithms, 1999

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Int. J. Found. Comput. Sci., 1999

The Impact of Knowledge on Broadcasting Time in Radio Networks.
Proceedings of the Algorithms, 1999

1998
Approximate Maxima Finding of Continuous Functions under Restricted Budget.
Theor. Comput. Sci., 1998

System Diagnosis with Smallest Risk of Error.
Theor. Comput. Sci., 1998

Optimal Diagnosis of Heterogeneous Systems with Random Faults.
IEEE Trans. Computers, 1998

Time and Cost Trade-Offs in Gossiping.
SIAM J. Discrete Math., 1998

Broadcasting in Unlabeled Tori.
Parallel Processing Letters, 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
Inf. Process. Lett., 1998

Broadcasting with linearly bounded transmission faults.
Discret. Appl. Math., 1998

Minimum-time multidrop broadcast.
Discret. Appl. Math., 1998

Perfect Broadcasting in Unlabeled Networks.
Discret. Appl. Math., 1998

Reliable Fault Diagnosis with Few Tests.
Combinatorics, Probability & Computing, 1998

Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
Globally Optimal Diagnosis in Systems with Random Faults.
IEEE Trans. Computers, 1997

Broadcasting with a Bounded Fraction of Faulty Nodes.
J. Parallel Distributed Comput., 1997

Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures.
J. Algorithms, 1997

Hop-Congestion Trade-Offs for High-Speed Networks.
Int. J. Found. Comput. Sci., 1997

Transition-Optimal Token Distribution.
Fundam. Inform., 1997

Power Consumption in Packet Radio Networks (Extended Abstract).
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract).
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Universally Fault-Tolerant Broadcasting in Trees.
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).
Proceedings of the Algorithms, 1997

1996
Reliable Computations on Faulty EREW PRAM.
Theor. Comput. Sci., 1996

Efficient Gossiping by Packets in Networks with Random Faults.
SIAM J. Discrete Math., 1996

Adaptive Broadcasting with Faulty Nodes.
Parallel Comput., 1996

Fault-Tolerant Linear Broadcasting.
Nord. J. Comput., 1996

Fault-tolerant broadcasting and gossiping in communication networks.
Networks, 1996

Broadcasting with universal lists.
Networks, 1996

Reliable Broadcasting in Hypercubes with Random Link and Node Failures.
Combinatorics, Probability & Computing, 1996

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Efficient fault location with small risk.
Proceedings of the SIROCCO'96, 1996

The Complexity of Data Mining on the Web (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Anonymous Wireless Rings.
Theor. Comput. Sci., 1995

Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults.
Parallel Processing Letters, 1995

Token Transfer in a Faulty Network.
ITA, 1995

Fast Fault-tolerant Broadcasting and Gossiping.
Proceedings of the Structure, Information and Communication Complexity, 1995

Fast Deterministic Simulation of Computations on Faulty Parallel Machines.
Proceedings of the Algorithms, 1995

1994
Almost Certain Fault Diagnosis Through Algorithm-Based Fault Tolerance.
IEEE Trans. Parallel Distrib. Syst., 1994

Sorting on a Mesh-Connected Computer with Delaying Links.
SIAM J. Discrete Math., 1994

Reliable Token Despersal with Random Faults.
Parallel Processing Letters, 1994

Sparse Networks Supporting Efficient Reliable Broadcasting.
Nord. J. Comput., 1994

Reliable distributed diagnosis for multiprocessor systems with random faults.
Networks, 1994

Optimal Coteries and Voting Schemes.
Inf. Process. Lett., 1994

Searching with Local Constraints on Error Patterns.
Eur. J. Comb., 1994

Fast gossiping with short unreliable messages.
Discret. Appl. Math., 1994

Almost Safe Group Testing with Few Tests.
Combinatorics, Probability & Computing, 1994

The Buffer Potential of a Network.
Proceedings of the Structural Information and Communication Complexity, 1994

Waking up an Anonymous Faulty Network from a Single Source.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
A Clustered Failure Model for the Memory Array Reconfiguration Problem.
IEEE Trans. Computers, 1993

Diagnosis and Repair in Multiprocessor Systems.
IEEE Trans. Computers, 1993

Optimal communication in networks with randomly distributed byzantine faults.
Networks, 1993

Fast Diagnosis of Multiprocessor Systems with Random Faults.
ITA, 1993

Finding a Target Subnetwork in Sparse Networks with Random Faults.
Inf. Process. Lett., 1993

Efficient Distributed Diagnosis in the Presence of Random Faults.
Proceedings of the Digest of Papers: FTCS-23, 1993

1992
Optimal Fault Diagnosis in Comparison Models.
IEEE Trans. Computers, 1992

Complexity of Fault Diagnosis in Comparison Models.
IEEE Trans. Computers, 1992

Almost Safe Gossiping in Bounded Degree Networks.
SIAM J. Discrete Math., 1992

Broadcasting time in Sparse Networks with Faulty Transmissions.
Parallel Processing Letters, 1992

Reliable communication in networks with Byzantine link failures.
Networks, 1992

1991
Undirected Graph Models for System-Level Fault Diagnosis.
IEEE Trans. Computers, 1991

Motion Planning, Two-Directional Point Representations, and Ordered Sets.
SIAM J. Discrete Math., 1991

Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls.
Inf. Process. Lett., 1991

Searching with a Forbidden Lie Pattern in Responses.
Inf. Process. Lett., 1991

Orders with Level Diagrams.
Eur. J. Comb., 1991

Optimal Broadcasting in Faulty Hypercubes.
Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

1990
Drawing orders with few slopes.
Discret. Math., 1990

Reliable diagnosis and repair in constant-degree multiprocessor systems.
Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

Distributed probabilistic fault diagnosis for multiprocessor systems.
Proceedings of the 20th International Symposium on Fault-Tolerant Computing, 1990

1989
Weakly Adaptive Comparison Searching.
Theor. Comput. Sci., 1989

Searching with Known Error Probability.
Theor. Comput. Sci., 1989

Detecting errors in searching games.
J. Comb. Theory, Ser. A, 1989

Ulam's searching game with lies.
J. Comb. Theory, Ser. A, 1989

1988
Prefix search with a lie.
J. Comb. Theory, Ser. A, 1988

Solution of Ulam's problem on binary search with two lies.
J. Comb. Theory, Ser. A, 1988

1987
Solution of Ulam's problem on searching with a lie.
J. Comb. Theory, Ser. A, 1987

1986
Lie Patterns in Search Procedures.
Theor. Comput. Sci., 1986

1984
Idempotent Ideals on Abelian Groups.
J. Symb. Log., 1984


  Loading...