| Publication | Date of Publication | Type |
|---|
| Mixed Nash equilibria in discrete Tullock contests | 2026-02-27 | Paper |
Temporal graph realization from fastest paths
Theoretical Computer Science | 2025-11-10 | Paper |
The contest game for crowdsourcing reviews
Theoretical Computer Science | 2025-11-01 | Paper |
Collision-free robot scheduling
Information and Computation | 2025-05-19 | Paper |
| Sliding into the future: investigating sliding windows in temporal graphs (invited talk) | 2024-12-03 | Paper |
| Random input helps searching predecessors | 2024-10-31 | Paper |
The complexity of growing a graph
Journal of Computer and System Sciences | 2024-10-29 | Paper |
The complexity of computing optimum labelings for temporal connectivity
Journal of Computer and System Sciences | 2024-10-08 | Paper |
| New clocks, optimal line formation and self-replication population protocols | 2024-10-08 | Paper |
Approximate and randomized algorithms for computing a second Hamiltonian cycle
Algorithmica | 2024-10-07 | Paper |
| The complexity of computing optimum labelings for temporal connectivity | 2024-08-06 | Paper |
Which is the worst-case Nash equilibrium?
SIAM Journal on Discrete Mathematics | 2024-06-08 | Paper |
| The contest game for crowdsourcing reviews | 2024-05-29 | Paper |
| Fault tolerant network constructors | 2024-04-19 | Paper |
| scientific article; zbMATH DE number 7788601 (Why is no real title available?) | 2024-01-15 | Paper |
Near-optimal dominating sets in dense random graphs in polynomial expected time
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Efficient parallel algorithms for some tree layout problems
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Distributed protocols against mobile eavesdroppers
Distributed Algorithms | 2023-12-01 | Paper |
Selected combinatorial problems through the prism of random intersection graphs models
Lecture Notes in Computer Science | 2023-10-04 | Paper |
MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
Algorithmica | 2023-09-27 | Paper |
A spectral algorithm for finding maximum cliques in dense random intersection graphs
Lecture Notes in Computer Science | 2023-08-14 | Paper |
The Complexity of Transitively Orienting Temporal Graphs
(available as arXiv preprint) | 2023-08-08 | Paper |
The complexity of growing a graph
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Simple and fast approximate counting and leader election in populations
Lecture Notes in Computer Science | 2023-08-02 | Paper |
| On the structural and combinatorial properties in 2-swap word permutation graphs | 2023-07-04 | Paper |
Fault tolerant network constructors
Information and Computation | 2023-05-19 | Paper |
| Crystal structure prediction via oblivious local search | 2023-02-07 | Paper |
Threshold-based network structural dynamics
Theoretical Computer Science | 2023-01-30 | Paper |
| Scheduling algorithms for strict multithreaded computations | 2023-01-25 | Paper |
Efficient parallel algorithms for shortest paths in planar graphs
SWAT 90 | 2022-12-09 | Paper |
Cover time in edge-uniform stochastically-evolving graphs
Lecture Notes in Computer Science | 2022-11-04 | Paper |
The dynamics and stability of probabilistic population processes
Lecture Notes in Computer Science | 2022-11-04 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2022-07-21 | Paper |
| Computing exact solutions of consensus halving and the Borsuk-Ulam theorem | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559398 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Beyond rings: gathering in 1-interval connected graphs
Parallel Processing Letters | 2022-07-08 | Paper |
On verifying and maintaining connectivity of interval temporal networks
Parallel Processing Letters | 2022-07-04 | Paper |
Simple and fast approximate counting and leader election in populations
Information and Computation | 2022-05-17 | Paper |
Distributed computation and reconfiguration in actively dynamic networks
Distributed Computing | 2022-04-01 | Paper |
Threshold-based network structural dynamics
Structural Information and Communication Complexity | 2022-03-22 | Paper |
How many cooks spoil the soup?
Distributed Computing | 2022-02-15 | Paper |
Approximating the existential theory of the reals
Journal of Computer and System Sciences | 2022-01-31 | Paper |
Maximum cliques in graphs with small intersection number and random intersection graphs
Computer Science Review | 2021-12-20 | Paper |
Maria Serna and her years in Patras
Computer Science Review | 2021-12-20 | Paper |
An extension of the Moran process using type-specific connection graphs
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Connected subgraph defense games
Algorithmica | 2021-11-19 | Paper |
| The price of stability of weighted congestion games | 2021-07-28 | Paper |
| Temporal vertex cover with a sliding time window | 2021-07-28 | Paper |
The temporal explorer who returns to the base
Journal of Computer and System Sciences | 2021-06-30 | Paper |
The temporal explorer who returns to the base
Journal of Computer and System Sciences | 2021-06-30 | Paper |
The price of defense
Algorithmica | 2021-04-19 | Paper |
Distributed Computation and Reconfiguration in Actively Dynamic Networks
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Lipschitz continuity and approximate equilibria
Algorithmica | 2020-10-12 | Paper |
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences | 2020-09-07 | Paper |
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences | 2020-09-07 | Paper |
Approximating the existential theory of the reals
Web and Internet Economics | 2020-06-18 | Paper |
| On the transformation capability of feasible mechanisms for programmable matter | 2020-05-27 | Paper |
Binary search in graphs revisited
(available as arXiv preprint) | 2020-05-26 | Paper |
Mutants and residents with different connection graphs in the Moran process
Lecture Notes in Computer Science | 2020-02-12 | Paper |
The temporal explorer who returns to the base
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Connected subgraph defense games
Algorithmic Game Theory | 2020-02-04 | Paper |
Connected subgraph defense games
Algorithmic Game Theory | 2020-02-04 | Paper |
The Match-Maker: Constant-Space Distributed Majority via Random Walks
Lecture Notes in Computer Science | 2020-01-14 | Paper |
Cover time in edge-uniform stochastically-evolving graphs
Algorithms | 2020-01-13 | Paper |
Temporal vertex cover with a sliding time window
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Temporal vertex cover with a sliding time window
Journal of Computer and System Sciences | 2019-11-29 | Paper |
The price of stability of weighted congestion games
SIAM Journal on Computing | 2019-11-08 | Paper |
The price of stability of weighted congestion games
SIAM Journal on Computing | 2019-11-08 | Paper |
Temporal flows in temporal networks
Journal of Computer and System Sciences | 2019-06-25 | Paper |
| Approximating fixation probabilities in the generalized Moran process | 2019-05-10 | Paper |
Binary search in graphs revisited
Algorithmica | 2019-05-07 | Paper |
On the transformation capability of feasible mechanisms for programmable matter
Journal of Computer and System Sciences | 2019-05-03 | Paper |
On the transformation capability of feasible mechanisms for programmable matter
Journal of Computer and System Sciences | 2019-05-03 | Paper |
Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
Automata, Languages and Programming | 2019-04-29 | Paper |
Temporal network optimization subject to connectivity constraints
Algorithmica | 2019-04-25 | Paper |
| Brief announcement: Fast approximate counting and leader election in populations | 2019-01-30 | Paper |
Strategic contention resolution in multiple channels
(available as arXiv preprint) | 2019-01-15 | Paper |
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
Automata, Languages and Programming | 2019-01-10 | Paper |
| Short paper: Strategic contention resolution in multiple channels with limited feedback | 2018-11-08 | Paper |
Atomic congestion games among coalitions
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Strategic Contention Resolution in Multiple Channels
(available as arXiv preprint) | 2018-10-10 | Paper |
Connectivity preserving network transformers
Emergent Computation | 2018-10-04 | Paper |
Strong bounds for evolution in networks
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Strong bounds for evolution in networks
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
Algorithms | 2018-08-20 | Paper |
| Deterministic population protocols for exact majority and plurality | 2018-07-18 | Paper |
| Stably Computing Order Statistics with Arithmetic Population Protocols | 2018-03-21 | Paper |
Strategic contention resolution with limited feedback
(available as arXiv preprint) | 2018-03-02 | Paper |
A 3-player protocol preventing persistence in strategic contention with limited feedback
(available as arXiv preprint) | 2018-02-13 | Paper |
Expander properties in random regular graphs with edge faults
STACS 95 | 2017-12-04 | Paper |
Random bimatrix games are asymptotically easy to solve (a simple proof)
Theory of Computing Systems | 2017-11-07 | Paper |
The complexity of optimal design of temporally connected graphs
Theory of Computing Systems | 2017-10-12 | Paper |
The complexity of optimal design of temporally connected graphs
Theory of Computing Systems | 2017-10-12 | Paper |
Resolving Braess's paradox in random networks
Algorithmica | 2017-10-09 | Paper |
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
On the fixation probability of superstars
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
Temporal flows in temporal networks
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Existence of evolutionarily stable strategies remains hard to decide for a wide range of payoff values
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Connectivity preserving network transformers
Theoretical Computer Science | 2017-05-18 | Paper |
Network Constructors: A Model for Programmable Matter
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
On the chromatic number of non-sparse random intersection graphs
Theory of Computing Systems | 2017-03-31 | Paper |
Determining majority in networks with local interactions and very small local memory
Distributed Computing | 2017-03-29 | Paper |
Computing approximate Nash equilibria in polymatrix games
Algorithmica | 2017-03-03 | Paper |
How Many Cooks Spoil the Soup?
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Lipschitz continuity and approximate equilibria
Algorithmic Game Theory | 2016-09-29 | Paper |
| Computing in dynamic networks | 2016-07-29 | Paper |
Simple and efficient local codes for distributed stable network construction
Distributed Computing | 2016-07-05 | Paper |
Traveling salesman problems in temporal graphs
Theoretical Computer Science | 2016-05-18 | Paper |
Algorithms and almost tight results for 3-colorability of small diameter graphs
Algorithmica | 2016-03-23 | Paper |
On Temporally Connected Graphs of Small Cost
Approximation and Online Algorithms | 2016-02-26 | Paper |
On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Rationality authority for provable rational behavior
Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing | 2015-12-18 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Automata, Languages, and Programming | 2015-10-27 | Paper |
Simple and efficient local codes for distributed stable network construction
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
On the structure of equilibria in basic network formation
Theoretical Computer Science | 2015-06-10 | Paper |
Connectivity properties in random regular graphs with edge faults
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
The price of selfish routing
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Resolving Braess's paradox in random networks
Web and Internet Economics | 2015-01-12 | Paper |
Computing approximate Nash equilibria in polymatrix games
Web and Internet Economics | 2015-01-07 | Paper |
Approximating fixation probabilities in the generalized Moran process
Algorithmica | 2014-11-19 | Paper |
Approximating fixation probabilities in the generalized Moran process
Algorithmica | 2014-11-19 | Paper |
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Computational models for networks of tiny artifacts: a survey
Computer Science Review | 2014-10-24 | Paper |
Selfish splittable flows and NP-completeness
Computer Science Review | 2014-10-24 | Paper |
Innovative approaches for security of small artefacts
Computer Science Review | 2014-10-24 | Paper |
Robust and scalable middleware for selfish-computer systems
Computer Science Review | 2014-10-24 | Paper |
Traveling salesman problems in temporal graphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
A note on proofs of existence of Nash equilibria in finite strategic games, of two players
Computer Science Review | 2014-10-07 | Paper |
Book review of: N. Nisan (ed.), T. Roughgarden (ed.), É. Tardos (ed.), V. Vazirani (ed.), Algorithmic game theory. Foreword by C. H. Papadimitriou
Computer Science Review | 2014-10-07 | Paper |
Naming and counting in anonymous unknown dynamic networks
Lecture Notes in Computer Science | 2014-09-30 | Paper |
Determining majority in networks with local interactions and very small local memory
Automata, Languages, and Programming | 2014-07-01 | Paper |
Determining majority in networks with local interactions and very small local memory
Automata, Languages, and Programming | 2014-07-01 | Paper |
On the derivation of a closed-form expression for the solutions of a subclass of generalized Abel differential equations
International Journal of Differential Equations | 2014-06-30 | Paper |
Game authority for robust andscalable distributed selfish-computer systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
On the hardness of network design for bottleneck routing games
Theoretical Computer Science | 2014-01-22 | Paper |
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science | 2014-01-13 | Paper |
Design, analysis and performance evaluation of group key establishment in wireless sensor networks
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
On the Structure of Equilibria in Basic Network Formation
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Temporal network optimization subject to connectivity constraints
Automata, Languages, and Programming | 2013-08-07 | Paper |
Temporal network optimization subject to connectivity constraints
Automata, Languages, and Programming | 2013-08-07 | Paper |
A guided tour in random intersection graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Strong bounds for evolution in networks
Automata, Languages, and Programming | 2013-08-07 | Paper |
Potential Functions in Strategic Games
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Playing a game to bound the chromatic number
The American Mathematical Monthly | 2013-05-28 | Paper |
Natural models for evolution on networks
Theoretical Computer Science | 2013-04-17 | Paper |
On the hardness of network design for bottleneck routing games
Algorithmic Game Theory | 2013-03-13 | Paper |
The impact of social ignorance on weighted congestion games
Theory of Computing Systems | 2012-12-06 | Paper |
Maximum cliques in graphs with small intersection number and random intersection graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Efficient methods for selfish network design
Theoretical Computer Science | 2012-08-09 | Paper |
On mutual concavity and strategically-zero-sum bimatrix games
Theoretical Computer Science | 2012-06-25 | Paper |
Passively mobile communicating machines that use restricted space
Theoretical Computer Science | 2011-12-07 | Paper |
On the independence number and Hamiltonicity of uniform random intersection graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Selected Combinatorial Properties of Random Intersection Graphs
Algebraic Foundations in Computer Science | 2011-11-11 | Paper |
Random bimatrix games are asymptotically easy to solve (a simple proof)
Algorithmic Game Theory | 2011-10-28 | Paper |
On the performance of approximate equilibria in congestion games
Algorithmica | 2011-08-16 | Paper |
Mediated population protocols
Theoretical Computer Science | 2011-05-10 | Paper |
Probabilistic data propagation in wireless sensor networks
Monographs in Theoretical Computer Science | 2011-04-05 | Paper |
Population protocols and related models
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Sharp thresholds for Hamiltonicity in random intersection graphs
Theoretical Computer Science | 2010-10-11 | Paper |
Exploiting concavity in bimatrix games: new polynomially tractable subclasses
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Atomic congestion games: fast, myopic and concurrent
Theory of Computing Systems | 2010-08-13 | Paper |
An optimization approach for approximate Nash equilibria
Internet Mathematics | 2010-07-09 | Paper |
Cost-balancing tolls for atomic network congestion games
Internet Mathematics | 2010-07-09 | Paper |
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science | 2010-06-07 | Paper |
Well supported approximate equilibria in bimatrix games
Algorithmica | 2010-05-28 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Weighted random sampling with a reservoir
Information Processing Letters | 2009-12-18 | Paper |
Expander properties and the cover time of random intersection graphs
Theoretical Computer Science | 2009-11-06 | Paper |
On the Performance of Approximate Equilibria in Congestion Games
Lecture Notes in Computer Science | 2009-10-29 | Paper |
| Paradigms for Fast Parallel Approximability | 2009-10-21 | Paper |
Colouring Non-sparse Random Intersection Graphs
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Recent Advances in Population Protocols
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| scientific article; zbMATH DE number 5606343 (Why is no real title available?) | 2009-09-22 | Paper |
| scientific article; zbMATH DE number 5605099 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5605056 (Why is no real title available?) | 2009-09-19 | Paper |
| scientific article; zbMATH DE number 5604064 (Why is no real title available?) | 2009-09-15 | Paper |
| scientific article; zbMATH DE number 5604106 (Why is no real title available?) | 2009-09-15 | Paper |
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science | 2009-08-21 | Paper |
The survival of the weakest in networks
Computational & Mathematical Organization Theory | 2009-08-06 | Paper |
Efficient Methods for Selfish Network Design
Automata, Languages and Programming | 2009-07-14 | Paper |
Mediated Population Protocols
Automata, Languages and Programming | 2009-07-14 | Paper |
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Theoretical Computer Science | 2009-04-29 | Paper |
On the support size of stable strategies in random games
Theoretical Computer Science | 2009-03-17 | Paper |
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
Theoretical Computer Science | 2009-03-17 | Paper |
Atomic Congestion Games Among Coalitions
Automata, Languages and Programming | 2009-03-12 | Paper |
Probabilistic Techniques in Algorithmic Game Theory
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
On the Support Size of Stable Strategies in Random Games
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
Computing on a partially eponymous ring
Theoretical Computer Science | 2009-03-02 | Paper |
A Game Theoretic Approach for Efficient Graph Coloring
Algorithms and Computation | 2009-01-29 | Paper |
The Dynamics of Probabilistic Population Protocols
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Random sampling of colourings of sparse random graphs with a constant number of colours
Theoretical Computer Science | 2008-11-18 | Paper |
Large independent sets in general random intersection graphs
Theoretical Computer Science | 2008-11-12 | Paper |
Selfish Load Balancing Under Partial Knowledge
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Expander Properties and the Cover Time of Random Intersection Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Cost sharing mechanisms for fair pricing of resource usage
Algorithmica | 2008-09-12 | Paper |
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Algebraic Informatics | 2008-09-04 | Paper |
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science | 2008-08-14 | Paper |
A network game with attackers and a defender
Algorithmica | 2008-07-01 | Paper |
Algorithms for pure Nash equilibria in weighted congestion games
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Approximate Equilibria for Strategic Two Person Games
Algorithmic Game Theory | 2008-05-02 | Paper |
Atomic Congestion Games: Fast, Myopic and Concurrent
Algorithmic Game Theory | 2008-05-02 | Paper |
Optimal Algorithms for Detecting Network Stability
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
The Survival of the Weakest in Networks
Approximation and Online Algorithms | 2008-02-21 | Paper |
Full and Local Information in Distributed Decision Making
Approximation and Online Algorithms | 2008-02-20 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Automata, Languages and Programming | 2007-11-28 | Paper |
The Price of Defense
Lecture Notes in Computer Science | 2007-09-05 | Paper |
The increase of the instability of networks due to quasi-static link capacities
Theoretical Computer Science | 2007-09-03 | Paper |
The price of selfish routing
Algorithmica | 2007-07-19 | Paper |
Direct routing: Algorithms and complexity
Algorithmica | 2007-06-21 | Paper |
Performance and stability bounds for dynamic networks
Journal of Parallel and Distributed Computing | 2007-04-26 | Paper |
| scientific article; zbMATH DE number 5145345 (Why is no real title available?) | 2007-04-23 | Paper |
| scientific article; zbMATH DE number 5145382 (Why is no real title available?) | 2007-04-23 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
The infection time of graphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Information Security
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science | 2006-09-14 | Paper |
The chromatic and clique numbers of random scaled sector graphs
Theoretical Computer Science | 2006-03-20 | Paper |
The impact of network structure on the stability of greedy protocols
Theory of Computing Systems | 2006-02-08 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Selfish unsplittable flows
Theoretical Computer Science | 2006-01-09 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science | 2005-10-26 | Paper |
Radiocoloring in planar graphs: Complexity and approximations
Theoretical Computer Science | 2005-09-22 | Paper |
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
SIAM Journal on Computing | 2005-09-16 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Space efficient hash tables with worst case constant access time
Theory of Computing Systems | 2005-04-19 | Paper |
| scientific article; zbMATH DE number 2156278 (Why is no real title available?) | 2005-04-15 | Paper |
The cost of concurrent, low-contention Read \& Modify \& Write
Theoretical Computer Science | 2005-04-06 | Paper |
Approximate equilibria and ball fusion
Theory of Computing Systems | 2005-02-11 | Paper |
Attack propagation in networks
Theory of Computing Systems | 2004-09-22 | Paper |
A hierarchical adaptive distributed algorithm for load balancing
Journal of Parallel and Distributed Computing | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2090691 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086616 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080866 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2013824 (Why is no real title available?) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 2011861 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 2006659 (Why is no real title available?) | 2003-11-23 | Paper |
| scientific article; zbMATH DE number 1982173 (Why is no real title available?) | 2003-09-16 | Paper |
| scientific article; zbMATH DE number 1962820 (Why is no real title available?) | 2003-08-11 | Paper |
Distributed communication algorithms for ad hoc mobile networks.
Journal of Parallel and Distributed Computing | 2003-08-07 | Paper |
Competitive video on demand schedulers for popular movies
Discrete Applied Mathematics | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1956217 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1953881 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1953096 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1929928 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1857646 (Why is no real title available?) | 2003-06-02 | Paper |
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Theoretical Computer Science | 2003-05-14 | Paper |
Competitive call control in mobile networks
Theory of Computing Systems | 2003-05-04 | Paper |
| scientific article; zbMATH DE number 1862255 (Why is no real title available?) | 2003-01-30 | Paper |
On the robustness of interconnections in random graphs: a symbolic approach.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1848400 (Why is no real title available?) | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1819633 (Why is no real title available?) | 2002-12-10 | Paper |
| scientific article; zbMATH DE number 1759469 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1795717 (Why is no real title available?) | 2002-11-11 | Paper |
| scientific article; zbMATH DE number 1760109 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1760005 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1759423 (Why is no real title available?) | 2002-11-04 | Paper |
| The Lagrangian search method | 2002-10-10 | Paper |
Minimum congestion redundant assignments to tolerate random faults
Algorithmica | 2002-05-21 | Paper |
| Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments | 2002-05-12 | Paper |
STEPS: Supporting traditional education procedures --- A TCP/IP multimedia networks-based model
Multimedia Tools and Applications | 2002-04-11 | Paper |
| scientific article; zbMATH DE number 1560339 (Why is no real title available?) | 2001-04-26 | Paper |
Robust parallel computations through randomization
Theory of Computing Systems | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1555943 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1304095 (Why is no real title available?) | 2000-11-22 | Paper |
BSP versus LogP
Algorithmica | 2000-09-05 | Paper |
Efficient scheduling of strict multithreaded computations
Theory of Computing Systems | 2000-09-04 | Paper |
Tentative and definite distributed computations: An optimistic approach to network synchronization
Theoretical Computer Science | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1390072 (Why is no real title available?) | 2000-04-26 | Paper |
Optimal high-performance parallel text retrieval via fat-trees
Theory of Computing Systems | 2000-01-03 | Paper |
| scientific article; zbMATH DE number 1341904 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1302022 (Why is no real title available?) | 1999-06-16 | Paper |
| scientific article; zbMATH DE number 1263991 (Why is no real title available?) | 1999-03-16 | Paper |
| Paradigms for Fast Parallel Approximability | 1999-02-28 | Paper |
On the random generation and counting of matchings in dense graphs
Theoretical Computer Science | 1998-08-13 | Paper |
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1114044 (Why is no real title available?) | 1998-06-11 | Paper |
The fourth moment in Luby's distribution
Theoretical Computer Science | 1997-02-28 | Paper |
Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
Information Processing Letters | 1997-02-27 | Paper |
Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
Theoretical Computer Science | 1997-02-27 | Paper |
Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks
Performance Evaluation | 1997-02-27 | Paper |
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms | 1996-03-18 | Paper |
Parallel Complexity of the Connected Subgraph Problem
SIAM Journal on Computing | 1993-09-01 | Paper |
Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
Information and Computation | 1993-08-30 | Paper |
| scientific article; zbMATH DE number 219240 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176752 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176498 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176146 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 139775 (Why is no real title available?) | 1993-03-28 | Paper |
Efficient parallel algorithms for shortest paths in planar digraphs
BIT | 1992-12-14 | Paper |
Expected parallel time and sequential space complexity of graph and digraph problems
Algorithmica | 1992-06-28 | Paper |
The complexity of the reliable connectivity problem
Information Processing Letters | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 18532 (Why is no real title available?) | 1992-06-26 | Paper |
Efficient distributed algorithms by using the archimedean time assumption
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4155879 (Why is no real title available?) | 1989-01-01 | Paper |
Optimal parallel randomized algorithms for sparse addition and identification
Information and Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062587 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4050992 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092771 (Why is no real title available?) | 1988-01-01 | Paper |
The parallel complexity of deadlock detection
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4055665 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3958733 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3978375 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001481 (Why is no real title available?) | 1986-01-01 | Paper |
Unbounded Speed Variability in Distributed Communications Systems
SIAM Journal on Computing | 1985-01-01 | Paper |
k-connectivity in random undirected graphs
Discrete Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3967917 (Why is no real title available?) | 1985-01-01 | Paper |
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems | 1984-01-01 | Paper |
Strong NP-hardness of moving many discs
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3928336 (Why is no real title available?) | 1984-01-01 | Paper |
On the existence of $\delta$-temporal cliques in random simple temporal graphs
(available as arXiv preprint) | N/A | Paper |
