Paul G. Spirakis
Orcid: 0000-0001-5396-3749Affiliations:
- University of Liverpool, UK
- University of Patras, Greece
According to our database1,
Paul G. Spirakis
authored at least 463 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on cti.gr
On csauthors.net:
Bibliography
2024
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
2023
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems.
Algorithmica, September, 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023
Proceedings of the 35th IEEE International Symposium on Computer Architecture and High Performance Computing, 2023
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk).
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023
Probabilistic Decision Trees for Predicting 12-Month University Students Likely to Experience Suicidal Ideation.
Proceedings of the Artificial Intelligence Applications and Innovations, 2023
On the Existence of Highly Organized Communities in Networks of Locally Interacting Agents.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2023
Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
2022
J. Comput. Syst. Sci., 2022
On convergence and threshold properties of discrete Lotka-Volterra population protocols.
J. Comput. Syst. Sci., 2022
Inf. Comput., 2022
Distributed Comput., 2022
How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem.
Cryptogr., 2022
Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols.
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022
Novel Decision Forest Building Techniques by Utilising Correlation Coefficient Methods.
Proceedings of the Engineering Applications of Neural Networks, 2022
Data-driven soft sensing towards quality monitoring of industrial pasteurization processes.
Proceedings of the 18th International Conference on Distributed Computing in Sensor Systems, 2022
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022
Proceedings of the Algorithmics of Wireless Networks, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Parallel Process. Lett., 2021
J. Comput. Syst. Sci., 2021
Inf., 2021
Maximum cliques in graphs with small intersection number and random intersection graphs.
Comput. Sci. Rev., 2021
New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive).
CoRR, 2021
An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures.
Algorithms, 2021
Proceedings of the PCI 2021: 25th Pan-Hellenic Conference on Informatics, Volos, Greece, November 26, 2021
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
A human-centered Web-based tool for the effective real-time motion data collection and annotation from BLE IoT devices.
Proceedings of the 17th International Conference on Distributed Computing in Sensor Systems, 2021
A Complementary Sensing Platform for a holistic approach to Allergic Rhinitis monitoring.
Proceedings of the 17th International Conference on Distributed Computing in Sensor Systems, 2021
Effective Enumeration of Infinitely Many Programs that Evade Formal Malware Analysis.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021
2020
J. Comput. Syst. Sci., 2020
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the 16th International Conference on Distributed Computing in Sensor Systems, 2020
Proceedings of the 16th International Conference on Distributed Computing in Sensor Systems, 2020
2019
Parallel Process. Lett., 2019
J. Comput. Syst. Sci., 2019
Algorithmica, 2019
Randomized and Set-System Based Collusion Resistant Key Predistribution Schemes (Brief Announcement).
Proceedings of the Cyber Security Cryptography and Machine Learning, 2019
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
Proceedings of the Ambient Intelligence - 15th European Conference, 2019
2018
CoRR, 2018
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
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
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
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
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Efficient Approximation Algorithms in Random Intersection Graphs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Theory Comput. Syst., 2017
Theory Comput. Syst., 2017
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners.
Bull. EATCS, 2017
Determining majority in networks with local interactions and very small local memory.
Distributed Comput., 2017
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017
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
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
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2016
Encyclopedia of Algorithms, 2016
J. Parallel Distributed Comput., 2016
Distributed Comput., 2016
Algorithmica, 2016
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
J. Parallel Distributed Comput., 2015
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015
Proceedings of the Algorithms, Probability, Networks, and Games, 2015
On Radiocoloring Hierarchically Specified Planar Graphs: <i>PSPACE</i> -completeness and Approximations.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015
2014
Theor. Comput. Sci., 2014
Theory Comput. Syst., 2014
Causality, influence, and computation in possibly disconnected synchronous dynamic networks.
J. Parallel Distributed Comput., 2014
Algorithmica, 2014
Ad Hoc Networks, 2014
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014
2013
Theor. Comput. Sci., 2013
J. Cases Inf. Technol., 2013
The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs.
CoRR, 2013
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013
Proceedings of the 4th International Conference on Information, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
Proceedings of the Computer Science - Theory and Applications, 2013
2012
Theor. Comput. Sci., 2012
Theory Comput. Syst., 2012
CoRR, 2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02004-9, 2011
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata.
Int. J. Auton. Adapt. Commun. Syst., 2011
Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts.
Comput. Sci. Rev., 2011
Comput. Sci. Rev., 2011
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011
Proceedings of the Experimental Algorithms - 10th International Symposium, 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
Proceedings of the Algebraic Foundations in Computer Science, 2011
Proceedings of the Ad Hoc Networks - Third International ICST Conference, 2011
2010
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 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
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
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010
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
Proceedings of the 14th Panhellenic Conference on Informatics, 2010
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><sup>2</sup>) Are Stably Computable by the Mediated Population Protocol Model.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
Proceedings of the Fun with Algorithms, 5th International Conference, 2010
Proceedings of the Approximation, 2010
2009
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
Electron. Colloquium Comput. Complex., 2009
Recent Advances in Approximability of Bimatrix Nash.
Bull. EATCS, 2009
A note on proofs of existence of Nash equilibria in finite strategic games, of two players.
Comput. Sci. Rev., 2009
Comput. Math. Organ. Theory, 2009
Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks.
Algorithms, 2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
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
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
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
Cambridge international series on parallel computation 8, Cambridge University Press, ISBN: 978-0-521-43170-5, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Theor. Comput. Sci., 2008
Theor. Comput. Sci., 2008
Random sampling of colourings of sparse random graphs with a constant number of colours.
Theor. Comput. Sci., 2008
Efficient Scheduling of DAGs and Sets of Chains on a Simple Asymmetric Multicore Model
CoRR, 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
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
Proceedings of the Distributed Computing, 22nd International Symposium, 2008
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008
Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance, 2008
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
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007
Theor. Comput. Sci., 2007
J. Parallel Distributed Comput., 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the 2007 International Symposium on a World of Wireless, 2007
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
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
Proceedings of the Electronic Government, 6th International Conference, 2007
Proceedings of the Algebraic Informatics, Second International Conference, 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
Theor. Comput. Sci., 2006
ACM J. Exp. Algorithmics, 2006
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.
J. Discrete Algorithms, 2006
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks.
Proceedings of the Second Workshop on Cryptography for Ad-hoc Networks, 2006
Eight Open Problems in Distributed Computing.
Bull. EATCS, 2006
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks.
Ad Hoc Networks, 2006
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006
Proceedings of the Distributed Computing and Networking, 8th International Conference, 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
Proceedings of the Handbook of Algorithms for Wireless Networking and Mobile Computing., 2005
Theor. Comput. Sci., 2005
Theor. Comput. Sci., 2005
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.
SIAM J. Comput., 2005
Theory Comput. Syst., 2005
Theory Comput. Syst., 2005
Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks.
Mob. Networks Appl., 2005
Electron. Colloquium Comput. Complex., 2005
An Application of the Monotone Linearizability Lemma.
Bull. EATCS, 2005
Proceedings of the Internet and Network Economics, First International Workshop, 2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005
Proceedings of the Autonomic Communication, Second International IFIP Workshop, 2005
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
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005
Proceedings of the Self-star Properties in Complex Information Systems, 2005
2004
J. Parallel Distributed Comput., 2004
The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing).
Bull. EATCS, 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the NETWORKING 2004, 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
Proceedings of the Global Computing, IST/FET International Workshop, 2004
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004
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 Process. Lett., 2003
J. Parallel Distributed Comput., 2003
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks.
Int. J. Comput. Their Appl., 2003
Electron. Colloquium Comput. Complex., 2003
Discret. Appl. Math., 2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 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
Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003), 2003
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003
2002
Theor. Comput. Sci., 2002
STEPS: Supporting Traditional Education Procedures-A TCP/IP Multimedia Networks-Based Model.
Multim. Tools Appl., 2002
Distributed Communication Algorithms.
Bull. EATCS, 2002
Algorithmica, 2002
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.
Proceedings of the Distributed Computing, 16th International Conference, 2002
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
2001
Electron. Colloquium Comput. Complex., 2001
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.
Bull. EATCS, 2001
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Comput. Artif. Intell., 2001
Proceedings of the Distributed Computing, 15th International Conference, 2001
Proceedings of the Algorithm Engineering, 2001
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Proceedings of the Advances in Informatics, 8th Panhellenic Conference on Informatics, 2001
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
Theory Comput. Syst., 2000
Int. J. Found. Comput. Sci., 2000
Electron. Colloquium Comput. Complex., 2000
Electron. Colloquium Comput. Complex., 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
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
Proceedings of the Experimental Algorithmics, 2000
1999
Theory Comput. Syst., 1999
Proceedings of the Distributed Computing, 1999
Proceedings of the Algorithm Engineering, 1999
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.
Proceedings of the Algorithm Engineering, 1999
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
Proceedings of the Randomization, 1999
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999
1998
Theor. Comput. Sci., 1998
An Analytical Performance Model for Multistage Interconnection Networks with Finite, Infinite and Zero Length Buffers.
Perform. Evaluation, 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Implementation and Testing Eavesdropper Protocols Using the DSP Tool.
Proceedings of the Algorithm Engineering, 2nd International Workshop, 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
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
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998
Proceedings of the Euro-Par '98 Parallel Processing, 1998
1997
Theor. Comput. Sci., 1997
Parallel Process. Lett., 1997
Enabling Distance Education over the World Wide Web.
Proceedings of WebNet 97, 1997
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
Proceedings of the Euro-Par '97 Parallel Processing, 1997
Proceedings of the Euro-Par '97 Parallel Processing, 1997
Proceedings of the Networks in Distributed Computing, 1997
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. Evaluation, 1996
Inf. Process. Lett., 1996
Proceedings of The Fifth Text REtrieval Conference, 1996
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996
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
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
Proceedings of the 5th International Symposium on High Performance Distributed Computing (HPDC '96), 1996
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
Random Struct. Algorithms, 1995
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995
Proceedings of the STACS 95, 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
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 Distributed Syst., 1994
Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.
Theor. Comput. Sci., 1994
Comput. Secur., 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
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
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
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
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
Proceedings of the Database and Expert Systems Applications, 4th International Conference, 1993
1992
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems.
Algorithmica, 1992
1991
Proceedings of the 17th 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
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
1990
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990
Proceedings of the SWAT 90, 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1990
1989
RAIRO Theor. Informatics Appl., 1989
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
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
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
Proceedings of the SWAT 88, 1988
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
Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1987
Proceedings of the Supercomputing, 1987
1986
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 Logical "First Mile-Last Mile" Digital Termination Systems (Abstract only).
Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986
1985
SIAM J. Comput., 1985
Proceedings of the STACS 85, 1985
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985
1984
ACM Trans. Program. Lang. Syst., 1984
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
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982
1981
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981
1980
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980