2013
361Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. George B. Mertzios, Paul G. Spirakis. SOFSEM 2013, 332-343. Web SearchBibTeXDownload
360Natural models for evolution on networks. George B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Theor. Comput. Sci. (477): 76-95 (2013). Web SearchBibTeXDownload
2012
359Can Fixation be Guaranteed in the Generalized Moran Process?. Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis. CoRR (abs/1202.0436) (2012). Web SearchBibTeXDownload
358Causality, Influence, and Computation in Possibly Disconnected Dynamic Networks. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. CoRR (abs/1206.1290) (2012). Web SearchBibTeXDownload
357Strong Bounds for Evolution in Undirected Graphs. George B. Mertzios, Paul G. Spirakis. CoRR (abs/1211.2384) (2012). Web SearchBibTeXDownload
356Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. George B. Mertzios, Paul G. Spirakis. CoRR (abs/1202.4665) (2012). Web SearchBibTeXDownload
355On the Hardness of Network Design for Bottleneck Routing Games. Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis. CoRR (abs/1207.5212) (2012). Web SearchBibTeXDownload
354Naming and Counting in Anonymous Unknown Dynamic Networks. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. CoRR (abs/1208.0180) (2012). Web SearchBibTeXDownload
353Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. CoRR (abs/1204.4054) (2012). Web SearchBibTeXDownload
352Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. DISC 2012, 437-438. Web SearchBibTeXDownload
351Causality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. OPODIS 2012, 269-283. Web SearchBibTeXDownload
350Approximating fixation probabilities in the generalized Moran process. Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis. SODA 2012, 954-960. Web SearchBibTeXDownload
349Terminating Population Protocols via Some Minimal Global Knowledge Assumptions. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. SSS 2012, 77-89. Web SearchBibTeXDownload
348Playing a Game to Bound the Chromatic Number. Panagiota N. Panagopoulou, Paul G. Spirakis. The American Mathematical Monthly (119): 771-778 (2012). Web SearchBibTeXDownload
347On mutual concavity and strategically-zero-sum bimatrix games. Spyros C. Kontogiannis, Paul G. Spirakis. Theor. Comput. Sci. (432): 64-76 (2012). Web SearchBibTeXDownload
346Efficient methods for selfish network design. Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. Theor. Comput. Sci. (448): 9-20 (2012). Web SearchBibTeXDownload
345The Impact of Social Ignorance on Weighted Congestion Games. Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis. Theory Comput. Syst. (50): 559-578 (2012). Web SearchBibTeXDownload
2011
344Adaptive Hierarchical Network Structures for Wireless Sensor Networks. Dimitrios Amaxilatis, Ioannis Chatzigiannakis, Shlomi Dolev, Christos Koninis, Apostolos Pyrgelis, Paul G. Spirakis. ADHOCNETS 2011, 65-80. Web SearchBibTeXDownload
343Selected Combinatorial Properties of Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Algebraic Foundations in Computer Science 2011, 347-362. Web SearchBibTeXDownload
342On the Performance of Approximate Equilibria in Congestion Games. George Christodoulou, Elias Koutsoupias, Paul G. Spirakis. Algorithmica (61): 116-140 (2011). Web SearchBibTeXDownload
341Selfish splittable flows and NP-completeness. Alexis C. Kaporis, Paul G. Spirakis. Computer Science Review (5): 209-228 (2011). Web SearchBibTeXDownload
340Computational models for networks of tiny artifacts: A survey. Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, Paul G. Spirakis. Computer Science Review (5): 7-25 (2011). Web SearchBibTeXDownload
339Introduction to the special issue on foundations of adaptive networked societies of tiny artefacts. Ioannis Chatzigiannakis, Paul G. Spirakis. Computer Science Review (5): 4-6 (2011). Web SearchBibTeXDownload
338Robust and scalable middleware for selfish-computer systems. Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas. Computer Science Review (5): 69-84 (2011). Web SearchBibTeXDownload
337Innovative approaches for security of small artefacts. Carlo Blundo, Angelo De Caro, Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis. Computer Science Review (5): 47-55 (2011). Web SearchBibTeXDownload
336Random input helps searching predecessors. Djamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis. CoRR (abs/1104.4353) (2011). Web SearchBibTeXDownload
335Natural Models for Evolution on Networks. George B. Mertzios, Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. CoRR (abs/1102.3426) (2011). Web SearchBibTeXDownload
334Elliptic Curve Based Zero Knowledge Proofs and Their Applicability on Resource Constrained Devices. Ioannis Chatzigiannakis, Apostolos Pyrgelis, Paul G. Spirakis, Yannis C. Stamatiou. CoRR (abs/1107.1626) (2011). Web SearchBibTeXDownload
333Approximating Fixation Probabilities in the Generalized Moran Process. Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis. CoRR (abs/1111.3321) (2011). Web SearchBibTeXDownload
332Passively mobile communicating machines that use restricted space. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis. FOMC 2011, 6-15. Web SearchBibTeXDownload
331A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution. Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou. ICGS3/e-Democracy 2011, 72-79. Web SearchBibTeXDownload
330Strategies for repeated games with subsystem takeovers implementable by deterministic and self-stabilising automata. Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas. IJAACS (4): 4-38 (2011). Web SearchBibTeXDownload
329Elliptic Curve Based Zero Knowledge Proofs and their Applicability on Resource Constrained Devices. Ioannis Chatzigiannakis, Apostolos Pyrgelis, Paul G. Spirakis, Yannis C. Stamatiou. MASS 2011, 715-720. Web SearchBibTeXDownload
328Rationality authority for provable rational behavior. Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis. PODC 2011, 289-290. Web SearchBibTeXDownload
327Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). Panagiota N. Panagopoulou, Paul G. Spirakis. SAGT 2011, 190-199. Web SearchBibTeXDownload
326Approximability of Symmetric Bimatrix Games and Related Experiments. Spyros C. Kontogiannis, Paul G. Spirakis. SEA 2011, 1-20. Web SearchBibTeXDownload
325The Computational Power of Simple Protocols for Self-awareness on Graphs. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis. SSS 2011, 135-147. Web SearchBibTeXDownload
324On the independence number and Hamiltonicity of uniform random intersection graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Theor. Comput. Sci. (412): 6750-6760 (2011). Web SearchBibTeXDownload
323Mediated population protocols. Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis. Theor. Comput. Sci. (412): 2434-2450 (2011). Web SearchBibTeXDownload
322Communication and security in random intersection graphs models. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. WOWMOM 2011, 1-6. Web SearchBibTeXDownload
2010
321Well Supported Approximate Equilibria in Bimatrix Games. Spyros C. Kontogiannis, Paul G. Spirakis. Algorithmica (57): 653-667 (2010). Web SearchBibTeXDownload
320Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses. Spyros C. Kontogiannis, Paul G. Spirakis. APPROX-RANDOM 2010, 312-325. Web SearchBibTeXDownload
319The "Hot Potato" Case: Challenges in Multiplayer Pervasive Games Based on Ad hoc Mobile Sensor Networks and the Experimental Evaluation of a Prototype Game. Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis. CoRR (abs/1002.1099) (2010). Web SearchBibTeXDownload
318Passively Mobile Communicating Logarithmic Space Machines. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis. CoRR (abs/1004.3395) (2010). Web SearchBibTeXDownload
317Passively Mobile Communicating Machines that Use Restricted Space. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis. CoRR (abs/1012.2440) (2010). Web SearchBibTeXDownload
316Information security for sensors by overwhelming random sequences and permutations. Shlomi Dolev, Niv Gilboa, Marina Kopeetsky, Giuseppe Persiano, Paul G. Spirakis. DIALM-PODC 2010, 43-48. Web SearchBibTeXDownload
315Fun with Games. Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou. FUN 2010, 4-15. Web SearchBibTeXDownload
314All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis. MFCS 2010, 270-281. Web SearchBibTeXDownload
313Distributed Game-Theoretic Vertex Coloring. Ioannis Chatzigiannakis, Christos Koninis, Panagiota N. Panagopoulou, Paul G. Spirakis. OPODIS 2010, 103-118. Web SearchBibTeXDownload
312Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games. Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis. SPAA 2010, 76-78. Web SearchBibTeXDownload
311Algorithmic Verification of Population Protocols. Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. SSS 2010, 221-235. Web SearchBibTeXDownload
310Stably Decidable Graph Languages by Mediated Population Protocols. Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. SSS 2010, 252-266. Web SearchBibTeXDownload
309Game authority for robust and scalable distributed selfish-computer systems. Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas. Theor. Comput. Sci. (411): 2459-2466 (2010). Web SearchBibTeXDownload
308Sharp thresholds for Hamiltonicity in random intersection graphs. Charilaos Efthymiou, Paul G. Spirakis. Theor. Comput. Sci. (411): 3714-3730 (2010). Web SearchBibTeXDownload
307Atomic Congestion Games: Fast, Myopic and Concurrent. Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. Theory Comput. Syst. (47): 38-59 (2010). Web SearchBibTeXDownload
306Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra. Haralampos Tsaknakis, Paul G. Spirakis. WINE 2010, 378-390. Web SearchBibTeXDownload
2009
305Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks. Orestis Akribopoulos, Marios Logaras, Nikos Vasilakis, Panagiotis C. Kokkinos, Georgios Mylonas, Ioannis Chatzigiannakis, Paul G. Spirakis. Advances in Computer Entertainment Technology 2009, 453. Web SearchBibTeXDownload
304Developing multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor nets. Orestis Akribopoulos, Marios Logaras, Nikos Vasilakis, Panagiotis C. Kokkinos, Georgios Mylonas, Ioannis Chatzigiannakis, Paul G. Spirakis. Advances in Computer Entertainment Technology 2009, 174-181. Web SearchBibTeXDownload
303Probabilistic Distributed Algorithms for Energy Efficient Routing and Tracking in Wireless Sensor Networks. Sotiris E. Nikoletseas, Paul G. Spirakis. Algorithms (2): 121-157 (2009). Web SearchBibTeXDownload
302Recent Advances in Approximability of Bimatrix Nash. Spyros C. Kontogiannis, Paul G. Spirakis, Haralampos Tsaknakis. Bulletin of the EATCS (98): 60-77 (2009). Web SearchBibTeX
301Preface to special issue on cooperation in selfish systems. David Hales, Bruce Edmonds, Özalp Babaoglu, Paul G. Spirakis. Computational & Mathematical Organization Theory (15): 61-63 (2009). Web SearchBibTeXDownload
300The survival of the weakest in networks. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Computational & Mathematical Organization Theory (15): 127-146 (2009). Web SearchBibTeXDownload
299A glimpse at Christos H. Papadimitriou. Marios Mavronicolas, Paul G. Spirakis. Computer Science Review (3): 55-63 (2009). Web SearchBibTeXDownload
298A note on proofs of existence of Nash equilibria in finite strategic games, of two players. Paul G. Spirakis. Computer Science Review (3): 101-103 (2009). Web SearchBibTeXDownload
297Book review. Walter Kern, Arnald J. Kanning, Kathryn Klingebiel, Lyle Eslinger, Malcolm Brown. Computer Science Review (3): 41-46 (2009). Web SearchBibTeXDownload
296A Graph Spectral Approach for Computing Approximate Nash Equilibria. Haralampos Tsaknakis, Paul G. Spirakis. CoRR (abs/0909.4686) (2009). Web SearchBibTeXDownload
295Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. DISC 2009, 239-240. Web SearchBibTeXDownload
294The Impact of the Web and Political Balance to e-Democracy. Christos Manolopoulos, Rozina Efstathiadou, Paul G. Spirakis. e-Democracy 2009, 13-28. Web SearchBibTeXDownload
293Can Formalism Alone Provide an Answer to the Quest of a Viable Definition of Trust in the WWW Society?. Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou. e-Democracy 2009, 199-208. Web SearchBibTeXDownload
292On the Performance of Approximate Equilibria in Congestion Games. George Christodoulou, Elias Koutsoupias, Paul G. Spirakis. ESA 2009, 251-262. Web SearchBibTeXDownload
291Mediated Population Protocols. Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. ICALP (2) 2009, 363-374. Web SearchBibTeXDownload
290Efficient Methods for Selfish Network Design. Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. ICALP (2) 2009, 459-471. Web SearchBibTeXDownload
289Combinatorial properties for efficient communication in distributed networks with local interactions. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. IPDPS 2009, 1-11. Web SearchBibTeXDownload
288Colouring Non-sparse Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. MFCS 2009, 600-611. Web SearchBibTeXDownload
287Recent Advances in Population Protocols. Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. MFCS 2009, 56-76. Web SearchBibTeXDownload
286Not All Fair Probabilistic Schedulers Are Equivalent. Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis. OPODIS 2009, 33-47. Web SearchBibTeXDownload
285The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Alexis C. Kaporis, Paul G. Spirakis. Theor. Comput. Sci. (410): 745-755 (2009). Web SearchBibTeXDownload
284The structure and complexity of Nash equilibria for a selfish routing game. Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis. Theor. Comput. Sci. (410): 3305-3326 (2009). Web SearchBibTeXDownload
283Computing on a partially eponymous ring. Marios Mavronicolas, Loizos Michael, Paul G. Spirakis. Theor. Comput. Sci. (410): 595-613 (2009). Web SearchBibTeXDownload
282Polynomial algorithms for approximating Nash equilibria of bimatrix games. Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis. Theor. Comput. Sci. (410): 1599-1606 (2009). Web SearchBibTeXDownload
281On the support size of stable strategies in random games. Spyros C. Kontogiannis, Paul G. Spirakis. Theor. Comput. Sci. (410): 933-942 (2009). Web SearchBibTeXDownload
280Expander properties and the cover time of random intersection graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Theor. Comput. Sci. (410): 5261-5272 (2009). Web SearchBibTeXDownload
279The Impact of Social Ignorance on Weighted Congestion Games. Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kaporis, Paul G. Spirakis. WINE 2009, 316-327. Web SearchBibTeXDownload
2008
278Atomic congestion games among coalitions. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
277Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis. Algorithmica (52): 19-43 (2008). Web SearchBibTeXDownload
276A Network Game with Attackers and a Defender. Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis. Algorithmica (51): 315-341 (2008). Web SearchBibTeXDownload
275Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract). Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas. Autonomics 2008, 37. Web SearchBibTeXDownload
274A probabilistic key agreement scheme for sensor networks without key predistribution. Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou. CoRR (abs/0806.1812) (2008). Web SearchBibTeXDownload
273Efficient Scheduling of DAGs and Sets of Chains on a Simple Asymmetric Multicore Model. Ioannis Chatzigiannakis, Georgios Giannoulis, Paul G. Spirakis. CoRR (abs/0804.4039) (2008). Web SearchBibTeXDownload
272On the performance of approximate equilibria in congestion games. George Christodoulou, Elias Koutsoupias, Paul G. Spirakis. CoRR (abs/0804.3160) (2008). Web SearchBibTeXDownload
271The Dynamics of Probabilistic Population Protocols. Ioannis Chatzigiannakis, Paul G. Spirakis. DISC 2008, 498-499. Web SearchBibTeXDownload
270A Security Model for Internet-Based Digital Asset Management Systems. Ioannis Chatzigiannakis, Vasiliki Liagkou, D. Salouros, Paul G. Spirakis. ECSA 2008, 326-329. Web SearchBibTeXDownload
269Independent Sets in Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
268Hamilton Cycles in Random Intersection Graphs. Charilaos Efthymiou, Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
267Stackelberg Games: The Price of Optimum. Alexis C. Kaporis, Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
266Minimum Congestion Redundant Assignments. Dimitris Fotakis, Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
265Approximations of Bimatrix Nash Equilibria. Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
264Best Response Algorithms for Selfish Routing. Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
263Weighted Random Sampling. Pavlos Efraimidis, Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
262Selfish Unsplittable Flows: Algorithms for Pure Equilibria. Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
261Tail Bounds for Occupancy Problems. Paul G. Spirakis. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
260A step-wise refinement approach for enhancing e-voting acceptance. Christos Manolopoulos, Dimitris Sofotassios, Polyxeni Nakou, Yannis C. Stamatiou, Anastasia Panagiotaki, Paul G. Spirakis. ICEGOV 2008, 275-280. Web SearchBibTeXDownload
259A graph-theoretic network security game. Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. IJAACS (1): 390-410 (2008). Web SearchBibTeXDownload
258Cost-Balancing Tolls for Atomic Network Congestion Games. Dimitris Fotakis, Paul G. Spirakis. Internet Mathematics (5): 343-363 (2008). Web SearchBibTeXDownload
257An Optimization Approach for Approximate Nash Equilibria. Haralampos Tsaknakis, Paul G. Spirakis. Internet Mathematics (5): 365-382 (2008). Web SearchBibTeXDownload
256A Game Theoretic Approach for Efficient Graph Coloring. Panagiota N. Panagopoulou, Paul G. Spirakis. ISAAC 2008, 183-195. Web SearchBibTeXDownload
255Scheduling tasks with dependencies on asymmetric multiprocessors. Ioannis Chatzigiannakis, Georgios Giannoulis, Paul G. Spirakis. PODC 2008, 454. Web SearchBibTeXDownload
254Atomic Congestion Games: Fast, Myopic and Concurrent. Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. SAGT 2008, 121-132. Web SearchBibTeXDownload
253Approximate Equilibria for Strategic Two Person Games. Paul G. Spirakis. SAGT 2008, 5-21. Web SearchBibTeXDownload
252The Dynamics of Adaptive Networked Societies of Tiny Artefacts. Ioannis Chatzigiannakis, Paul G. Spirakis. SASO Workshops 2008, 67-72. Web SearchBibTeXDownload
251Large independent sets in general random intersection graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. Theor. Comput. Sci. (406): 215-224 (2008). Cited by 2Web SearchBibTeXDownload
250Efficient sensor network design for continuous monitoring of moving objects. Sotiris E. Nikoletseas, Paul G. Spirakis. Theor. Comput. Sci. (402): 56-66 (2008). Cited by 4Web SearchBibTeXDownload
249Random sampling of colourings of sparse random graphs with a constant number of colours. Charilaos Efthymiou, Paul G. Spirakis. Theor. Comput. Sci. (407): 134-154 (2008). Web SearchBibTeXDownload
248Optimal Algorithms for Detecting Network Stability. Dimitrios Koukopoulos, Stavros D. Nikolopoulos, Leonidas Palios, Paul G. Spirakis. WALCOM 2008, 188-199. Web SearchBibTeXDownload
247Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. Dimitris Kalles, Alexis C. Kaporis, Paul G. Spirakis. WEA 2008, 181-193. Web SearchBibTeXDownload
246Equilibrium Points in Fear of Correlated Threats. Spyros C. Kontogiannis, Paul G. Spirakis. WINE 2008, 210-221. Web SearchBibTeXDownload
245Performance Evaluation of a Descent Algorithm for Bi-matrix Games. Haralampos Tsaknakis, Paul G. Spirakis, Dimitrios Kanoulas. WINE 2008, 222-230. Web SearchBibTeXDownload
2007
244The Price of Selfish Routing. Marios Mavronicolas, Paul G. Spirakis. Algorithmica (48): 91-126 (2007). Web SearchBibTeXDownload
243Efficient Sensor Network Design for Continuous Monitoring of Moving Objects. Sotiris E. Nikoletseas, Paul G. Spirakis. ALGOSENSORS 2007, 18-31. Web SearchBibTeXDownload
242Trust in global computing systems as a limit property emerging from short range random interactions. Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou. ARES 2007, 741-748. Web SearchBibTeXDownload
241The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. CAI 2007, 236-246. Cited by 1Web SearchBibTeXDownload
240A Trust-Centered Approach for Building E-Voting Systems. Athanasios Antoniou, C. Korakas, Christos Manolopoulos, Anastasia Panagiotaki, Dimitris Sofotassios, Paul G. Spirakis, Yannis C. Stamatiou. EGOV 2007, 366-377. Web SearchBibTeXDownload
239Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks. Ioannis Chatzigiannakis, Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis. Electr. Notes Theor. Comput. Sci. (171): 17-31 (2007). Web SearchBibTeXDownload
238Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time.. Paul G. Spirakis, Haralampos Tsaknakis. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload
237Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games. Spyros C. Kontogiannis, Paul G. Spirakis. ICALP 2007, 595-606. Web SearchBibTeXDownload
236Performance and stability bounds for dynamic networks. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. J. Parallel Distrib. Comput. (67): 386-399 (2007). Web SearchBibTeXDownload
235Selfish Load Balancing Under Partial Knowledge. Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis. MFCS 2007, 609-620. Web SearchBibTeXDownload
234Expander Properties and the Cover Time of Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. MFCS 2007, 44-55. Cited by 3Web SearchBibTeXDownload
233Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach. Spyros C. Kontogiannis, Paul G. Spirakis. MFCS 2007, 596-608. Web SearchBibTeXDownload
232Game authority for robust andscalable distributed selfish-computer systems. Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas. PODC 2007, 356-357. Web SearchBibTeXDownload
231On the Support Size of Stable Strategies in Random Games. Spyros C. Kontogiannis, Paul G. Spirakis. SAGA 2007, 154-165. Web SearchBibTeXDownload
230Probabilistic Techniques in Algorithmic Game Theory. Spyros C. Kontogiannis, Paul G. Spirakis. SAGA 2007, 30-53. Web SearchBibTeXDownload
229The increase of the instability of networks due to Quasi-Static link capacities. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. Theor. Comput. Sci. (381): 44-56 (2007). Web SearchBibTeXDownload
228Full and Local Information in Distributed Decision Making. Panagiota N. Panagopoulou, Paul G. Spirakis. WAOA 2007, 156-169. Web SearchBibTeXDownload
227An Optimization Approach for Approximate Nash Equilibria. Haralampos Tsaknakis, Paul G. Spirakis. WINE 2007, 42-56. Web SearchBibTeXDownload
226Cost-Balancing Tolls for Atomic Network Congestion Games. Dimitris Fotakis, Paul G. Spirakis. WINE 2007, 179-190. Web SearchBibTeXDownload
225Agent-based Distributed Group Key Establishment in Wireless Sensor Networks. Ioannis Chatzigiannakis, Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis. WOWMOM 2007, 1-6. Web SearchBibTeXDownload
2006
224Algorithms for pure Nash equilibria in weighted congestion games. Panagiota N. Panagopoulou, Paul G. Spirakis. ACM Journal of Experimental Algorithmics (11) (2006). Web SearchBibTeXDownload
223A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks. Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis. Ad Hoc Networks (4): 621-635 (2006). Cited by 4Web SearchBibTeXDownload
222Direct Routing: Algorithms and Complexity. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis. Algorithmica (45): 45-68 (2006). Web SearchBibTeXDownload
221The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks. Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou. ALGOSENSORS 2006, 130-139. Web SearchBibTeXDownload
220Eight Open Problems in Distributed Computing. James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer. Bulletin of the EATCS (90): 109-126 (2006). Web SearchBibTeX
219The infection time of graphs. Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis. Discrete Applied Mathematics (154): 2577-2589 (2006). Cited by 4Web SearchBibTeXDownload
218Atomic Congestion Games Among Coalitions. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. ICALP (1) 2006, 572-583. Web SearchBibTeXDownload
217The Price of Defense and Fractional Matchings. Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis. ICDCN 2006, 115-126. Web SearchBibTeXDownload
216The Power of the Defender. Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. ICDCS Workshops 2006, 37. Web SearchBibTeXDownload
215Weighted random sampling with a reservoir. Pavlos Efraimidis, Paul G. Spirakis. Inf. Process. Lett. (97): 181-185 (2006). Web SearchBibTeXDownload
214Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. J. Discrete Algorithms (4): 433-454 (2006). Web SearchBibTeXDownload
213The Price of Defense. Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. MFCS 2006, 717-728. Web SearchBibTeXDownload
212Computing on a Partially Eponymous Ring. Marios Mavronicolas, Loizos Michael, Paul G. Spirakis. OPODIS 2006, 380-394. Web SearchBibTeXDownload
211The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Alexis C. Kaporis, Paul G. Spirakis. SPAA 2006, 19-28. Web SearchBibTeXDownload
210Approximation schemes for scheduling and covering on unrelated machines. Pavlos Efraimidis, Paul G. Spirakis. Theor. Comput. Sci. (359): 400-417 (2006). Web SearchBibTeXDownload
209The Survival of the Weakest in Networks. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. WAOA 2006, 316-329. Cited by 1Web SearchBibTeXDownload
208Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis. WINE 2006, 286-296. Web SearchBibTeXDownload
2005
207Cost Sharing Mechanisms for Fair Pricing of Resources Usage. Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis. Algorithmic Aspects of Large and Complex Networks 2005. Web SearchBibTeXDownload
206An Application of the Monotone Linearizability Lemma. Costas Busch, Marios Mavronicolas, Paul G. Spirakis. Bulletin of the EATCS (85): 70-80 (2005). Web SearchBibTeX
205The Price of Optimum in Stackelberg Games. Alexis C. Kaporis, Efpraxia Politopoulou, Paul G. Spirakis. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
204On the Existence of Hamiltonian Cycles in Random Intersection Graphs. Charilaos Efthymiou, Paul G. Spirakis. ICALP 2005, 690-701. Web SearchBibTeXDownload
203Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. Christoforos Raptopoulos, Paul G. Spirakis. ISAAC 2005, 493-504. Web SearchBibTeXDownload
202Counting Stable Strategies in Random Evolutionary Games. Spyros C. Kontogiannis, Paul G. Spirakis. ISAAC 2005, 839-848. Web SearchBibTeXDownload
201Network Game with Attacker and Protector Entities. Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. ISAAC 2005, 288-297. Web SearchBibTeXDownload
200"Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience. Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung. ISC 2005, 44-58. Web SearchBibTeXDownload
199Max-min Fair Flow Control Sensitive to Priorities. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis. Journal of Interconnection Networks (6): 85-114 (2005). Web SearchBibTeXDownload
198Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. MONET (10): 133-149 (2005). Cited by 29Web SearchBibTeXDownload
197The Contribution of Game Theory to Complex Systems. Spyros C. Kontogiannis, Paul G. Spirakis. Panhellenic Conference on Informatics 2005, 101-111. Web SearchBibTeXDownload
196Evolutionary Games: An Algorithmic View. Spyros C. Kontogiannis, Paul G. Spirakis. Self-star Properties in Complex Information Systems 2005, 97-111. Web SearchBibTeXDownload
195Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis. SIAM J. Comput. (34): 1216-1252 (2005). Web SearchBibTeXDownload
194Structure and complexity of extreme Nash equilibria. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis. Theor. Comput. Sci. (343): 133-157 (2005). Web SearchBibTeXDownload
193Selfish unsplittable flows. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. Theor. Comput. Sci. (348): 226-239 (2005). Web SearchBibTeXDownload
192The cost of concurrent, low-contention Read&Modify&Write. Costas Busch, Marios Mavronicolas, Paul G. Spirakis. Theor. Comput. Sci. (333): 373-400 (2005). Web SearchBibTeXDownload
191Radiocoloring in planar graphs: Complexity and approximations. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. Theor. Comput. Sci. (340): 514-538 (2005). Cited by 5Web SearchBibTeXDownload
190The chromatic and clique numbers of random scaled sector graphs. Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis. Theor. Comput. Sci. (349): 40-51 (2005). Web SearchBibTeXDownload
189Space Efficient Hash Tables with Worst Case Constant Access Time. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis. Theory Comput. Syst. (38): 229-248 (2005). Web SearchBibTeXDownload
188The Impact of Network Structure on the Stability of Greedy Protocols. Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. Theory Comput. Syst. (38): 425-460 (2005). Cited by 18Web SearchBibTeXDownload
187Keynote Talk Summary: Algorithmic Aspects of Sensor Networks. Paul G. Spirakis. WAC 2005, 277-277. Web SearchBibTeXDownload
186Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. WAOA 2005, 161-175. Web SearchBibTeXDownload
185Experimental Results for Stackelberg Scheduling Strategies. Alexis C. Kaporis, Lefteris M. Kirousis, E. I. Politopoulou, Paul G. Spirakis. WEA 2005, 77-88. Web SearchBibTeXDownload
184Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games. Panagiota N. Panagopoulou, Paul G. Spirakis. WEA 2005, 203-215. Web SearchBibTeXDownload
183Generating and Radiocoloring Families of Perfect Graphs. Maria I. Andreou, Vicky G. Papadopoulou, Paul G. Spirakis, B. Theodorides, Andreas Xeros. WEA 2005, 302-314. Web SearchBibTeXDownload
182A Cost Mechanism for Fair Pricing of Resource Usage. Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis. WINE 2005, 210-224. Web SearchBibTeXDownload
181A Graph-Theoretic Network Security Game. Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. WINE 2005, 969-978. Web SearchBibTeXDownload
180Atomic Selfish Routing in Networks: A Survey. Spyros C. Kontogiannis, Paul G. Spirakis. WINE 2005, 989-1002. Web SearchBibTeXDownload
2004
179Analysis of the Information Propagation Time Among Mobile Hosts. Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. Spirakis. ADHOC-NOW 2004, 122-134. Cited by 2Web SearchBibTeXDownload
178Algorithmic and Foundational Aspects of Sensor Systems: (Invited Talk). Paul G. Spirakis. ALGOSENSORS 2004, 3-8. Web SearchBibTeXDownload
177The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing). Sotiris E. Nikoletseas, Paul G. Spirakis. Bulletin of the EATCS (82): 126-169 (2004). Web SearchBibTeX
176Direct Routing: Algorithms and Complexity. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis. ESA 2004, 134-145. Web SearchBibTeXDownload
175Electronic National Lotteries. Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung. Financial Cryptography 2004, 147-163. Web SearchBibTeXDownload
174Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks. Sotiris E. Nikoletseas, Paul G. Spirakis. Global Computing 2004, 127-145. Web SearchBibTeXDownload
173The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. ICALP 2004, 1029-1040. Cited by 15Web SearchBibTeXDownload
172Selfish Unsplittable Flows. Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. ICALP 2004, 593-605. Web SearchBibTeXDownload
171Performance and Stability Bounds for Dynamic Networks. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. ISPAN 2004, 239-246. Web SearchBibTeXDownload
170A hierarchical adaptive distributed algorithm for load balancing. Konstantinos Antonis, John D. Garofalakis, Ioannis Mourtos, Paul G. Spirakis. J. Parallel Distrib. Comput. (64): 151-162 (2004). Web SearchBibTeXDownload
169SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks. Tassos Dimitriou, Ioannis Krontiris, Fotios Nikakis, Paul G. Spirakis. NETWORKING 2004, 1300-1305. Web SearchBibTeXDownload
168How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. Tassos Dimitriou, Paul G. Spirakis. WEA 2004, 199-212. Web SearchBibTeXDownload
2003
167The Impact of Network Structure on the Stability of Greedy Protocols. Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. CIAC 2003, 251-263. Cited by 18Web SearchBibTeXDownload
166Competitive Video on Demand Schedulers for Popular Movies. Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis. Discrete Applied Mathematics (129): 49-61 (2003). Web SearchBibTeXDownload
165FIFO is Unstable at Arbitrarily Low Rates. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. Electronic Colloquium on Computational Complexity (ECCC) (10) (2003). Web SearchBibTeXDownload
164A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. Euro-Par 2003, 1003-1016. Web SearchBibTeXDownload
163Extreme Nash Equilibria. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis. ICTCS 2003, 1-20. Web SearchBibTeXDownload
162Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks. B. Marmalis, Paul G. Spirakis, Basil Tampakas. I. J. Comput. Appl. (10): 51-66 (2003). Web SearchBibTeX
161Distributed communication algorithms for ad hoc mobile networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. J. Parallel Distrib. Comput. (63): 58-74 (2003). Cited by 34Web SearchBibTeXDownload
160Which Is the Worst-Case Nash Equilibrium?. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto. MFCS 2003, 551-561. Cited by 47Web SearchBibTeXDownload
159A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. Parallel Processing Letters (13): 615-627 (2003). Cited by 42Web SearchBibTeXDownload
158NanoPeer Networks and P2P Worlds. Peter Triantafillou, Nikos Ntarmos, Sotiris E. Nikoletseas, Paul G. Spirakis. Peer-to-Peer Computing 2003, 40-46. Cited by 10Web SearchBibTeXDownload
157Instability of Networks with Quasi-Static Link Capacities. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. SIROCCO 2003, 179-194. Web SearchBibTeX
156The Cost of Concurrent, Low-Contention Read-Modify-Write. Costas Busch, Marios Mavronicolas, Paul G. Spirakis. SIROCCO 2003, 57-72. Web SearchBibTeX
155Space Efficient Hash Tables with Worst Case Constant Access Time. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis. STACS 2003, 271-282. Web SearchBibTeXDownload
154An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. Hermann Jung, Maria J. Serna, Paul G. Spirakis. Theor. Comput. Sci. (292): 639-652 (2003). Web SearchBibTeXDownload
153Attack Propagation in Networks. Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis. Theory Comput. Syst. (36): 553-574 (2003). Cited by 12Web SearchBibTeXDownload
152Approximate Equilibria and Ball Fusion. Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis. Theory Comput. Syst. (36): 683-693 (2003). Web SearchBibTeXDownload
151Algorithms and Experiments on Colouring Squares of Planar Graphs. Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis. WEA 2003, 15-32. Cited by 12Web SearchBibTeXDownload
2002
150Minimum Congestion Redundant Assignments to Tolerate Random Faults. Dimitris Fotakis, Paul G. Spirakis. Algorithmica (32): 396-422 (2002). Web SearchBibTeXDownload
149Distributed Communication Algorithms. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. Bulletin of the EATCS (78): 133-162 (2002). Cited by 19Web SearchBibTeX
148On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. DISC 2002, 88-102. Cited by 22Web SearchBibTeXDownload
147Mobile Computing, Mobile Networks. Friedhelm Meyer auf der Heide, Mohan Kumar, Sotiris E. Nikoletseas, Paul G. Spirakis. Euro-Par 2002, 933-934. Web SearchBibTeXDownload
146The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis. ICALP 2002, 123-134. Web SearchBibTeXDownload
145On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. Maria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. MFCS 2002, 81-92. Cited by 1Web SearchBibTeXDownload
144STEPS: Supporting Traditional Education Procedures-A TCP/IP Multimedia Networks-Based Model. Christos Bouras, Petros Lampsas, Paul G. Spirakis. Multimedia Tools Appl. (16): 251-276 (2002). Web SearchBibTeXDownload
143Smart dust protocols for local detection and propagation. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. POMC 2002, 9-16. Cited by 56Web SearchBibTeXDownload
142Approximate Equilibria and Ball Fusion. Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis. SIROCCO 2002, 223-235. Web SearchBibTeX
141On the robustness of interconnections in random graphs: a symbolic approach. Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis. Theor. Comput. Sci. (287): 515-534 (2002). Cited by 11Web SearchBibTeXDownload
140Competitive Call Control in Mobile Networks. Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis. Theory Comput. Syst. (35): 625-639 (2002). Web SearchBibTeXDownload
139Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. WG 2002, 223-234. Web SearchBibTeXDownload
2001
138An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Nearchos Paspallis, Paul G. Spirakis, Christos D. Zaroliagis. Algorithm Engineering 2001, 159-171. Cited by 37Web SearchBibTeXDownload
137Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. Bulletin of the EATCS (75): 152-181 (2001). Web SearchBibTeX
136Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. Computers and Artificial Intelligence (20) (2001). Cited by 7Web SearchBibTeX
135An Efficient Communication Strategy for Ad-hoc Mobile Networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. DISC 2001, 285-299. Web SearchBibTeXDownload
134The Range of Stability for Heterogeneous and FIFO Queueing Networks. Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis. Electronic Colloquium on Computational Complexity (ECCC) 2001. Cited by 11Web SearchBibTeXDownload
133Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis. HiPC 2001, 3-16. Cited by 16Web SearchBibTeXDownload
132An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. IPDPS 2001, 185. Cited by 9Web SearchBibTeX
131Stability Behavior of FIFO Protocol in the Adversarial Queuing Model. Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis. Panhellenic Conference on Informatics 2001, 464-479. Cited by 3Web SearchBibTeXDownload
130An efficient communication strategy for ad-hoc mobile networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. PODC 2001, 320-322. Cited by 54Web SearchBibTeXDownload
129Stability and non-stability of the FIFO protocol. Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos. SPAA 2001, 48-52. Cited by 43Web SearchBibTeXDownload
128Attack propagation in networks. Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis. SPAA 2001, 67-76. Web SearchBibTeXDownload
127The price of selfish routing. Marios Mavronicolas, Paul G. Spirakis. STOC 2001, 510-519. Web SearchBibTeXDownload
2000
126Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. Algorithm Engineering 2000, 99-110. Cited by 11Web SearchBibTeXDownload
125Efficient Communication Establishment in Extremely Unreliable Large Networks. Sotiris E. Nikoletseas, Paul G. Spirakis. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload
124Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines. Pavlos Efraimidis, Paul G. Spirakis. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload
123Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note). Pavlos Efraimidis, Paul G. Spirakis. Euro-Par 2000, 456-460. Web SearchBibTeXDownload
122Distributed Algorithm Engineering. Paul G. Spirakis, Christos D. Zaroliagis. Experimental Algorithmics 2000, 197-228. Web SearchBibTeXDownload
121Efficient Communication Establishment in Adverse Communication Environments. Sotiris E. Nikoletseas, Paul G. Spirakis. ICALP Satellite Workshops 2000, 215-226. Cited by 9Web SearchBibTeX
120Trade-Offs between Density and Robustness in Random Interconnection Graphs. Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis. IFIP TCS 2000, 152-168. Cited by 8Web SearchBibTeXDownload
119Connectivity Properties in Random Regular Graphs with Edge Faults. Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung. Int. J. Found. Comput. Sci. (11): 247-262 (2000). Cited by 14Web SearchBibTeXDownload
118NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. MFCS 2000, 363-372. Cited by 44Web SearchBibTeXDownload
117Robust Parallel Computations through Randomization. Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung. Theory Comput. Syst. (33): 427-464 (2000). Web SearchBibTeXDownload
116Efficient Scheduling of Strict Multithreaded Computations. Panagiota Fatourou, Paul G. Spirakis. Theory Comput. Syst. (33): 173-232 (2000). Web SearchBibTeXDownload
1999
115Counting in Mobile Networks: Theory and Experimentation. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Basil Tampakas. Algorithm Engineering 1999, 95-109. Web SearchBibTeXDownload
114Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura. Algorithm Engineering 1999, 124-138. Web SearchBibTeXDownload
113BSP versus LogP. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis. Algorithmica (24): 405-422 (1999). Web SearchBibTeXDownload
112A New Scheduling Algorithm for General Strict Multithreaded Computations. Panagiota Fatourou, Paul G. Spirakis. DISC 1999, 297-311. Web SearchBibTeXDownload
111Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks. B. Marmalis, Paul G. Spirakis, Basil Tampakas. Euro-Par 1999, 482-486. Web SearchBibTeXDownload
110Optimal, Distributed Decision-Making: The Case of No Communication. Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis. FCT 1999, 293-303. Web SearchBibTeXDownload
109Optimal, Distributed Decision-Making: The Case of no Communication. Marios Mavronicolas, Paul G. Spirakis. PODC 1999, 279. Web SearchBibTeXDownload
108Fundamental Distributed Protocols in Mobile Networks. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan. PODC 1999, 274. Web SearchBibTeXDownload
107Efficient Redundant Assignments under Fault-Tolerance Constraints. Dimitris Fotakis, Paul G. Spirakis. RANDOM-APPROX 1999, 156-167. Web SearchBibTeX
106Fundamental Control Algorithms in Mobile Networks. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan. SPAA 1999, 251-260. Web SearchBibTeXDownload
105Optimal High-Performance Parallel Text Retrieval via Fat-Trees. Basilis Mamalis, Paul G. Spirakis, Basil Tampakas. Theory Comput. Syst. (32): 591-623 (1999). Web SearchBibTeXDownload
1998
104Implementation and Testing Eavesdropper Protocols Using the DSP Tool. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas. Algorithm Engineering 1998, 74-85. Web SearchBibTeX
103Random Walks, Conditional Hitting Sets and Partial Derandomization. Dimitris Fotakis, Paul G. Spirakis. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Web SearchBibTeXDownload
102A Competitive Symmetrical Transfer Policy for Load Sharing. Konstantinos Antonis, John D. Garofalakis, Paul G. Spirakis. Euro-Par 1998, 352-355. Web SearchBibTeXDownload
101A Hamiltonian Approach to the Assignment of Non-reusable Frequencies. Dimitris Fotakis, Paul G. Spirakis. FSTTCS 1998, 18-29. Web SearchBibTeXDownload
100MaxMin Fair Flow Control Sensitive to Priorities. Pimitris Fatourou, Marios Mavronicolas, Paul G. Spirakis. OPODIS 1998, 45-60. Web SearchBibTeX
99An Analytical Performance Model for Multistage Interconnection Networks with Finite, Infinite and Zero Length Buffers. Christos Bouras, John D. Garofalakis, Paul G. Spirakis, Vassilis Triantafillou. Perform. Eval. (34): 169-182 (1998). Web SearchBibTeXDownload
98The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis. SIROCCO 1998, 244-258. Web SearchBibTeXDownload
97``Dynamic-Fault-Prone BSP'': A Paradigm for Robust Computations in Changing Environments. Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung. SPAA 1998, 37-46. Web SearchBibTeXDownload
96On the Random Generation and Counting of Matchings in Dense Graphs. Josep Díaz, Maria J. Serna, Paul G. Spirakis. Theor. Comput. Sci. (201): 281-290 (1998). Web SearchBibTeXDownload
1997
95An Object-Oriented Data Model for the Intelligent Support of Three-Dimensional Objects. Aikaterini Krotopoulou, Paul G. Spirakis, Dimitra Terpou, Athanasios K. Tsakalidis. DEXA Workshop 1997, 358-363. Web SearchBibTeX
94On the Fault Tolerance of Fat-Trees. Sotiris E. Nikoletseas, Grammati E. Pantziou, Panagiotis Psycharis, Paul G. Spirakis. Euro-Par 1997, 208-217. Cited by 2Web SearchBibTeXDownload
93A General Performance Model for Multistage Interconnection Networks. Christos Bouras, John D. Garofalakis, Paul G. Spirakis, Vassilis Triantafillou. Euro-Par 1997, 993-1000. Web SearchBibTeXDownload
92Competitive Call Control in Mobile Networks. Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis. ISAAC 1997, 404-413. Web SearchBibTeXDownload
91Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations. Paul G. Spirakis, Vassilis Triantafillou. Parallel Processing Letters (7): 249-258 (1997). Web SearchBibTeXDownload
90Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis. PODC 1997, 139-148. Web SearchBibTeXDownload
89Advances in Rate-Based Flow Control. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis. SIROCCO 1997, 266-281. Web SearchBibTeX
88Efficient Computations on Fault-Prone BSP Machines. Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis. SPAA 1997, 84-93. Web SearchBibTeXDownload
87Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán. Theor. Comput. Sci. (181): 267-287 (1997). Web SearchBibTeXDownload
86Editor's Foreword. Fan Chung Graham, Michael A. Palis, David S. L. Wei. Theory Comput. Syst. (30): 1 (1997). Web SearchBibTeXDownload
85Enabling Distance Education over the World Wide Web. I. Antoniou, Christos Bouras, Petros Lampsas, Paul G. Spirakis. WebNet 1997. Web SearchBibTeX
1996
84Wormhole Versus Deflection Routing: A Case Study on the Mesh. Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou. COCOON 1996, 31-40. Web SearchBibTeXDownload
83Attack Modelling in Open Network Environments. Sokratis K. Katsikas, Dimitris Gritzalis, Paul G. Spirakis. Communications and Multimedia Security 1996, 268-277. Web SearchBibTeX
82On-Demand Hypermedia/Multimedia Service over Broadband Networks. Christos Bouras, Vaggelis Kapoulas, D. Miras, Vaggelis Ouzounis, Paul G. Spirakis, A. Tatakis. HPDC 1996, 224. Web SearchBibTeXDownload
81Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas. Inf. Process. Lett. (58): 47-53 (1996). Web SearchBibTeXDownload
80Scheduling Algorithms for Strict Multithreaded Computations. Panagiota Fatourou, Paul G. Spirakis. ISAAC 1996, 407-416. Web SearchBibTeXDownload
79(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP. Dimitris Fotakis, Paul G. Spirakis. MFCS 1996, 360-371. Web SearchBibTeXDownload
78Performance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks. Christos Bouras, Paul G. Spirakis. Perform. Eval. (25): 105-130 (1996). Web SearchBibTeXDownload
77Randomized Adaptive Video on Demand (Abstract). Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis. PODC 1996, 179. Web SearchBibTeXDownload
76BSP vs LogP. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis. SPAA 1996, 25-32. Web SearchBibTeX
75Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. Theor. Comput. Sci. (168): 121-154 (1996). Web SearchBibTeXDownload
74Parallel Techniques For Efficient Searching Over Very Large Text Collections. Basilis Mamalis, Paul G. Spirakis, Basil Tampakas. TREC 1996. Web SearchBibTeXDownload
1995
73Efficient Parallel Algorithms for some Tree Layout Problems. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán. COCOON 1995, 313-323. Web SearchBibTeXDownload
72Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung. ICALP 1995, 159-170. Cited by 12Web SearchBibTeXDownload
71Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung. ICALP 1995, 159-170. Web SearchBibTeXDownload
70Randomized Competitive Algorithms for Admission Control in General Networks (Abstract). Vaggelis Kapoulas, Paul G. Spirakis. PODC 1995, 253. Web SearchBibTeXDownload
69Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. Anil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis. Random Struct. Algorithms (7): 59-80 (1995). Cited by 154Web SearchBibTeXDownload
68Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model. Pavlos Efraimidis, Christos Glymidakis, Basilis Mamalis, Paul G. Spirakis, Basil Tampakas. SIGIR 1995, 58-66. Web SearchBibTeXDownload
67Wormhole Routing Simulation on a Mesh. Efstratios Karaivazoglou, Paul G. Spirakis, Vasilis Triantafilou. SIROCCO 1995, 147-158. Web SearchBibTeX
66Expander Properties in Random Regular Graphs with Edge Faults. Sotiris E. Nikoletseas, Paul G. Spirakis. STACS 1995, 421-432. Cited by 22Web SearchBibTeXDownload
65The Fourth Moment in Luby's Distribution. Devdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. Theor. Comput. Sci. (148): 133-140 (1995). Web SearchBibTeXDownload
64Distributed Protocols Against Mobile Eavesdroppers. Paul G. Spirakis, Basil Tampakas, H. Antonopoulou. WDAG 1995, 160-167. Web SearchBibTeXDownload
1994
63Intrusion detection: Approach and performance issues of the SECURENET system. Michel Denault, Dimitris Karagiannis, Dimitris Gritzalis, Paul G. Spirakis. Computers & Security (13): 495-508 (1994). Web SearchBibTeXDownload
62A Conceptual DataBase Approach for Modelling 3D Objects of Irregular Geometry. Aikaterini Krotopoulou, Paul G. Spirakis, Dimitra Terpou, Athanasios K. Tsakalidis. DEXA 1994, 290-299. Web SearchBibTeXDownload
61Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture. Anil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis. FOCS 1994, 592-603. Cited by 154Web SearchBibTeXDownload
60Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung. ICALP 1994, 508-519. Cited by 25Web SearchBibTeXDownload
59Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas. IEEE Trans. Parallel Distrib. Syst. (5): 688-696 (1994). Web SearchBibTeXDownload
58Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. ISAAC 1994, 270-278. Web SearchBibTeXDownload
57Surveillance and Protection in IBC Management: The Applicability of Two RACE Security Projects - SecureNet II and SESAME. Dimitris Androutsopoulos, Per Kaijser, Sokratis K. Katsikas, Kåre Presttun, Don Salmon, Paul G. Spirakis. IS&N 1994, 61-72. Web SearchBibTeXDownload
56Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems. Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. MFCS 1994, 462-472. Web SearchBibTeXDownload
55Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing. Paul G. Spirakis, Basil Tampakas. PODC 1994, 403. Web SearchBibTeXDownload
54Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. John D. Garofalakis, Paul G. Spirakis, Basil Tampakas, Basil Tampakas. Theor. Comput. Sci. (128): 63-74 (1994). Web SearchBibTeXDownload
1993
53Brain Data Base (BDB). G. Anogianakis, Aikaterini Krotopoulou, Paul G. Spirakis, Dimitra Terpou, Athanasios K. Tsakalidis. DEXA 1993, 361-364. Web SearchBibTeXDownload
52The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases. Christos Bouras, Paul G. Spirakis. ICCI 1993, 403-407. Web SearchBibTeX
51Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis. Inf. Comput. (105): 94-104 (1993). Web SearchBibTeXDownload
50Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases. Christos Bouras, Paul G. Spirakis. MASCOTS 1993, 243-246. Web SearchBibTeX
49Parallel Complexity of the Connected Subgraph Problem. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis. SIAM J. Comput. (22): 573-586 (1993). Web SearchBibTeXDownload
48Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. Sotiris E. Nikoletseas, Paul G. Spirakis. WG 1993, 1-10. Cited by 9Web SearchBibTeXDownload
1992
47Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. John H. Reif, Paul G. Spirakis. Algorithmica (7): 597-630 (1992). Web SearchBibTeXDownload
46Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. BIT (32): 215-236 (1992). Web SearchBibTeX
45Distributed System Simulator (DSS). Paul G. Spirakis, Basil Tampakas, Marina Papatriantafilou, K. Konstantoulis, K. Vlaxodimitropoulos, V. Antonopoulos, P. Kazazis, T. Metallidou, D. Spartiotis. STACS 1992, 615-616. Web SearchBibTeXDownload
44Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization. John D. Garofalakis, Paul G. Spirakis, Basil Tampakas, Basil Tampakas. WDAG 1992, 110-119. Web SearchBibTeXDownload
1991
43A Parallel Algorithm for Two Processors Precedence Constraint Scheduling. Hermann Jung, Maria J. Serna, Paul G. Spirakis. ICALP 1991, 417-428. Web SearchBibTeXDownload
42Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas. ICCI 1991, 582-587. Web SearchBibTeXDownload
41The Complexity of the Reliable Connectivity Problem. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis. Inf. Process. Lett. (39): 245-252 (1991). Web SearchBibTeXDownload
40The Complexity of The Reliable Connectivity Problem. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis. MFCS 1991, 259-266. Web SearchBibTeXDownload
39Tight RNC Approximations to Max Flow. Maria J. Serna, Paul G. Spirakis. STACS 1991, 118-126. Web SearchBibTeXDownload
38Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract). Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis. STOC 1991, 381-390. Web SearchBibTeXDownload
37Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas. WDAG 1991, 229-241. Web SearchBibTeXDownload
36Fast Parallel Algorithms for Coloring Random Graphs. Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. WG 1991, 135-147. Web SearchBibTeXDownload
1990
35The Performance of Multistage Interconnection Networks with Finite Buffers. John D. Garofalakis, Paul G. Spirakis. SIGMETRICS 1990, 263-264. Web SearchBibTeXDownload
34Efficient Robust Parallel Computations (Extended Abstract). Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis. STOC 1990, 138-148. Web SearchBibTeXDownload
33Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. SWAT 1990, 288-300. Web SearchBibTeXDownload
32Optimal Parallel Algorithms for Sparse Graphs. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. WG 1990, 1-17. Web SearchBibTeXDownload
1989
31The Parallel Complexity of the Subgraph Connectivity Problem. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis. FOCS 1989, 294-299. Web SearchBibTeXDownload
30Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. FSTTCS 1989, 20-29. Web SearchBibTeXDownload
29Efficient Distributed Algorithms by Using The Archimedean Time Assumption. Paul G. Spirakis, Basil Tampakas. ITA (23): 113-128 (1989). Web SearchBibTeX
28The Approximability of Problems Complete for P. Maria J. Serna, Paul G. Spirakis. Optimal Algorithms 1989, 193-204. Web SearchBibTeXDownload
27Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis. SPAA 1989, 254-264. Web SearchBibTeXDownload
26Symmetry Breaking in Asynchronous Rings with O(n) Messages. Paul G. Spirakis, Basil Tampakas, Athanasios Tsiolis. WDAG 1989, 233-241. Web SearchBibTeXDownload
1988
25Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification. Paul G. Spirakis. Inf. Comput. (76): 1-12 (1988). Web SearchBibTeXDownload
24Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances). Paul G. Spirakis. Parcella 1988, 177-189. Web SearchBibTeXDownload
23Approximate Queueing Models for the Load Balancing Problem. John D. Garofalakis, Paul G. Spirakis. SIGMETRICS 1988, 277. Web SearchBibTeX
22Efficient Distributed Algorithms by Using the Archemedean Time Assumption. Paul G. Spirakis, Basil Tampakas. STACS 1988, 248-263. Web SearchBibTeXDownload
21Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. Lefteris M. Kirousis, Paul G. Spirakis. SWAT 1988, 163-175. Web SearchBibTeXDownload
1987
20Fast Parallel Algorithms for Processing of Joins. Dennis Shasha, Paul G. Spirakis. ICS 1987, 939-953. Web SearchBibTeXDownload
19Queueing Delays in Buffered Multistage Interconnection Networks. Christos Bouras, John D. Garofalakis, Paul G. Spirakis, Vassilis Triantafillou. SIGMETRICS 1987, 111-121. Web SearchBibTeXDownload
18The Parallel Complexity of Deadlock Detection. Paul G. Spirakis. Theor. Comput. Sci. (52): 155-163 (1987). Web SearchBibTeXDownload
1986
17A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. Paul G. Spirakis, Athanasios K. Tsakalidis. ICALP 1986, 397-406. Web SearchBibTeXDownload
16The Logical "First Mile-Last Mile" Digital Termination Systems (Abstract only). Paul G. Spirakis. ICC 1986, 1763. Web SearchBibTeX
15The Parallel Complexity of Deadlock Detection. Paul G. Spirakis. MFCS 1986, 582-593. Web SearchBibTeXDownload
14Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. Paul G. Spirakis. STACS 1986, 73-86. Web SearchBibTeXDownload
13The Diameter of Connected Components of Random Graphs. Paul G. Spirakis. WG 1986, 264-276. Web SearchBibTeXDownload
1985
12k-connectivity in random undirected graphs. John H. Reif, Paul G. Spirakis. Discrete Mathematics (54): 181-191 (1985). Web SearchBibTeXDownload
11A Semantic Approach to Correctness of Concurrent Transaction Executions. Alexander Tuzhilin, Paul G. Spirakis. PODS 1985, 85-95. Web SearchBibTeXDownload
10Unbounded Speed Variability in Distributed Communications Systems. John H. Reif, Paul G. Spirakis. SIAM J. Comput. (14): 75-92 (1985). Web SearchBibTeXDownload
9The Volume of the Union of Many Sheres and Point Inclusion Problems. Paul G. Spirakis. STACS 1985, 328-338. Web SearchBibTeXDownload
1984
8Real-Time Synchronization of Interprocess Communications. John H. Reif, Paul G. Spirakis. ACM Trans. Program. Lang. Syst. (6): 215-238 (1984). Web SearchBibTeXDownload
7Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications. Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis. FOCS 1984, 241-250. Web SearchBibTeXDownload
6Probabilistic Bidding Gives Optimal Distributed Resource Allocation. John H. Reif, Paul G. Spirakis. ICALP 1984, 391-402. Web SearchBibTeXDownload
5Strong NP-Hardness of Moving Many Discs. Paul G. Spirakis, Chee-Keng Yap. Inf. Process. Lett. (19): 55-59 (1984). Web SearchBibTeXDownload
1982
4Real Time Resource Allocation in Distributed Systems. John H. Reif, Paul G. Spirakis. PODC 1982, 84-94. Web SearchBibTeXDownload
3Unbounded Speed Variability in Distributed Communication Systems. John H. Reif, Paul G. Spirakis. POPL 1982, 46-56. Web SearchBibTeXDownload
1981
2Distributed Algorithms for Synchronizing Interprocess Communication within Real Time. John H. Reif, Paul G. Spirakis. STOC 1981, 133-145. Web SearchBibTeXDownload
1980
1Random Matroids. John H. Reif, Paul G. Spirakis. STOC 1980, 385-397. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research