| Publication | Date of Publication | Type |
|---|
Self-masking for hardening inversions
Theoretical Computer Science | 2025-02-26 | Paper |
Diagonalization Games
American Mathematical Monthly | 2024-12-12 | Paper |
| A lower bound for linear interval routing | 2024-07-11 | Paper |
| On the robustness of h^r_m (preliminary version) | 2024-07-11 | Paper |
| Diagonalization Games | 2023-01-05 | Paper |
Elementary derivations of the Euclidean Hurwitz algebras: adapted from Gadi Moran's last paper
The American Mathematical Monthly | 2021-09-27 | Paper |
MinMax algorithms for stabilizing consensus
Distributed Computing | 2021-09-06 | Paper |
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing | 2020-11-30 | Paper |
| The firing squad problem revisited | 2020-08-05 | Paper |
The firing squad problem revisited
Theoretical Computer Science | 2019-10-07 | Paper |
Towards optimal distance functions for stochastic substitution models
Journal of Theoretical Biology | 2018-11-26 | Paper |
Comparing evolutionary distances via adaptive distance functions
Journal of Theoretical Biology | 2018-07-05 | Paper |
A lower bound on wait-free counting
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Concurrent counting (extended abstract)
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Simple and optimal randomized fault-tolerant rumor spreading
Distributed Computing | 2016-05-23 | Paper |
Resource bounds for self stabilizing message driven protocols
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Partial convex recolorings of trees and galled networks
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
Random Structures & Algorithms | 2012-05-14 | Paper |
| scientific article; zbMATH DE number 5764888 (Why is no real title available?) | 2010-08-06 | Paper |
Optimal implementations of UPGMA and other common clustering algorithms
Information Processing Letters | 2010-03-24 | Paper |
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM | 2008-12-21 | Paper |
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Journal of Computer and System Sciences | 2008-06-26 | Paper |
On the hardness of inferring phylogenies from triplet-dissimilarities
Theoretical Computer Science | 2008-01-07 | Paper |
Efficient approximation of convex recolorings
Journal of Computer and System Sciences | 2007-08-27 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Competitive caching of query results in search engines
Theoretical Computer Science | 2004-11-23 | Paper |
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms | 2004-08-06 | Paper |
Public data structures: counters as a special case.
Theoretical Computer Science | 2003-01-21 | Paper |
The complexity of the characterization of networks supporting shortest-path interval routing.
Theoretical Computer Science | 2003-01-21 | Paper |
Computing in totally anonymous asynchronous shared memory systems
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1696669 (Why is no real title available?) | 2002-01-28 | Paper |
Minimum propositional proof length is NP-hard to linearly approximate
The Journal of Symbolic Logic | 2002-01-21 | Paper |
On the total\(_k\)-diameter of connection networks
Theoretical Computer Science | 2000-10-26 | Paper |
Simple and efficient network decomposition and synchronization
Theoretical Computer Science | 2000-08-21 | Paper |
Impossibility results in the presence of multiple faulty processes
Information and Computation | 2000-08-02 | Paper |
| scientific article; zbMATH DE number 1418469 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1340883 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1222561 (Why is no real title available?) | 1999-03-02 | Paper |
A Lower Bound on Wait-Free Counting
Journal of Algorithms | 1998-05-25 | Paper |
Resource Bounds for Self-Stabilizing Message-Driven Protocols
SIAM Journal on Computing | 1997-08-03 | Paper |
Average and Randomized Complexity of Distributed Problems
SIAM Journal on Computing | 1997-06-09 | Paper |
The Wakeup Problem
SIAM Journal on Computing | 1997-06-09 | Paper |
Concurrent counting
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Tight bounds on the round complexity of distributed 1-solvable tasks
Theoretical Computer Science | 1997-02-28 | Paper |
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing | 1995-11-22 | Paper |
Possibility and impossibility results in a shared memory environment
Acta Informatica | 1995-11-19 | Paper |
A lower bound on the period length of a distributed scheduler
Algorithmica | 1994-05-15 | Paper |
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Information and Computation | 1994-02-22 | Paper |
Two-page book embedding of trees under vertex-neighborhood constraints
Discrete Applied Mathematics | 1993-08-10 | Paper |
Gap Theorems for Distributed Computation
SIAM Journal on Computing | 1993-05-17 | Paper |
Rotating-table games and derivatives of words
Theoretical Computer Science | 1993-05-16 | Paper |
Space-efficient asynchronous consensus without shared memory initialization
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 139792 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140463 (Why is no real title available?) | 1993-03-28 | Paper |
Optimal covering of cacti by vertex-disjoint paths
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17531 (Why is no real title available?) | 1992-06-26 | Paper |
One-Page Book Embedding under Vertex-Neighborhood Constraints
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
Networks | 1990-01-01 | Paper |
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms | 1990-01-01 | Paper |
Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science | 1989-01-01 | Paper |
Proving properties of interactive proofs by a generalized counting technique
Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4205964 (Why is no real title available?) | 1989-01-01 | Paper |
Message complexity versus space complexity in fault tolerant broadcast protocols
Networks | 1989-01-01 | Paper |
Initial failures in distributed computations
International Journal of Parallel Programming | 1989-01-01 | Paper |
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
Mathematical Systems Theory | 1988-01-01 | Paper |
Geometric applications of a matrix-searching algorithm
Algorithmica | 1987-01-01 | Paper |
Generalized lower bounds derived from Hastad's main lemma
Information Processing Letters | 1987-01-01 | Paper |
Extremal problems on permutations under cyclic equivalence
Discrete Mathematics | 1987-01-01 | Paper |
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
SIAM Journal on Computing | 1987-01-01 | Paper |
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
SIAM Journal on Computing | 1985-01-01 | Paper |
Some independence results in complexity theory<sup>†</sup>
International Journal of Computer Mathematics | 1985-01-01 | Paper |
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM | 1985-01-01 | Paper |
On approximation problems related to the independent set and vertex cover problems
Discrete Applied Mathematics | 1984-01-01 | Paper |
On the length of optimal TSP circuits in sets of bounded diameter
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
On the control power of integer division
Theoretical Computer Science | 1983-01-01 | Paper |
On the complexity of designing optimal partial-match retrieval systems
ACM Transactions on Database Systems | 1983-01-01 | Paper |
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp>
SIAM Journal on Computing | 1983-01-01 | Paper |
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM | 1983-01-01 | Paper |
On some decision problems for RAM programs
Journal of Computer and System Sciences | 1982-01-01 | Paper |
On the complexity of simple arithmetic expressions
Theoretical Computer Science | 1982-01-01 | Paper |
Fair derivations in context-free grammars
Information and Control | 1982-01-01 | Paper |
On the Accepting Density Hierarchy in NP
SIAM Journal on Computing | 1982-01-01 | Paper |
A generalization of the fast LUP matrix decomposition algorithm and applications
Journal of Algorithms | 1982-01-01 | Paper |
Probabilistic algorithms and straight-line programs for some rank decision problems
Information Processing Letters | 1981-01-01 | Paper |
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
Information Processing Letters | 1981-01-01 | Paper |
A note on 'Is shortest path problem not harder than matrix multiplication?'
Information Processing Letters | 1981-01-01 | Paper |
General approximation algorithms for some arithmetical combinatorial problems
Theoretical Computer Science | 1981-01-01 | Paper |
Some results on relativized deterministic and nondeterministic time hierarchies
Journal of Computer and System Sciences | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3723859 (Why is no real title available?) | 1981-01-01 | Paper |
The complexity of identifying redundant and essential elements
Journal of Algorithms | 1981-01-01 | Paper |
