| Publication | Date of Publication | Type |
|---|
New bounds for single-machine time-dependent scheduling with uniform deterioration
Theoretical Computer Science | 2024-06-26 | Paper |
Distributed Averaging in Opinion Dynamics
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Brief Announcement: Discrete Incremental Voting
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Perpetual maintenance of machines with different urgency requirements
Journal of Computer and System Sciences | 2023-10-24 | Paper |
A simple model of influence
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Fast plurality consensus in regular expanders
| 2023-02-03 | Paper |
Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020
Algorithmica | 2022-10-06 | Paper |
A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7378397 (Why is no real title available?)
| 2021-08-04 | Paper |
Time-space trade-offs in population protocols for the majority problem
Distributed Computing | 2021-05-17 | Paper |
A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
Internet Mathematics | 2021-04-23 | Paper |
Fast Low-Cost Estimation of Network Properties Using Random Walks
Internet Mathematics | 2021-03-26 | Paper |
On Counting the Population Size
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
| 2020-02-06 | Paper |
Recent results in population protocols for exact majority and leader election
| 2020-01-13 | Paper |
Dispersion processes
Random Structures & Algorithms | 2019-02-20 | Paper |
Fast consensus for voting on general expander graphs
| 2018-08-24 | Paper |
Brief announcement: Population protocols for leader election and exact majority with \(O(\log^{2} n)\) states and \(O(\log^{2}n)\) convergence time
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Robustness of the rotor-router mechanism
Algorithmica | 2017-10-09 | Paper |
The coalescing-branching random walk on expanders and the dual epidemic process
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Coalescing walks on rotor-router systems
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Fast low-cost estimation of network properties using random walks
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Tree exploration with logarithmic memory
| 2014-12-18 | Paper |
Coalescing random walks and voting on graphs
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Tree exploration with logarithmic memory
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The Power of Two Choices in Distributed Voting
Automata, Languages, and Programming | 2014-07-01 | Paper |
Speeding up random walks with neighborhood exploration
| 2014-05-22 | Paper |
Coalescing random walks and voting on connected graphs
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Approximation bounds on the number of mixedcast rounds in wireless ad-hoc networks
Lecture Notes in Computer Science | 2014-01-17 | Paper |
The cover times of random walks on random uniform hypergraphs
Theoretical Computer Science | 2014-01-13 | Paper |
Testing connectivity of faulty networks in sublinear time
Journal of Discrete Algorithms | 2012-09-13 | Paper |
A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
Lecture Notes in Computer Science | 2012-07-23 | Paper |
Efficient connectivity testing of hypercubic networks with faults
Lecture Notes in Computer Science | 2011-05-19 | Paper |
The Cover Time of Cartesian Product Graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Multiple random walks in random regular graphs
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science | 2010-04-06 | Paper |
Time-efficient broadcast in radio networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Multiple Random Walks and Interacting Particle Systems
Automata, Languages and Programming | 2009-07-14 | Paper |
Many-to-many communication in radio networks
Algorithmica | 2009-06-16 | Paper |
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Approximation bounds for Black Hole Search problems
Networks | 2008-12-17 | Paper |
A randomized algorithm for the joining protocol in dynamic distributed networks
Theoretical Computer Science | 2008-11-12 | Paper |
Locating and Repairing Faults in a Network with Mobile Agents
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers & Operations Research | 2007-10-10 | Paper |
Hardness and approximation results for black hole search in arbitrary networks
Theoretical Computer Science | 2007-10-02 | Paper |
Deterministic communication in radio networks with large labels
Algorithmica | 2007-03-05 | Paper |
scientific article; zbMATH DE number 5117500 (Why is no real title available?)
| 2007-01-22 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Power balance and apportionment algorithms for the United States Congress
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Improving time bounds on maximum generalised flow computations by contracting the network
Theoretical Computer Science | 2004-10-27 | Paper |
scientific article; zbMATH DE number 2086656 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1256704 (Why is no real title available?)
| 2002-01-17 | Paper |
Faster algorithms for the generalized network flow problem
Mathematics of Operations Research | 2001-11-26 | Paper |
Parametric flows, weighted means of cuts, and fractional combinatorial optimization
| 2001-09-18 | Paper |
scientific article; zbMATH DE number 1302174 (Why is no real title available?)
| 1999-06-16 | Paper |
Fast deterministic approximation for the multicommodity flow problem
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
scientific article; zbMATH DE number 1003284 (Why is no real title available?)
| 1997-04-23 | Paper |
Shortest paths algorithms: Theory and experimental evaluation
Mathematical Programming. Series A. Series B | 1996-10-20 | Paper |
scientific article; zbMATH DE number 910906 (Why is no real title available?)
| 1996-07-28 | Paper |
scientific article; zbMATH DE number 742963 (Why is no real title available?)
| 1995-04-11 | Paper |
Tight bounds on the number of minimum-mean cycle cancellations and related results
Algorithmica | 1994-09-11 | Paper |
scientific article; zbMATH DE number 432811 (Why is no real title available?)
| 1993-10-20 | Paper |
A heuristic improvement of the Bellman-Ford algorithm
Applied Mathematics Letters | 1993-08-19 | Paper |
scientific article; zbMATH DE number 17533 (Why is no real title available?)
| 1992-06-26 | Paper |
Improved deterministic parallel integer sorting
Information and Computation | 1992-06-25 | Paper |
Connectivity vs. reachability
Information and Computation | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4060741 (Why is no real title available?)
| 1988-01-01 | Paper |
