Paul G. Spirakis

According to our database1, Paul G. Spirakis authored at least 511 papers between 1980 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On the transformation capability of feasible mechanisms for programmable matter.
J. Comput. Syst. Sci., 2019

Temporal flows in temporal networks.
J. Comput. Syst. Sci., 2019

Fault Tolerant Network Constructors.
CoRR, 2019

How fast can we reach a target vertex in stochastic temporal graphs?
CoRR, 2019

Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem.
CoRR, 2019

Temporal Network Optimization Subject to Connectivity Constraints.
Algorithmica, 2019

Binary Search in Graphs Revisited.
Algorithmica, 2019

The Temporal Explorer Who Returns to the Base.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Strong bounds for evolution in networks.
J. Comput. Syst. Sci., 2018

Letter from the President.
Bulletin of the EATCS, 2018

Letter from the President.
Bulletin of the EATCS, 2018

Letter from the President.
Bulletin of the EATCS, 2018

How many cooks spoil the soup?
Distributed Computing, 2018

Strategic Contention Resolution in Multiple Channels.
CoRR, 2018

Approximating the Existential Theory of the Reals.
CoRR, 2018

Fast Approximate Counting and Leader Election in Populations.
CoRR, 2018

Exact size counting in uniform population protocols in nearly logarithmic time.
CoRR, 2018

The temporal explorer who returns to the base.
CoRR, 2018

The Price of Stability of Weighted Congestion Games.
CoRR, 2018

Temporal Vertex Cover with a Sliding Time Window.
CoRR, 2018

Elements of the theory of dynamic networks.
Commun. ACM, 2018

Cover Time in Edge-Uniform Stochastically-Evolving Graphs.
Algorithms, 2018

Approximating the Existential Theory of the Reals.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Strategic Contention Resolution in Multiple Channels.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Simple and Fast Approximate Counting and Leader Election in Populations.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Brief Announcement: Fast Approximate Counting and Leader Election in Populations.
Proceedings of the Structural Information and Communication Complexity, 2018

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Mutants and Residents with Different Connection Graphs in the Moran Process.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Temporal Vertex Cover with a Sliding Time Window.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Price of Stability of Weighted Congestion Games.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Random input helps searching predecessors.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

Brief Announcement: Providing End-to-End Secure Communication in Low-Power Wide Area Networks.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2018

2017
Connectivity preserving network transformers.
Theor. Comput. Sci., 2017

On the Chromatic Number of Non-Sparse Random Intersection Graphs.
Theory Comput. Syst., 2017

The Complexity of Optimal Design of Temporally Connected Graphs.
Theory Comput. Syst., 2017

Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners.
Bulletin of the EATCS, 2017

Letter from the President.
Bulletin of the EATCS, 2017

Letter from the President.
Bulletin of the EATCS, 2017

Letter from the President.
Bulletin of the EATCS, 2017

Determining majority in networks with local interactions and very small local memory.
Distributed Computing, 2017

Mutants and Residents with Different Connection Graphs in the Moran Process.
CoRR, 2017

On the Transformation Capability of Feasible Mechanisms for Programmable Matter.
CoRR, 2017

Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values.
CoRR, 2017

Bounding the Cover Time in Edge-Uniform Stochastic Graphs.
CoRR, 2017

Learning Powers of Poisson Binomial Distributions.
CoRR, 2017

Binary Search in Graphs Revisited.
CoRR, 2017

A 3-player protocol preventing persistence in strategic contention with limited feedback.
CoRR, 2017

Resolving Braess's Paradox in Random Networks.
Algorithmica, 2017

Computing Approximate Nash Equilibria in Polymatrix Games.
Algorithmica, 2017

Cover Time in Edge-Uniform Stochastically-Evolving Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

The Dynamics and Stability of Probabilistic Population Processes.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Network Constructors: A Model for Programmable Matter.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Binary Search in Graphs Revisited.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On the Transformation Capability of Feasible Mechanisms for Programmable Matter.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Temporal Flows in Temporal Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

The Computational Complexity of Weighted Greedy Matching.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Tail Bounds for Occupancy Problems.
Encyclopedia of Algorithms, 2016

Selfish Unsplittable Flows: Algorithms for Pure Equilibria.
Encyclopedia of Algorithms, 2016

Best Response Algorithms for Selfish Routing.
Encyclopedia of Algorithms, 2016

Approximations of Bimatrix Nash Equilibria.
Encyclopedia of Algorithms, 2016

Independent Sets in Random Intersection Graphs.
Encyclopedia of Algorithms, 2016

Stackelberg Games: The Price of Optimum.
Encyclopedia of Algorithms, 2016

Minimum Congestion Redundant Assignments.
Encyclopedia of Algorithms, 2016

Hamilton Cycles in Random Intersection Graphs.
Encyclopedia of Algorithms, 2016

Weighted Random Sampling.
Encyclopedia of Algorithms, 2016

Traveling salesman problems in temporal graphs.
Theor. Comput. Sci., 2016

Ephemeral networks with random availability of links: The case of fast networks.
J. Parallel Distrib. Comput., 2016

Letter from the President.
Bulletin of the EATCS, 2016

EATCS Fellows' Advice to the Young Theoretical Computer Scientist.
Bulletin of the EATCS, 2016

Simple and efficient local codes for distributed stable network construction.
Distributed Computing, 2016

How Many Cooks Spoil the Soup?
CoRR, 2016

On the Complexity of Weighted Greedy Matchings.
CoRR, 2016

Flows in Temporal networks.
CoRR, 2016

Strategic Contention Resolution with Limited Feedback.
CoRR, 2016

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs.
Algorithmica, 2016

How Many Cooks Spoil the Soup?
Proceedings of the Structural Information and Communication Complexity, 2016

Lipschitz Continuity and Approximate Equilibria.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Deterministic Population Protocols for Exact Majority and Plurality.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Stably Computing Order Statistics with Arithmetic Population Protocols.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Strategic Contention Resolution with Limited Feedback.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
On the structure of equilibria in basic network formation.
Theor. Comput. Sci., 2015

Terminating population protocols via some minimal global knowledge assumptions.
J. Parallel Distrib. Comput., 2015

Connectivity Preserving Network Transformers.
CoRR, 2015

Temporal Network Optimization Subject to Connectivity Constraints.
CoRR, 2015

On Equilibrium Computation in Biased Games with Quadratic Penalties.
CoRR, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
CoRR, 2015

NETCS: A New Simulator of Population Protocols and Network Constructors.
CoRR, 2015

Designing and Testing Temporally Connected Graphs.
CoRR, 2015

On Temporally Connected Graphs of Small Cost.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

The Match-Maker: Constant-Space Distributed Majority via Random Walks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Rationality Authority for Provable Rational Behavior.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

On Verifying and Maintaining Connectivity of Interval Temporal Networks.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
On the hardness of network design for bottleneck routing games.
Theor. Comput. Sci., 2014

Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof).
Theory Comput. Syst., 2014

Causality, influence, and computation in possibly disconnected synchronous dynamic networks.
J. Parallel Distrib. Comput., 2014

Determining Majority in Networks with Local Interactions and very Small Local Memory.
CoRR, 2014

Computing Approximate Nash Equilibria in Polymatrix Games.
CoRR, 2014

Approximating Fixation Probabilities in the Generalized Moran Process.
Algorithmica, 2014

Information security for sensors by overwhelming random sequences and permutations.
Ad Hoc Networks, 2014

Computing Approximate Nash Equilibria in Polymatrix Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Ephemeral networks with random availability of links: diameter and connectivity.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Simple and efficient local codes for distributed stable network construction.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Traveling Salesman Problems in Temporal Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Determining Majority in Networks with Local Interactions and Very Small Local Memory.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Natural models for evolution on networks.
Theor. Comput. Sci., 2013

The computational power of simple protocols for self-awareness on graphs.
Theor. Comput. Sci., 2013

A Framework for Protecting Voters' Privacy In Electronic Voting Procedures.
J. Cases on Inf. Techn., 2013

Moving in temporal graphs with very sparse random availability of edges.
CoRR, 2013

On the Structure of Equilibria in Basic Network Formation.
CoRR, 2013

Simple and Efficient Local Codes for Distributed Stable Network Construction.
CoRR, 2013

The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs.
CoRR, 2013

Resolving Braess's Paradox in Random Networks.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Naming and Counting in Anonymous Unknown Dynamic Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Agent agreement protocols based on golay error-correcting code.
Proceedings of the 4th International Conference on Information, 2013

A Guided Tour in Random Intersection Graphs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Strong Bounds for Evolution in Networks.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Temporal Network Optimization Subject to Connectivity Constraints.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On the Structure of Equilibria in Basic Network Formation.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Potential Functions in Strategic Games.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
On mutual concavity and strategically-zero-sum bimatrix games.
Theor. Comput. Sci., 2012

Efficient methods for selfish network design.
Theor. Comput. Sci., 2012

Playing a Game to Bound the Chromatic Number.
The American Mathematical Monthly, 2012

The Impact of Social Ignorance on Weighted Congestion Games.
Theory Comput. Syst., 2012

Strong Bounds for Evolution in Undirected Graphs
CoRR, 2012

Naming and Counting in Anonymous Unknown Dynamic Networks
CoRR, 2012

On the Hardness of Network Design for Bottleneck Routing Games
CoRR, 2012

Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks
CoRR, 2012

Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
CoRR, 2012

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
CoRR, 2012

Can Fixation be Guaranteed in the Generalized Moran Process?
CoRR, 2012

Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Terminating Population Protocols via Some Minimal Global Knowledge Assumptions.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Approximating fixation probabilities in the generalized Moran process.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On the Hardness of Network Design for Bottleneck Routing Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Privacy Preserving Course Evaluations in Greek Higher Education Institutes: An e-Participation Case Study with the Empowerment of Attribute Based Credentials.
Proceedings of the Privacy Technologies and Policy - First Annual Privacy Forum, 2012

2011
New Models for Population Protocols
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2011

Population Protocols and Related Models.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Probabilistic Data Propagation in Wireless Sensor Networks.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

On the independence number and Hamiltonicity of uniform random intersection graphs.
Theor. Comput. Sci., 2011

Mediated population protocols.
Theor. Comput. Sci., 2011

Passively mobile communicating machines that use restricted space.
Theor. Comput. Sci., 2011

Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata.
IJAACS, 2011

Selfish splittable flows and NP-completeness.
Computer Science Review, 2011

Robust and scalable middleware for selfish-computer systems.
Computer Science Review, 2011

Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts.
Computer Science Review, 2011

Innovative approaches for security of small artefacts.
Computer Science Review, 2011

Computational models for networks of tiny artifacts: A survey.
Computer Science Review, 2011

Approximating Fixation Probabilities in the Generalized Moran Process
CoRR, 2011

Elliptic Curve Based Zero Knowledge Proofs and Their Applicability on Resource Constrained Devices
CoRR, 2011

Random input helps searching predecessors
CoRR, 2011

Natural Models for Evolution on Networks
CoRR, 2011

On the Performance of Approximate Equilibria in Congestion Games.
Algorithmica, 2011

Communication and security in random intersection graphs models.
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

Natural Models for Evolution on Networks.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Approximability of Symmetric Bimatrix Games and Related Experiments.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

The Computational Power of Simple Protocols for Self-awareness on Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof).
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

Rationality authority for provable rational behavior.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices.
Proceedings of the IEEE 8th International Conference on Mobile Adhoc and Sensor Systems, 2011

A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution.
Proceedings of the Global Security, Safety and Sustainability & e-Democracy, 2011

Passively mobile communicating machines that use restricted space.
Proceedings of the FOMC'11, 2011

Selected Combinatorial Properties of Random Intersection Graphs.
Proceedings of the Algebraic Foundations in Computer Science, 2011

Adaptive Hierarchical Network Structures for Wireless Sensor Networks.
Proceedings of the Ad Hoc Networks - Third International ICST Conference, 2011

2010
Sharp thresholds for Hamiltonicity in random intersection graphs.
Theor. Comput. Sci., 2010

Game authority for robust and scalable distributed selfish-computer systems.
Theor. Comput. Sci., 2010

Atomic Congestion Games: Fast, Myopic and Concurrent.
Theory Comput. Syst., 2010

Passively Mobile Communicating Machines that Use Restricted Space
CoRR, 2010

Passively Mobile Communicating Logarithmic Space Machines
CoRR, 2010

The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game
CoRR, 2010

Well Supported Approximate Equilibria in Bimatrix Games.
Algorithmica, 2010

Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Stably Decidable Graph Languages by Mediated Population Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Algorithmic Verification of Population Protocols.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Blueprints for a Large-Scale Early Warning System.
Proceedings of the 14th Panhellenic Conference on Informatics, 2010

Distributed Game-Theoretic Vertex Coloring.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Fun with Games.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Information security for sensors by overwhelming random sequences and permutations.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

Information security for sensors by overwhelming random sequences and permutations.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.
Proceedings of the Approximation, 2010

2009
Preface.
Theor. Comput. Sci., 2009

Expander properties and the cover time of random intersection graphs.
Theor. Comput. Sci., 2009

Computing on a partially eponymous ring.
Theor. Comput. Sci., 2009

On the support size of stable strategies in random games.
Theor. Comput. Sci., 2009

Polynomial algorithms for approximating Nash equilibria of bimatrix games.
Theor. Comput. Sci., 2009

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
Theor. Comput. Sci., 2009

The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci., 2009

A Graph Spectral Approach for Computing Approximate Nash Equilibria.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Recent Advances in Approximability of Bimatrix Nash.
Bulletin of the EATCS, 2009

A note on proofs of existence of Nash equilibria in finite strategic games, of two players.
Computer Science Review, 2009

Book review.
Computer Science Review, 2009

A glimpse at Christos H. Papadimitriou.
Computer Science Review, 2009

A Graph Spectral Approach for Computing Approximate Nash Equilibria
CoRR, 2009

The survival of the weakest in networks.
Computational & Mathematical Organization Theory, 2009

Preface to special issue on cooperation in selfish systems.
Computational & Mathematical Organization Theory, 2009

Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks.
Algorithms, 2009

The Impact of Social Ignorance on Weighted Congestion Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Brief Announcement: Decidable Graph Languages by Mediated Population Protocols.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Not All Fair Probabilistic Schedulers Are Equivalent.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Colouring Non-sparse Random Intersection Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Recent Advances in Population Protocols.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Combinatorial properties for efficient communication in distributed networks with local interactions.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Efficient Methods for Selfish Network Design.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Mediated Population Protocols.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

On the Performance of Approximate Equilibria in Congestion Games.
Proceedings of the Algorithms, 2009

The Impact of the Web and Political Balance to e-Democracy.
Proceedings of the Next Generation Society. Technological and Legal Issues, 2009

Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society?
Proceedings of the Next Generation Society. Technological and Legal Issues, 2009

On the Fairness of Probabilistic Schedulers for Population Protocols.
Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks.
Proceedings of the International Conference on Advances in Computer Entertainment Technology, 2009

Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets.
Proceedings of the International Conference on Advances in Computer Entertainment Technology, 2009

Paradigms for fast parallel approximability (Reprint from 1997).
Cambridge international series on parallel computation 8, Cambridge University Press, ISBN: 978-0-521-43170-5, 2009

2008
Tail Bounds for Occupancy Problems.
Proceedings of the Encyclopedia of Algorithms, 2008

Selfish Unsplittable Flows: Algorithms for Pure Equilibria.
Proceedings of the Encyclopedia of Algorithms, 2008

Best Response Algorithms for Selfish Routing.
Proceedings of the Encyclopedia of Algorithms, 2008

Independent Sets in Random Intersection Graphs.
Proceedings of the Encyclopedia of Algorithms, 2008

Approximations of Bimatrix Nash Equilibria.
Proceedings of the Encyclopedia of Algorithms, 2008

Stackelberg Games: The Price of Optimum.
Proceedings of the Encyclopedia of Algorithms, 2008

Minimum Congestion Redundant Assignments.
Proceedings of the Encyclopedia of Algorithms, 2008

Hamilton Cycles in Random Intersection Graphs.
Proceedings of the Encyclopedia of Algorithms, 2008

Weighted Random Sampling.
Proceedings of the Encyclopedia of Algorithms, 2008

Efficient sensor network design for continuous monitoring of moving objects.
Theor. Comput. Sci., 2008

Large independent sets in general random intersection graphs.
Theor. Comput. Sci., 2008

Random sampling of colourings of sparse random graphs with a constant number of colours.
Theor. Comput. Sci., 2008

Atomic congestion games among coalitions.
ACM Trans. Algorithms, 2008

Preface.
Theory Comput. Syst., 2008

An Optimization Approach for Approximate Nash Equilibria.
Internet Mathematics, 2008

Cost-Balancing Tolls for Atomic Network Congestion Games.
Internet Mathematics, 2008

A graph-theoretic network security game.
IJAACS, 2008

The Dynamics of Probabilistic Population Protocols
CoRR, 2008

A probabilistic key agreement scheme for sensor networks without key predistribution
CoRR, 2008

Efficient Scheduling of DAGs and Sets of Chains on a Simple Asymmetric Multicore Model
CoRR, 2008

On the performance of approximate equilibria in congestion games
CoRR, 2008

Random sampling of colourings of sparse random graphs with a constant number of colours
CoRR, 2008

Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
Algorithmica, 2008

A Network Game with Attackers and a Defender.
Algorithmica, 2008

Performance Evaluation of a Descent Algorithm for Bi-matrix Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Equilibrium Points in Fear of Correlated Threats.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

The Dynamics of Probabilistic Population Protocols.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Optimal Algorithms for Detecting Network Stability.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

The Dynamics of Adaptive Networked Societies of Tiny Artefacts.
Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Approximate Equilibria for Strategic Two Person Games.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Atomic Congestion Games: Fast, Myopic and Concurrent.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Scheduling tasks with dependencies on asymmetric multiprocessors.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

A Game Theoretic Approach for Efficient Graph Coloring.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

A step-wise refinement approach for enhancing e-voting acceptance.
Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance, 2008

A Security Model for Internet-Based Digital Asset Management Systems.
Proceedings of the Software Architecture, Second European Conference, 2008

Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract).
Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems, 2008

2007
Randomized Approximation Techniques.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Atomic Selfish Routing in Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

The increase of the instability of networks due to Quasi-Static link capacities.
Theor. Comput. Sci., 2007

Performance and stability bounds for dynamic networks.
J. Parallel Distrib. Comput., 2007

Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks.
Electr. Notes Theor. Comput. Sci., 2007

Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time..
Electronic Colloquium on Computational Complexity (ECCC), 2007

The Price of Selfish Routing.
Algorithmica, 2007

Agent-based Distributed Group Key Establishment in Wireless Sensor Networks.
Proceedings of the 2007 International Symposium on a World of Wireless, 2007

An Optimization Approach for Approximate Nash Equilibria.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Cost-Balancing Tolls for Atomic Network Congestion Games.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Full and Local Information in Distributed Decision Making.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Support Size of Stable Strategies in Random Games.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Probabilistic Techniques in Algorithmic Game Theory.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Game authority for robust andscalable distributed selfish-computer systems.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Expander Properties and the Cover Time of Random Intersection Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Selfish Load Balancing Under Partial Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

A Trust-Centered Approach for Building E-Voting Systems.
Proceedings of the Electronic Government, 6th International Conference, 2007

The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

Efficient Sensor Network Design for Continuous Monitoring of Moving Objects.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

Trust in global computing systems as a limit property emerging from short range random interactions.
Proceedings of the The Second International Conference on Availability, 2007

2006
Approximation schemes for scheduling and covering on unrelated machines.
Theor. Comput. Sci., 2006

Introduction.
J. Parallel Distrib. Comput., 2006

Algorithms for pure Nash equilibria in weighted congestion games.
ACM Journal of Experimental Algorithmics, 2006

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.
J. Discrete Algorithms, 2006

Weighted random sampling with a reservoir.
Inf. Process. Lett., 2006

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Eight Open Problems in Distributed Computing.
Bulletin of the EATCS, 2006

The infection time of graphs.
Discrete Applied Mathematics, 2006

Direct Routing: Algorithms and Complexity.
Algorithmica, 2006

A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks.
Ad Hoc Networks, 2006

Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

The Survival of the Weakest in Networks.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Computing on a Partially Eponymous Ring.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

The Price of Defense.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

The Power of the Defender.
Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006

The Price of Defense and Fractional Matchings.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Atomic Congestion Games Among Coalitions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005
Distributed Algorithms for Some Fundamental Problems in Ad Hoc Mobile Environments.
Proceedings of the Handbook of Algorithms for Wireless Networking and Mobile Computing., 2005

Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci., 2005

Radiocoloring in planar graphs: Complexity and approximations.
Theor. Comput. Sci., 2005

Selfish unsplittable flows.
Theor. Comput. Sci., 2005

The chromatic and clique numbers of random scaled sector graphs.
Theor. Comput. Sci., 2005

The cost of concurrent, low-contention Read&Modify&Write.
Theor. Comput. Sci., 2005

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.
SIAM J. Comput., 2005

The Impact of Network Structure on the Stability of Greedy Protocols.
Theory Comput. Syst., 2005

Space Efficient Hash Tables with Worst Case Constant Access Time.
Theory Comput. Syst., 2005

Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks.
MONET, 2005

Max-min Fair Flow Control Sensitive to Priorities.
Journal of Interconnection Networks, 2005

The Price of Optimum in Stackelberg Games
Electronic Colloquium on Computational Complexity (ECCC), 2005

An Application of the Monotone Linearizability Lemma.
Bulletin of the EATCS, 2005

A Cost Mechanism for Fair Pricing of Resource Usage.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

A Graph-Theoretic Network Security Game.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Atomic Selfish Routing in Networks: A Survey.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Experimental Results for Stackelberg Scheduling Strategies.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Generating and Radiocoloring Families of Perfect Graphs.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Keynote Talk Summary: Algorithmic Aspects of Sensor Networks.
Proceedings of the Autonomic Communication, Second International IFIP Workshop, 2005

The Contribution of Game Theory to Complex Systems.
Proceedings of the Advances in Informatics, 2005

"Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience.
Proceedings of the Information Security, 8th International Conference, 2005

Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Network Game with Attacker and Protector Entities.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Counting Stable Strategies in Random Evolutionary Games.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On the Existence of Hamiltonian Cycles in Random Intersection Graphs.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Cost Sharing Mechanisms for Fair Pricing of Resources Usage.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

A Cost Mechanism for Fair Pricing of Resource Usage.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

Evolutionary Games: An Algorithmic View.
Proceedings of the Self-star Properties in Complex Information Systems, 2005

2004
A hierarchical adaptive distributed algorithm for load balancing.
J. Parallel Distrib. Comput., 2004

The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing).
Bulletin of the EATCS, 2004

How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks.
Proceedings of the NETWORKING 2004, 2004

Performance and Stability Bounds for Dynamic Networks.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Selfish Unsplittable Flows.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks.
Proceedings of the Global Computing, IST/FET International Workshop, 2004

Electronic National Lotteries.
Proceedings of the Financial Cryptography, 2004

Direct Routing: Algorithms and Complexity.
Proceedings of the Algorithms, 2004

Algorithmic and Foundational Aspects of Sensor Systems: (Invited Talk).
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

Analysis of the Information Propagation Time Among Mobile Hosts.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Preface.
Theor. Comput. Sci., 2003

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling.
Theor. Comput. Sci., 2003

A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks.
Parallel Processing Letters, 2003

Attack Propagation in Networks.
Theory Comput. Syst., 2003

Approximate Equilibria and Ball Fusion.
Theory Comput. Syst., 2003

Distributed communication algorithms for ad hoc mobile networks.
J. Parallel Distrib. Comput., 2003

Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks.
I. J. Comput. Appl., 2003

FIFO is Unstable at Arbitrarily Low Rates
Electronic Colloquium on Computational Complexity (ECCC), 2003

Competitive Video on Demand Schedulers for Popular Movies.
Discrete Applied Mathematics, 2003

Algorithms and Experiments on Colouring Squares of Planar Graphs.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Space Efficient Hash Tables with Worst Case Constant Access Time.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Instability of Networks with Quasi-Static Link Capacities.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

The Cost of Concurrent, Low-Contention Read-Modify-Write.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

NanoPeer Networks and P2P Worlds.
Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003), 2003

Which Is the Worst-Case Nash Equilibrium?
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

The Impact of Network Structure on the Stability of Greedy Protocols.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
On the robustness of interconnections in random graphs: a symbolic approach.
Theor. Comput. Sci., 2002

STEPS: Supporting Traditional Education Procedures-A TCP/IP Multimedia Networks-Based Model.
Multimedia Tools Appl., 2002

Competitive Call Control in Mobile Networks.
Theory Comput. Syst., 2002

Distributed Communication Algorithms.
Bulletin of the EATCS, 2002

Minimum Congestion Redundant Assignments to Tolerate Random Faults.
Algorithmica, 2002

Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Approximate Equilibria and Ball Fusion.
Proceedings of the SIROCCO 9, 2002

Smart dust protocols for local detection and propagation.
Proceedings of the 2002 Workshop on Principles of Mobile Computing, 2002

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Mobile Computing, Mobile Networks.
Proceedings of the Euro-Par 2002, 2002

2001
The Range of Stability for Heterogeneous and FIFO Queueing Networks.
Electronic Colloquium on Computational Complexity (ECCC), 2001

Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.
Bulletin of the EATCS, 2001

Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Computers and Artificial Intelligence, 2001

An Efficient Communication Strategy for Ad-hoc Mobile Networks.
Proceedings of the Distributed Computing, 15th International Conference, 2001

An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks.
Proceedings of the Algorithm Engineering, 2001

The price of selfish routing.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Attack propagation in networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Stability and non-stability of the FIFO protocol.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

An efficient communication strategy for ad-hoc mobile networks.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Stability Behavior of FIFO Protocol in the Adversarial Queuing Model.
Proceedings of the Advances in Informatics, 8th Panhellenic Conference on Informatics, 2001

An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model.
Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

2000
Robust Parallel Computations through Randomization.
Theory Comput. Syst., 2000

Efficient Scheduling of Strict Multithreaded Computations.
Theory Comput. Syst., 2000

Connectivity Properties in Random Regular Graphs with Edge Faults.
Int. J. Found. Comput. Sci., 2000

Efficient Communication Establishment in Extremely Unreliable Large Networks
Electronic Colloquium on Computational Complexity (ECCC), 2000

Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
Electronic Colloquium on Computational Complexity (ECCC), 2000

Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks.
Proceedings of the Algorithm Engineering, 2000

NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Trade-Offs between Density and Robustness in Random Interconnection Graphs.
Proceedings of the Theoretical Computer Science, 2000

Efficient Communication Establishment in Adverse Communication Environments.
Proceedings of the ICALP Workshops 2000, 2000

Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Distributed Algorithm Engineering.
Proceedings of the Experimental Algorithmics, 2000

1999
Optimal High-Performance Parallel Text Retrieval via Fat-Trees.
Theory Comput. Syst., 1999

BSP versus LogP.
Algorithmica, 1999

A New Scheduling Algorithm for General Strict Multithreaded Computations.
Proceedings of the Distributed Computing, 1999

Counting in Mobile Networks: Theory and Experimentation.
Proceedings of the Algorithm Engineering, 1999

Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.
Proceedings of the Algorithm Engineering, 1999

Fundamental Control Algorithms in Mobile Networks.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

Efficient Redundant Assignments under Fault-Tolerance Constraints.
Proceedings of the Randomization, 1999

Optimal, Distributed Decision-Making: The Case of no Communication.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Fundamental Distributed Protocols in Mobile Networks.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Optimal, Distributed Decision-Making: The Case of No Communication.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
On the Random Generation and Counting of Matchings in Dense Graphs.
Theor. Comput. Sci., 1998

An Analytical Performance Model for Multistage Interconnection Networks with Finite, Infinite and Zero Length Buffers.
Perform. Eval., 1998

Random Walks, Conditional Hitting Sets and Partial Derandomization
Electronic Colloquium on Computational Complexity (ECCC), 1998

Graph Properties that Facilitate Travelling
Electronic Colloquium on Computational Complexity (ECCC), 1998

Implementation and Testing Eavesdropper Protocols Using the DSP Tool.
Proceedings of the Algorithm Engineering, 1998

"Dynamic-Fault-Prone BSP": A Paradigm for Robust Computations in Changing Environments.
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
Proceedings of the SIROCCO'98, 1998

The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

MaxMin Fair Flow Control Sensitive to Priorities.
Proceedings of the Distributed Computing, 1998

A Hamiltonian Approach to the Assignment of Non-reusable Frequencies.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

A Competitive Symmetrical Transfer Policy for Load Sharing.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.
Theor. Comput. Sci., 1997

Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations.
Parallel Processing Letters, 1997

Editor's Foreword.
Theory Comput. Syst., 1997

Enabling Distance Education over the World Wide Web.
Proceedings of WebNet 97, 1997

Efficient Computations on Fault-Prone BSP Machines.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Advances in Rate-Based Flow Control.
Proceedings of the SIROCCO'97, 1997

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Competitive Call Control in Mobile Networks.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

On the Fault Tolerance of Fat-Trees.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

A General Performance Model for Multistage Interconnection Networks.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Frequency assignment in mobile and radio networks.
Proceedings of the Networks in Distributed Computing, 1997

Linear and nonlinear systems: A survey.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

An Object-Oriented Data Model for the Intelligent Support of Three-Dimensional Objects.
Proceedings of the Eighth International Workshop on Database and Expert Systems Applications, 1997

1996
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
Theor. Comput. Sci., 1996

Performance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks.
Perform. Eval., 1996

Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps.
Inf. Process. Lett., 1996

Parallel Techniques For Efficient Searching Over Very Large Text Collections.
Proceedings of The Fifth Text REtrieval Conference, 1996

BSP vs LogP.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Randomized Adaptive Video on Demand (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Scheduling Algorithms for Strict Multithreaded Computations.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

On-Demand Hypermedia/Multimedia Service over Broadband Networks.
Proceedings of the 5th International Symposium on High Performance Distributed Computing (HPDC '96), 1996

Wormhole Versus Deflection Routing: A Case Study on the Mesh.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

Attack Modelling in Open Network Environments.
Proceedings of the Communications and Multimedia Security II, 1996

1995
The Fourth Moment in Luby's Distribution.
Theor. Comput. Sci., 1995

Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture.
Random Struct. Algorithms, 1995

Distributed Protocols Against Mobile Eavesdroppers.
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Expander Properties in Random Regular Graphs with Edge Faults.
STACS, 1995

Wormhole Routing Simulation on a Mesh.
Proceedings of the Structure, Information and Communication Complexity, 1995

Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model.
Proceedings of the SIGIR'95, 1995

Randomized Competitive Algorithms for Admission Control in General Networks (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Efficient Parallel Algorithms for some Tree Layout Problems.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity.
IEEE Trans. Parallel Distrib. Syst., 1994

Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.
Theor. Comput. Sci., 1994

Intrusion detection: Approach and performance issues of the SECURENET system.
Computers & Security, 1994

Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Surveillance and Protection in IBC Management: The Applicability of Two RACE Security Projects - SecureNet II and SESAME.
Proceedings of the Towards a Pan-European Telecommunication Service Infrastructure, 1994

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

A Conceptual DataBase Approach for Modelling 3D Objects of Irregular Geometry.
Proceedings of the Database and Expert Systems Applications, 5th International Conference, 1994

1993
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays
Inf. Comput., July, 1993

Parallel Complexity of the Connected Subgraph Problem.
SIAM J. Comput., 1993

Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases.
Proceedings of the MASCOTS '93, 1993

The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases.
Proceedings of the Computing and Information, 1993

Brain Data Base (BDB).
Proceedings of the Database and Expert Systems Applications, 4th International Conference, 1993

1992
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs.
BIT, 1992

Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems.
Algorithmica, 1992

Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992


1991
The Complexity of the Reliable Connectivity Problem.
Inf. Process. Lett., 1991

Fast Parallel Algorithms for Coloring Random Graphs.
Proceedings of the 17th International Workshop, 1991

Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity.
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Tight RNC Approximations to Max Flow.
Proceedings of the STACS 91, 1991

The Complexity of The Reliable Connectivity Problem.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps.
Proceedings of the Advances in Computing and Information, 1991

A Parallel Algorithm for Two Processors Precedence Constraint Scheduling.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Optimal Parallel Algorithms for Sparse Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Efficient Parallel Algorithms for Shortest Paths in Planar Graphs.
Proceedings of the SWAT 90, 1990

Efficient Robust Parallel Computations (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

The Performance of Multistage Interconnection Networks with Finite Buffers.
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1990

1989
Efficient Distributed Algorithms by Using The Archimedean Time Assumption.
ITA, 1989

Symmetry Breaking in Asynchronous Rings with O(n) Messages.
Proceedings of the Distributed Algorithms, 1989

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

The Approximability of Problems Complete for P.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

The Parallel Complexity of the Subgraph Connectivity Problem
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification
Inf. Comput., January, 1988

Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P.
Proceedings of the SWAT 88, 1988

Efficient Distributed Algorithms by Using the Archemedean Time Assumption.
Proceedings of the STACS 88, 1988

Approximate Queueing Models for the Load Balancing Problem.
Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1988

Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances).
Proceedings of the Parcella '88, 1988

1987
The Parallel Complexity of Deadlock Detection.
Theor. Comput. Sci., 1987

Queueing Delays in Buffered Multistage Interconnection Networks.
Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1987

Fast Parallel Algorithms for Processing of Joins.
Proceedings of the Supercomputing, 1987

1986
The Diameter of Connected Components of Random Graphs.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification.
Proceedings of the STACS 86, 1986

The Parallel Complexity of Deadlock Detection.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

The Logical "First Mile-Last Mile" Digital Termination Systems (Abstract only).
Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986

A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
Unbounded Speed Variability in Distributed Communications Systems.
SIAM J. Comput., 1985

k-connectivity in random undirected graphs.
Discrete Mathematics, 1985

The Volume of the Union of Many Sheres and Point Inclusion Problems.
Proceedings of the STACS 85, 1985

A Semantic Approach to Correctness of Concurrent Transaction Executions.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

1984
Real-Time Synchronization of Interprocess Communications.
ACM Trans. Program. Lang. Syst., 1984

Strong NP-Hardness of Moving Many Discs.
Inf. Process. Lett., 1984

Probabilistic Bidding Gives Optimal Distributed Resource Allocation.
Proceedings of the Automata, 1984

Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1982
Unbounded Speed Variability in Distributed Communication Systems.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

Real Time Resource Allocation in Distributed Systems.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981
Distributed Algorithms for Synchronizing Interprocess Communication within Real Time
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980
Random Matroids
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980


  Loading...