The following pages link to Andrzej Pelc (Q235631):
Displaying 50 items.
- Gathering Despite Mischief (Q4962159) (← links)
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports (Q4962168) (← links)
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees (Q4962669) (← links)
- Power consumption in packet radio networks (Q5048938) (← links)
- (Q5075773) (← links)
- (Q5091040) (← links)
- Reliable minimum finding comparator networks (Q5096888) (← links)
- Deterministic Graph Exploration with Advice (Q5111464) (← links)
- Assigning labels in an unknown anonymous network with a leader (Q5138359) (← links)
- Deterministic broadcasting in ad hoc radio networks (Q5138368) (← links)
- Fault-Tolerant Rendezvous in Networks (Q5167856) (← links)
- How to meet asynchronously at polynomial cost (Q5176086) (← links)
- How to meet when you forget (Q5176220) (← links)
- Assigning labels in unknown anonymous networks (extended abstract) (Q5176776) (← links)
- The wakeup problem in synchronous broadcast systems (extended abstract) (Q5176777) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q5177256) (← links)
- Oracle size (Q5177279) (← links)
- MINIMIZING CONGESTION OF LAYOUTS FOR ATM NETWORKS WITH FAULTY LINKS (Q5249024) (← links)
- (Q5310248) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311120) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313020) (← links)
- Structural Information and Communication Complexity (Q5315232) (← links)
- Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps (Q5321682) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- Deterministic Polynomial Approach in the Plane (Q5327463) (← links)
- Learning a Ring Cheaply and Fast (Q5327465) (← links)
- Fast Adaptive Diagnosis with a Minimum Number of Tests (Q5387775) (← links)
- Distributed Computing (Q5395153) (← links)
- Broadcasting in udg radio networks with unknown topology (Q5401412) (← links)
- (Q5417602) (← links)
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring (Q5428812) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431324) (← links)
- Searching for a Black Hole in Synchronous Tree Networks (Q5437234) (← links)
- (Q5450114) (← links)
- Gathering Asynchronous Oblivious Mobile Robots in a Ring (Q5459168) (← links)
- Automata, Languages and Programming (Q5466503) (← links)
- (Q5480656) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492864) (← links)
- Fault-tolerant broadcasting and gossiping in communication networks (Q5689809) (← links)
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES (Q5696951) (← links)
- Algorithms and Computation (Q5712153) (← links)
- Principles of Distributed Systems (Q5713696) (← links)
- Anonymous Meeting in Networks (Q5741761) (← links)
- (Q5743418) (← links)
- (Q5750863) (← links)
- Tree Exploration with an Oracle (Q5756703) (← links)
- Want to Gather? No Need to Chatter! (Q5855243) (← links)
- Deterministic Rendezvous with Detection Using Beeps (Q5890529) (← links)
- Broadcasting in undirected ad hoc radio networks (Q5892136) (← links)
- Algorithms - ESA 2003 (Q5897245) (← links)
