 | 2009 |
|---|
| 307 |       | Ioannis Chatzigiannakis,
Othon Michail,
Paul G. Spirakis:
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols.
DISC 2009: 239-240 |
| 306 | | George Christodoulou,
Elias Koutsoupias,
Paul G. Spirakis:
On the Performance of Approximate Equilibria in Congestion Games.
ESA 2009: 251-262 |
| 305 | | Ioannis Chatzigiannakis,
Othon Michail,
Paul G. Spirakis:
Mediated Population Protocols.
ICALP (2) 2009: 363-374 |
| 304 | | Dimitris Fotakis,
Alexis C. Kaporis,
Paul G. Spirakis:
Efficient Methods for Selfish Network Design.
ICALP (2) 2009: 459-471 |
| 303 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
Combinatorial properties for efficient communication in distributed networks with local interactions.
IPDPS 2009: 1-11 |
| 302 | | Ioannis Chatzigiannakis,
Othon Michail,
Paul G. Spirakis:
Recent Advances in Population Protocols.
MFCS 2009: 56-76 |
| 301 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
Colouring Non-sparse Random Intersection Graphs.
MFCS 2009: 600-611 |
| 300 | | Haralampos Tsaknakis,
Paul G. Spirakis:
A Graph Spectral Approach for Computing Approximate Nash Equilibria
CoRR abs/0909.4686: (2009) |
| 299 | | Paul G. Spirakis:
Book review.
Computer Science Review 3(1): 41-46 (2009) |
| 298 | | Paul G. Spirakis:
A note on proofs of existence of Nash equilibria in finite strategic games, of two players.
Computer Science Review 3(2): 101-103 (2009) |
| 297 | | Marios Mavronicolas,
Paul G. Spirakis:
A glimpse at Christos H. Papadimitriou.
Computer Science Review 3(2): 55-63 (2009) |
| 296 | | Paul G. Spirakis,
Marios Mavronicolas,
Spyros C. Kontogiannis:
Preface.
Theor. Comput. Sci. 410(17): 1551 (2009) |
| 295 | | Spyros C. Kontogiannis,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Polynomial algorithms for approximating Nash equilibria of bimatrix games.
Theor. Comput. Sci. 410(17): 1599-1606 (2009) |
| 294 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci. 410(36): 3305-3326 (2009) |
| 293 | | Marios Mavronicolas,
Loizos Michael,
Paul G. Spirakis:
Computing on a partially eponymous ring.
Theor. Comput. Sci. 410(6-7): 595-613 (2009) |
| 292 | | Alexis C. Kaporis,
Paul G. Spirakis:
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
Theor. Comput. Sci. 410(8-10): 745-755 (2009) |
| 291 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
On the support size of stable strategies in random games.
Theor. Comput. Sci. 410(8-10): 933-942 (2009) |
| 2008 |
|---|
| 290 | | Shlomi Dolev,
Elad Michael Schiller,
Paul G. Spirakis,
Philippas Tsigas:
Strategies for repeated games with subsystem takeovers: implementable by deterministic and self-stabilizing automata (extended abstract).
Autonomics 2008: 37 |
| 289 | | Ioannis Chatzigiannakis,
Paul G. Spirakis:
The Dynamics of Probabilistic Population Protocols.
DISC 2008: 498-499 |
| 288 | | Ioannis Chatzigiannakis,
Vasiliki Liagkou,
D. Salouros,
Paul G. Spirakis:
A Security Model for Internet-Based Digital Asset Management Systems.
ECSA 2008: 326-329 |
| 287 | | Christos Manolopoulos,
Dimitris Sofotassios,
Polyxeni Nakou,
Yannis C. Stamatiou,
Anastasia Panagiotaki,
Paul G. Spirakis:
A step-wise refinement approach for enhancing e-voting acceptance.
ICEGOV 2008: 275-280 |
| 286 | | Panagiota N. Panagopoulou,
Paul G. Spirakis:
A Game Theoretic Approach for Efficient Graph Coloring.
ISAAC 2008: 183-195 |
| 285 | | Ioannis Chatzigiannakis,
Georgios Giannoulis,
Paul G. Spirakis:
Scheduling tasks with dependencies on asymmetric multiprocessors.
PODC 2008: 454 |
| 284 | | Dimitris Fotakis,
Alexis C. Kaporis,
Paul G. Spirakis:
Atomic Congestion Games: Fast, Myopic and Concurrent.
SAGT 2008: 121-132 |
| 283 | | Paul G. Spirakis:
Approximate Equilibria for Strategic Two Person Games.
SAGT 2008: 5-21 |
| 282 | | Dimitrios Koukopoulos,
Stavros D. Nikolopoulos,
Leonidas Palios,
Paul G. Spirakis:
Optimal Algorithms for Detecting Network Stability.
WALCOM 2008: 188-199 |
| 281 | | Dimitris Kalles,
Alexis C. Kaporis,
Paul G. Spirakis:
Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.
WEA 2008: 181-193 |
| 280 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Equilibrium Points in Fear of Correlated Threats.
WINE 2008: 210-221 |
| 279 | | Haralampos Tsaknakis,
Paul G. Spirakis,
Dimitrios Kanoulas:
Performance Evaluation of a Descent Algorithm for Bi-matrix Games.
WINE 2008: 222-230 |
| 278 | | Spyros C. Kontogiannis,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Approximations of Bimatrix Nash Equilibria.
Encyclopedia of Algorithms 2008 |
| 277 | | Paul G. Spirakis:
Best Response Algorithms for Selfish Routing.
Encyclopedia of Algorithms 2008 |
| 276 | | Charilaos Efthymiou,
Paul G. Spirakis:
Hamilton Cycles in Random Intersection Graphs.
Encyclopedia of Algorithms 2008 |
| 275 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
Independent Sets in Random Intersection Graphs.
Encyclopedia of Algorithms 2008 |
| 274 | | Dimitris Fotakis,
Paul G. Spirakis:
Minimum Congestion Redundant Assignments.
Encyclopedia of Algorithms 2008 |
| 273 | | Paul G. Spirakis:
Selfish Unsplittable Flows: Algorithms for Pure Equilibria.
Encyclopedia of Algorithms 2008 |
| 272 | | Alexis C. Kaporis,
Paul G. Spirakis:
Stackelberg Games: The Price of Optimum.
Encyclopedia of Algorithms 2008 |
| 271 | | Paul G. Spirakis:
Tail Bounds for Occupancy Problems.
Encyclopedia of Algorithms 2008 |
| 270 | | Pavlos Efraimidis,
Paul G. Spirakis:
Weighted Random Sampling.
Encyclopedia of Algorithms 2008 |
| 269 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Paul G. Spirakis:
Atomic congestion games among coalitions.
ACM Transactions on Algorithms 4(4): (2008) |
| 268 | | Marios Mavronicolas,
Vicky Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
A Network Game with Attackers and a Defender.
Algorithmica 51(3): 315-341 (2008) |
| 267 | | Marios Mavronicolas,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
Algorithmica 52(1): 19-43 (2008) |
| 266 | | Charilaos Efthymiou,
Paul G. Spirakis:
Random sampling of colourings of sparse random graphs with a constant number of colours
CoRR abs/0804.2343: (2008) |
| 265 | | George Christodoulou,
Elias Koutsoupias,
Paul G. Spirakis:
On the performance of approximate equilibria in congestion games
CoRR abs/0804.3160: (2008) |
| 264 | | Ioannis Chatzigiannakis,
Georgios Giannoulis,
Paul G. Spirakis:
Efficient Scheduling of DAGs and Sets of Chains on a Simple Asymmetric Multicore Model
CoRR abs/0804.4039: (2008) |
| 263 | | Vasiliki Liagkou,
Effie Makri,
Paul G. Spirakis,
Yannis C. Stamatiou:
A probabilistic key agreement scheme for sensor networks without key predistribution
CoRR abs/0806.1812: (2008) |
| 262 | | Ioannis Chatzigiannakis,
Paul G. Spirakis:
The Dynamics of Probabilistic Population Protocols
CoRR abs/0807.0140: (2008) |
| 261 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Efficient sensor network design for continuous monitoring of moving objects.
Theor. Comput. Sci. 402(1): 56-66 (2008) |
| 260 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
Large independent sets in general random intersection graphs.
Theor. Comput. Sci. 406(3): 215-224 (2008) |
| 259 | | Charilaos Efthymiou,
Paul G. Spirakis:
Random sampling of colourings of sparse random graphs with a constant number of colours.
Theor. Comput. Sci. 407(1-3): 134-154 (2008) |
| 258 | | Paul G. Spirakis:
Preface.
Theory Comput. Syst. 42(1): 1 (2008) |
| 2007 |
|---|
| 257 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects.
ALGOSENSORS 2007: 18-31 |
| 256 | | Vasiliki Liagkou,
Effie Makri,
Paul G. Spirakis,
Yannis C. Stamatiou:
Trust in global computing systems as a limit property emerging from short range random interactions.
ARES 2007: 741-748 |
| 255 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs.
CAI 2007: 236-246 |
| 254 | | Athanasios Antoniou,
C. Korakas,
Christos Manolopoulos,
Anastasia Panagiotaki,
Dimitris Sofotassios,
Paul G. Spirakis,
Yannis C. Stamatiou:
A Trust-Centered Approach for Building E-Voting Systems.
EGOV 2007: 366-377 |
| 253 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games.
ICALP 2007: 595-606 |
| 252 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
Expander Properties and the Cover Time of Random Intersection Graphs.
MFCS 2007: 44-55 |
| 251 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach.
MFCS 2007: 596-608 |
| 250 | | Elias Koutsoupias,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Selfish Load Balancing Under Partial Knowledge.
MFCS 2007: 609-620 |
| 249 | | Shlomi Dolev,
Elad Michael Schiller,
Paul G. Spirakis,
Philippas Tsigas:
Game authority for robust andscalable distributed selfish-computer systems.
PODC 2007: 356-357 |
| 248 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
On the Support Size of Stable Strategies in Random Games.
SAGA 2007: 154-165 |
| 247 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Probabilistic Techniques in Algorithmic Game Theory.
SAGA 2007: 30-53 |
| 246 | | Panagiota N. Panagopoulou,
Paul G. Spirakis:
Full and Local Information in Distributed Decision Making.
WAOA 2007: 156-169 |
| 245 | | Dimitris Fotakis,
Paul G. Spirakis:
Cost-Balancing Tolls for Atomic Network Congestion Games.
WINE 2007: 179-190 |
| 244 | | Haralampos Tsaknakis,
Paul G. Spirakis:
An Optimization Approach for Approximate Nash Equilibria.
WINE 2007: 42-56 |
| 243 | | Ioannis Chatzigiannakis,
Elisavet Konstantinou,
Vasiliki Liagkou,
Paul G. Spirakis:
Agent-based Distributed Group Key Establishment in Wireless Sensor Networks.
WOWMOM 2007: 1-6 |
| 242 | | Marios Mavronicolas,
Paul G. Spirakis:
The Price of Selfish Routing.
Algorithmica 48(1): 91-126 (2007) |
| 241 | | Ioannis Chatzigiannakis,
Elisavet Konstantinou,
Vasiliki Liagkou,
Paul G. Spirakis:
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks.
Electr. Notes Theor. Comput. Sci. 171(1): 17-31 (2007) |
| 240 | | Paul G. Spirakis,
Haralampos Tsaknakis:
Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time..
Electronic Colloquium on Computational Complexity (ECCC) 14(067): (2007) |
| 239 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Paul G. Spirakis:
Performance and stability bounds for dynamic networks.
J. Parallel Distrib. Comput. 67(4): 386-399 (2007) |
| 238 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Paul G. Spirakis:
The increase of the instability of networks due to Quasi-Static link capacities.
Theor. Comput. Sci. 381(1-3): 44-56 (2007) |
| 2006 |
|---|
| 237 |  | Paul G. Spirakis,
Marios Mavronicolas,
Spyros C. Kontogiannis:
Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings
Springer 2006 |
| 236 | | Vasiliki Liagkou,
Effie Makri,
Paul G. Spirakis,
Yannis C. Stamatiou:
The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks.
ALGOSENSORS 2006: 130-139 |
| 235 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Paul G. Spirakis:
Atomic Congestion Games Among Coalitions.
ICALP (1) 2006: 572-583 |
| 234 | | Marios Mavronicolas,
Vicky G. Papadopoulou,
Giuseppe Persiano,
Anna Philippou,
Paul G. Spirakis:
The Price of Defense and Fractional Matchings.
ICDCN 2006: 115-126 |
| 233 | | Marina Gelastou,
Marios Mavronicolas,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
The Power of the Defender.
ICDCS Workshops 2006: 37 |
| 232 | | Marios Mavronicolas,
Loizos Michael,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
The Price of Defense.
MFCS 2006: 717-728 |
| 231 | | Marios Mavronicolas,
Loizos Michael,
Paul G. Spirakis:
Computing on a Partially Eponymous Ring.
OPODIS 2006: 380-394 |
| 230 | | Alexis C. Kaporis,
Paul G. Spirakis:
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions.
SPAA 2006: 19-28 |
| 229 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
The Survival of the Weakest in Networks.
WAOA 2006: 316-329 |
| 228 | | Spyros C. Kontogiannis,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
WINE 2006: 286-296 |
| 227 | | Panagiota N. Panagopoulou,
Paul G. Spirakis:
Algorithms for pure Nash equilibria in weighted congestion games.
ACM Journal of Experimental Algorithmics 11: (2006) |
| 226 | | Ioannis Chatzigiannakis,
Tassos Dimitriou,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks.
Ad Hoc Networks 4(5): 621-635 (2006) |
| 225 | | Costas Busch,
Malik Magdon-Ismail,
Marios Mavronicolas,
Paul G. Spirakis:
Direct Routing: Algorithms and Complexity.
Algorithmica 45(1): 45-68 (2006) |
| 224 | | Tassos Dimitriou,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
The infection time of graphs.
Discrete Applied Mathematics 154(18): 2577-2589 (2006) |
| 223 | | Spyros C. Kontogiannis,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games.
Electronic Colloquium on Computational Complexity (ECCC) 13(081): (2006) |
| 222 | | Pavlos Efraimidis,
Paul G. Spirakis:
Weighted random sampling with a reservoir.
Inf. Process. Lett. 97(5): 181-185 (2006) |
| 221 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.
J. Discrete Algorithms 4(3): 433-454 (2006) |
| 220 | | Burkhard Monien,
Guang Gao,
Horst Simon,
Paul G. Spirakis,
Per Stenström:
Introduction.
J. Parallel Distrib. Comput. 66(5): 615-616 (2006) |
| 219 | | Pavlos Efraimidis,
Paul G. Spirakis:
Approximation schemes for scheduling and covering on unrelated machines.
Theor. Comput. Sci. 359(1-3): 400-417 (2006) |
| 2005 |
|---|
| 218 | | Phillip B. Gibbons,
Paul G. Spirakis:
SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms, July 18-20, 2005, Las Vegas, Nevada, USA
ACM 2005 |
| 217 | | Viktor K. Prasanna,
S. Sitharama Iyengar,
Paul G. Spirakis,
Matt Welsh:
Distributed Computing in Sensor Systems, First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June 30 - July 1, 2005, Proceedings
Springer 2005 |
| 216 | | Marios Mavronicolas,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage.
Algorithmic Aspects of Large and Complex Networks 2005 |
| 215 | | Marios Mavronicolas,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resources Usage.
Algorithmic Aspects of Large and Complex Networks 2005 |
| 214 | | Charilaos Efthymiou,
Paul G. Spirakis:
On the Existence of Hamiltonian Cycles in Random Intersection Graphs.
ICALP 2005: 690-701 |
| 213 | | Marios Mavronicolas,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
Network Game with Attacker and Protector Entities.
ISAAC 2005: 288-297 |
| 212 | | Christoforos Raptopoulos,
Paul G. Spirakis:
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs.
ISAAC 2005: 493-504 |
| 211 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Counting Stable Strategies in Random Evolutionary Games.
ISAAC 2005: 839-848 |
| 210 | | Elisavet Konstantinou,
Vasiliki Liagkou,
Paul G. Spirakis,
Yannis C. Stamatiou,
Moti Yung:
"Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience.
ISC 2005: 44-58 |
| 209 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
The Contribution of Game Theory to Complex Systems.
Panhellenic Conference on Informatics 2005: 101-111 |
| 208 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Evolutionary Games: An Algorithmic View.
Self-star Properties in Complex Information Systems 2005: 97-111 |
| 207 | | Paul G. Spirakis:
Keynote Talk Summary: Algorithmic Aspects of Sensor Networks.
WAC 2005: 277-277 |
| 206 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Paul G. Spirakis:
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost.
WAOA 2005: 161-175 |
| 205 | | Panagiota N. Panagopoulou,
Paul G. Spirakis:
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games.
WEA 2005: 203-215 |
| 204 | | Maria I. Andreou,
Vicky G. Papadopoulou,
Paul G. Spirakis,
B. Theodorides,
A. Xeros:
Generating and Radiocoloring Families of Perfect Graphs.
WEA 2005: 302-314 |
| 203 | | Alexis C. Kaporis,
Lefteris M. Kirousis,
E. I. Politopoulou,
Paul G. Spirakis:
Experimental Results for Stackelberg Scheduling Strategies.
WEA 2005: 77-88 |
| 202 | | Marios Mavronicolas,
Panagiota N. Panagopoulou,
Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage.
WINE 2005: 210-224 |
| 201 | | Marios Mavronicolas,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
A Graph-Theoretic Network Security Game.
WINE 2005: 969-978 |
| 200 | | Spyros C. Kontogiannis,
Paul G. Spirakis:
Atomic Selfish Routing in Networks: A Survey.
WINE 2005: 989-1002 |
| 199 | | Costas Busch,
Marios Mavronicolas,
Paul G. Spirakis:
An Application of the Monotone Linearizability Lemma.
Bulletin of the EATCS 85: 70-80 (2005) |
| 198 | | Alexis C. Kaporis,
Efpraxia Politopoulou,
Paul G. Spirakis:
The Price of Optimum in Stackelberg Games
Electronic Colloquium on Computational Complexity (ECCC)(056): (2005) |
| 197 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
Max-min Fair Flow Control Sensitive to Priorities.
Journal of Interconnection Networks 6(2): 85-114 (2005) |
| 196 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Efficient and Robust Protocols for Local Detection and Propagation in Smart Dust Networks.
MONET 10(1-2): 133-149 (2005) |
| 195 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.
SIAM J. Comput. 34(5): 1216-1252 (2005) |
| 194 | | Costas Busch,
Marios Mavronicolas,
Paul G. Spirakis:
The cost of concurrent, low-contention Read&Modify&Write.
Theor. Comput. Sci. 333(3): 373-400 (2005) |
| 193 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Radiocoloring in planar graphs: Complexity and approximations.
Theor. Comput. Sci. 340(3): 514-538 (2005) |
| 192 | | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Paul G. Spirakis:
Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci. 343(1-2): 133-157 (2005) |
| 191 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Paul G. Spirakis:
Selfish unsplittable flows.
Theor. Comput. Sci. 348(2-3): 226-239 (2005) |
| 190 | | Josep Díaz,
Vishal Sanwalani,
Maria J. Serna,
Paul G. Spirakis:
The chromatic and clique numbers of random scaled sector graphs.
Theor. Comput. Sci. 349(1): 40-51 (2005) |
| 189 | | Dimitris Fotakis,
Rasmus Pagh,
Peter Sanders,
Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time.
Theory Comput. Syst. 38(2): 229-248 (2005) |
| 188 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
The Impact of Network Structure on the Stability of Greedy Protocols.
Theory Comput. Syst. 38(4): 425-460 (2005) |
| 2004 |
|---|
| 187 | | Tassos Dimitriou,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Analysis of the Information Propagation Time Among Mobile Hosts.
ADHOC-NOW 2004: 122-134 |
| 186 | | Paul G. Spirakis:
Algorithmic and Foundational Aspects of Sensor Systems: (Invited Talk).
ALGOSENSORS 2004: 3-8 |
| 185 | | Costas Busch,
Malik Magdon-Ismail,
Marios Mavronicolas,
Paul G. Spirakis:
Direct Routing: Algorithms and Complexity.
ESA 2004: 134-145 |
| 184 | | Elisavet Konstantinou,
Vasiliki Liagkou,
Paul G. Spirakis,
Yannis C. Stamatiou,
Moti Yung:
Electronic National Lotteries.
Financial Cryptography 2004: 147-163 |
| 183 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Efficient Information Propagation Algorithms in Smart Dust and NanoPeer Networks.
Global Computing 2004: 127-145 |
| 182 | | Sotiris E. Nikoletseas,
Christoforos Raptopoulos,
Paul G. Spirakis:
The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs.
ICALP 2004: 1029-1040 |
| 181 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Paul G. Spirakis:
Selfish Unsplittable Flows.
ICALP 2004: 593-605 |
| 180 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Paul G. Spirakis:
Performance and Stability Bounds for Dynamic Networks.
ISPAN 2004: 239-246 |
| 179 | | Tassos Dimitriou,
Ioannis Krontiris,
Fotios Nikakis,
Paul G. Spirakis:
SPEED: Scalable Protocols for Efficient Event Delivery in Sensor Networks.
NETWORKING 2004: 1300-1305 |
| 178 | | Tassos Dimitriou,
Paul G. Spirakis:
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas.
WEA 2004: 199-212 |
| 177 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
The Characteristic Algorithmic Approach for Ad-hoc Mobile Networks (Column: Distributed Computing).
Bulletin of the EATCS 82: 126-169 (2004) |
| 176 | | Konstantinos Antonis,
John D. Garofalakis,
Ioannis Mourtos,
Paul G. Spirakis:
A hierarchical adaptive distributed algorithm for load balancing.
J. Parallel Distrib. Comput. 64(1): 151-162 (2004) |
| 2003 |
|---|
| 175 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
The Impact of Network Structure on the Stability of Greedy Protocols.
CIAC 2003: 251-263 |
| 174 | | Ioannis Chatzigiannakis,
Tassos Dimitriou,
Marios Mavronicolas,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks.
Euro-Par 2003: 1003-1016 |
| 173 | | Martin Gairing,
Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Paul G. Spirakis:
Extreme Nash Equilibria.
ICTCS 2003: 1-20 |
| 172 | | Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode,
Paul G. Spirakis,
Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium?
MFCS 2003: 551-561 |
| 171 | | Peter Triantafillou,
Nikos Ntarmos,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
NanoPeer Networks and P2P Worlds.
Peer-to-Peer Computing 2003: 40- |
| 170 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Paul G. Spirakis:
Instability of Networks with Quasi-Static Link Capacities.
SIROCCO 2003: 179-194 |
| 169 | | Costas Busch,
Marios Mavronicolas,
Paul G. Spirakis:
The Cost of Concurrent, Low-Contention Read-Modify-Write.
SIROCCO 2003: 57-72 |
| 168 | | Dimitris Fotakis,
Rasmus Pagh,
Peter Sanders,
Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time.
STACS 2003: 271-282 |
| 167 | | Maria I. Andreou,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Algorithms and Experiments on Colouring Squares of Planar Graphs.
WEA 2003: 15-32 |
| 166 | | Christos Bouras,
Vaggelis Kapoulas,
Grammati E. Pantziou,
Paul G. Spirakis:
Competitive Video on Demand Schedulers for Popular Movies.
Discrete Applied Mathematics 129(1): 49-61 (2003) |
| 165 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Paul G. Spirakis:
FIFO is Unstable at Arbitrarily Low Rates
Electronic Colloquium on Computational Complexity (ECCC) 10(016): (2003) |
| 164 | | B. Marmalis,
Paul G. Spirakis,
Basil Tampakas:
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks.
I. J. Comput. Appl. 10(1): 51-66 (2003) |
| 163 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Distributed communication algorithms for ad hoc mobile networks.
J. Parallel Distrib. Comput. 63(1): 58-74 (2003) |
| 162 | | Ioannis Chatzigiannakis,
Tassos Dimitriou,
Marios Mavronicolas,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks.
Parallel Processing Letters 13(4): 615-627 (2003) |
| 161 | | Shay Kutten,
Paul G. Spirakis:
Preface.
Theor. Comput. Sci. 291(1): 1 (2003) |
| 160 | | Hermann Jung,
Maria J. Serna,
Paul G. Spirakis:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling.
Theor. Comput. Sci. 292(3): 639-652 (2003) |
| 159 | | Sotiris E. Nikoletseas,
Grigorios Prasinos,
Paul G. Spirakis,
Christos D. Zaroliagis:
Attack Propagation in Networks.
Theory Comput. Syst. 36(5): 553-574 (2003) |
| 158 | | Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
Approximate Equilibria and Ball Fusion.
Theory Comput. Syst. 36(6): 683-693 (2003) |
| 2002 |
|---|
| 157 | | Dimitrios Koukopoulos,
Marios Mavronicolas,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.
DISC 2002: 88-102 |
| 156 | | Friedhelm Meyer auf der Heide,
Mohan Kumar,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Mobile Computing, Mobile Networks.
Euro-Par 2002: 933-934 |
| 155 | | Dimitris Fotakis,
Spyros C. Kontogiannis,
Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
ICALP 2002: 123-134 |
| 154 | | Maria I. Andreou,
Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.
MFCS 2002: 81-92 |
| 153 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Smart dust protocols for local detection and propagation.
POMC 2002: 9-16 |
| 152 | | Elias Koutsoupias,
Marios Mavronicolas,
Paul G. Spirakis:
Approximate Equilibria and Ball Fusion.
SIROCCO 2002: 223-235 |
| 151 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.
WG 2002: 223-234 |
| 150 | | Dimitris Fotakis,
Paul G. Spirakis:
Minimum Congestion Redundant Assignments to Tolerate Random Faults.
Algorithmica 32(3): 396-422 (2002) |
| 149 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Distributed Communication Algorithms.
Bulletin of the EATCS 78: 133-162 (2002) |
| 148 | | Christos Bouras,
Petros Lampsas,
Paul G. Spirakis:
STEPS: Supporting Traditional Education Procedures-A TCP/IP Multimedia Networks-Based Model.
Multimedia Tools Appl. 16(3): 251-276 (2002) |
| 147 | | Philippe Flajolet,
Kostas P. Hatzis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
On the robustness of interconnections in random graphs: a symbolic approach.
Theor. Comput. Sci. 287(2): 515-534 (2002) |
| 146 | | Grammati E. Pantziou,
George P. Pentaris,
Paul G. Spirakis:
Competitive Call Control in Mobile Networks.
Theory Comput. Syst. 35(6): 625-639 (2002) |
| 2001 |
|---|
| 145 | | Fernando Orejas,
Paul G. Spirakis,
Jan van Leeuwen:
Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings
Springer 2001 |
| 144 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Nearchos Paspallis,
Paul G. Spirakis,
Christos D. Zaroliagis:
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks.
Algorithm Engineering 2001: 159-171 |
| 143 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
An Efficient Communication Strategy for Ad-hoc Mobile Networks.
DISC 2001: 285-299 |
| 142 | | Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model.
HiPC 2001: 3-16 |
| 141 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks.
IPDPS 2001: 185 |
| 140 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
An efficient communication strategy for ad-hoc mobile networks.
PODC 2001: 320-322 |
| 139 | | Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Stability Behavior of FIFO Protocol in the Adversarial Queuing Model.
Panhellenic Conference on Informatics 2001: 464-479 |
| 138 | | Josep Díaz,
Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Maria J. Serna,
Paul G. Spirakis,
Dimitrios M. Thilikos:
Stability and non-stability of the FIFO protocol.
SPAA 2001: 48-52 |
| 137 | | Sotiris E. Nikoletseas,
Grigorios Prasinos,
Paul G. Spirakis,
Christos D. Zaroliagis:
Attack propagation in networks.
SPAA 2001: 67-76 |
| 136 | | Marios Mavronicolas,
Paul G. Spirakis:
The price of selfish routing.
STOC 2001: 510-519 |
| 135 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.
Bulletin of the EATCS 75: 152-181 (2001) |
| 134 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Computers and Artificial Intelligence 20(2): (2001) |
| 133 | | Dimitrios Koukopoulos,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
The Range of Stability for Heterogeneous and FIFO Queueing Networks
Electronic Colloquium on Computational Complexity (ECCC)(099): (2001) |
| 2000 |
|---|
| 132 | | Michele Flammini,
Enrico Nardelli,
Guido Proietti,
Paul G. Spirakis:
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000
Carleton Scientific 2000 |
| 131 | | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks.
Algorithm Engineering 2000: 99-110 |
| 130 | | Pavlos Efraimidis,
Paul G. Spirakis:
Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note).
Euro-Par 2000: 456-460 |
| 129 | | Paul G. Spirakis,
Christos D. Zaroliagis:
Distributed Algorithm Engineering.
Experimental Algorithmics 2000: 197-228 |
| 128 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Efficient Communication Establishment in Adverse Communication Environments.
ICALP Satellite Workshops 2000: 215-226 |
| 127 | | Philippe Flajolet,
Kostas P. Hatzis,
Sotiris E. Nikoletseas,
Paul G. Spirakis:
Trade-Offs between Density and Robustness in Random Interconnection Graphs.
IFIP TCS 2000: 152-168 |
| 126 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.
MFCS 2000: 363-372 |
| 125 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Efficient Communication Establishment in Extremely Unreliable Large Networks
Electronic Colloquium on Computational Complexity (ECCC) 7(11): (2000) |
| 124 | | Pavlos Efraimidis,
Paul G. Spirakis:
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
Electronic Colloquium on Computational Complexity (ECCC) 7(7): (2000) |
| 123 | | Sotiris E. Nikoletseas,
Krishna V. Palem,
Paul G. Spirakis,
Moti Yung:
Connectivity Properties in Random Regular Graphs with Edge Faults.
Int. J. Found. Comput. Sci. 11(2): 247-262 (2000) |
| 122 | | Panagiota Fatourou,
Paul G. Spirakis:
Efficient Scheduling of Strict Multithreaded Computations.
Theory Comput. Syst. 33(3): 173-232 (2000) |
| 121 | | Spyros C. Kontogiannis,
Grammati E. Pantziou,
Paul G. Spirakis,
Moti Yung:
Robust Parallel Computations through Randomization.
Theory Comput. Syst. 33(5/6): 427-464 (2000) |
| 1999 |
|---|
| 120 | | Panagiota Fatourou,
Paul G. Spirakis,
Panagiotis Zarafidis,
Anna Zoura:
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.
Algorithm Engineering 1999: 124-138 |
| 119 | | Kostas P. Hatzis,
George P. Pentaris,
Paul G. Spirakis,
Basil Tampakas:
Counting in Mobile Networks: Theory and Experimentation.
Algorithm Engineering 1999: 95-109 |
| 118 | | Panagiota Fatourou,
Paul G. Spirakis:
A New Scheduling Algorithm for General Strict Multithreaded Computations.
DISC 1999: 297-311 |
| 117 | | Basilis Mamalis,
Paul G. Spirakis,
Basil Tampakas:
Parallel Processing of Multiple Text Queries on Hypercube Interconnection Networks.
Euro-Par 1999: 482-486 |
| 116 | | Stavros Georgiades,
Marios Mavronicolas,
Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of No Communication.
FCT 1999: 293-303 |
| 115 | | Kostas P. Hatzis,
George P. Pentaris,
Paul G. Spirakis,
Vasilis T. Tampakas,
Richard B. Tan:
Fundamental Distributed Protocols in Mobile Networks.
PODC 1999: 274 |
| 114 | | Marios Mavronicolas,
Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of no Communication.
PODC 1999: 279 |
| 113 | | Dimitris Fotakis,
Paul G. Spirakis:
Efficient Redundant Assignments under Fault-Tolerance Constraints.
RANDOM-APPROX 1999: 156-167 |
| 112 | | Kostas P. Hatzis,
George P. Pentaris,
Paul G. Spirakis,
Vasilis T. Tampakas,
Richard B. Tan:
Fundamental Control Algorithms in Mobile Networks.
SPAA 1999: 251-260 |
| 111 | | Gianfranco Bilardi,
Andrea Pietracaprina,
Geppino Pucci,
Kieran T. Herley,
Paul G. Spirakis:
BSP versus LogP.
Algorithmica 24(3-4): 405-422 (1999) |
| 110 | | Basilis Mamalis,
Paul G. Spirakis,
Basil Tampakas:
Optimal High-Performance Parallel Text Retrieval via Fat-Trees.
Theory Comput. Syst. 32(6): 591-623 (1999) |
| 1998 |
|---|
| 109 | | Kostas P. Hatzis,
George P. Pentaris,
Paul G. Spirakis,
Vasilis T. Tampakas:
Implementation and Testing Eavesdropper Protocols Using the DSP Tool.
Algorithm Engineering 1998: 74-85 |
| 108 | | Konstantinos Antonis,
John D. Garofalakis,
Paul G. Spirakis:
A Competitive Symmetrical Transfer Policy for Load Sharing.
Euro-Par 1998: 352-355 |
| 107 | | Dimitris Fotakis,
Paul G. Spirakis:
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies.
FSTTCS 1998: 18-29 |
| 106 | | Pimitris Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
MaxMin Fair Flow Control Sensitive to Priorities.
OPODIS 1998: 45-60 |
| 105 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
PODC 1998: 311 |
| 104 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
SIROCCO 1998: 244-258 |
| 103 | | Spyros C. Kontogiannis,
Grammati E. Pantziou,
Paul G. Spirakis,
Moti Yung:
``Dynamic-Fault-Prone BSP'': A Paradigm for Robust Computations in Changing Environments.
SPAA 1998: 37-46 |
| 102 | | Dimitris Fotakis,
Paul G. Spirakis:
Graph Properties that Facilitate Travelling
Electronic Colloquium on Computational Complexity (ECCC) 5(31): (1998) |
| 101 | | Dimitris Fotakis,
Paul G. Spirakis:
Random Walks, Conditional Hitting Sets and Partial Derandomization
Electronic Colloquium on Computational Complexity (ECCC) 5(49): (1998) |
| 100 | | Christos Bouras,
John D. Garofalakis,
Paul G. Spirakis,
Vassilis Triantafillou:
An Analytical Performance Model for Multistage Interconnection Networks with Finite, Infinite and Zero Length Buffers.
Perform. Eval. 34(3): 169-182 (1998) |
| 99 | | Josep Díaz,
Maria J. Serna,
Paul G. Spirakis:
On the Random Generation and Counting of Matchings in Dense Graphs.
Theor. Comput. Sci. 201(1-2): 281-290 (1998) |
| 1997 |
|---|
| 98 | | Aikaterini Krotopoulou,
Paul G. Spirakis,
Dimitra Terpou,
Athanasios K. Tsakalidis:
An Object-Oriented Data Model for the Intelligent Support of Three-Dimensional Objects.
DEXA Workshop 1997: 358-363 |
| 97 | | Sotiris E. Nikoletseas,
Grammati E. Pantziou,
Panagiotis Psycharis,
Paul G. Spirakis:
On the Fault Tolerance of Fat-Trees.
Euro-Par 1997: 208-217 |
| 96 | | Christos Bouras,
John D. Garofalakis,
Paul G. Spirakis,
Vassilis Triantafillou:
A General Performance Model for Multistage Interconnection Networks.
Euro-Par 1997: 993-1000 |
| 95 | | Grammati E. Pantziou,
George P. Pentaris,
Paul G. Spirakis:
Competitive Call Control in Mobile Networks.
ISAAC 1997: 404-413 |
| 94 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).
PODC 1997: 139-148 |
| 93 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
Advances in Rate-Based Flow Control.
SIROCCO 1997: 266-281 |
| 92 | | Spyros C. Kontogiannis,
Grammati E. Pantziou,
Paul G. Spirakis:
Efficient Computations on Fault-Prone BSP Machines.
SPAA 1997: 84-93 |
| 91 | | I. Antoniou,
Christos Bouras,
Petros Lampsas,
Paul G. Spirakis:
Enabling Distance Education over the World Wide Web.
WebNet 1997 |
| 90 | | Paul G. Spirakis,
Vassilis Triantafillou:
Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations.
Parallel Processing Letters 7(3): 249-258 (1997) |
| 89 | | Josep Díaz,
Alan Gibbons,
Grammati E. Pantziou,
Maria J. Serna,
Paul G. Spirakis,
Jacobo Torán:
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.
Theor. Comput. Sci. 181(2): 267-287 (1997) |
| 88 | | Paul G. Spirakis:
Editor's Foreword.
Theory Comput. Syst. 30(1): 1 (1997) |
| 1996 |
|---|
| 87 | | Nicola Santoro,
Paul G. Spirakis:
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996
Carleton Scientific 1996 |
| 86 | | Efstratios Karaivazoglou,
Paul G. Spirakis,
Vasilis Triantafilou:
Wormhole Versus Deflection Routing: A Case Study on the Mesh.
COCOON 1996: 31-40 |
| 85 | | Sokratis K. Katsikas,
Dimitris Gritzalis,
Paul G. Spirakis:
Attack Modelling in Open Network Environments.
Communications and Multimedia Security 1996: 268-277 |
| 84 | | Christos Bouras,
Vaggelis Kapoulas,
D. Miras,
Vaggelis Ouzounis,
Paul G. Spirakis,
A. Tatakis:
On-Demand Hypermedia/Multimedia Service over Broadband Networks.
HPDC 1996: 224- |
| 83 | | Panagiota Fatourou,
Paul G. Spirakis:
Scheduling Algorithms for Strict Multithreaded Computations.
ISAAC 1996: 407-416 |
| 82 | | Dimitris Fotakis,
Paul G. Spirakis:
(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.
MFCS 1996: 360-371 |
| 81 | | Christos Bouras,
Vaggelis Kapoulas,
Grammati E. Pantziou,
Paul G. Spirakis:
Randomized Adaptive Video on Demand (Abstract).
PODC 1996: 179 |
| 80 | | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci,
Paul G. Spirakis:
BSP vs LogP.
SPAA 1996: 25-32 |
| 79 | | Basilis Mamalis,
Paul G. Spirakis,
Basil Tampakas:
Parallel Techniques For Efficient Searching Over Very Large Text Collections.
TREC 1996 |
| 78 | | Lefteris M. Kirousis,
Paul G. Spirakis,
Philippas Tsigas:
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps.
Inf. Process. Lett. 58(1): 47-53 (1996) |
| 77 | | Christos Bouras,
Paul G. Spirakis:
Performance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks.
Perform. Eval. 25(2): 105-130 (1996) |
| 76 | | Dimitris J. Kavvadias,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
Theor. Comput. Sci. 168(1): 121-154 (1996) |
| 1995 |
|---|
| 75 | | Paul G. Spirakis:
Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings
Springer 1995 |
| 74 | | Josep Díaz,
Alan Gibbons,
Grammati E. Pantziou,
Maria J. Serna,
Paul G. Spirakis,
Jacobo Torán:
Efficient Parallel Algorithms for some Tree Layout Problems.
COCOON 1995: 313-323 |
| 73 | | Sotiris E. Nikoletseas,
John H. Reif,
Paul G. Spirakis,
Moti Yung:
Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time.
ICALP 1995: 159-170 |
| 72 | | Vaggelis Kapoulas,
Paul G. Spirakis:
Randomized Competitive Algorithms for Admission Control in General Networks (Abstract).
PODC 1995: 253 |
| 71 | | Pavlos Efraimidis,
Christos Glymidakis,
Basilis Mamalis,
Paul G. Spirakis,
Basil Tampakas:
Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model.
SIGIR 1995: 58-66 |
| 70 | | Efstratios Karaivazoglou,
Paul G. Spirakis,
Vasilis Triantafilou:
Wormhole Routing Simulation on a Mesh.
SIROCCO 1995: 147-158 |
| 69 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Expander Properties in Random Regular Graphs with Edge Faults.
STACS 1995: 421-432 |
| 68 | | Paul G. Spirakis,
Basil Tampakas,
H. Antonopoulou:
Distributed Protocols Against Mobile Eavesdroppers.
WDAG 1995: 160-167 |
| 67 | | Anil Kamath,
Rajeev Motwani,
Krishna V. Palem,
Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture.
Random Struct. Algorithms 7(1): 59-80 (1995) |
| 66 | | Devdatt P. Dubhashi,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
The Fourth Moment in Luby's Distribution.
Theor. Comput. Sci. 148(1): 133-140 (1995) |
| 1994 |
|---|
| 65 | | Aikaterini Krotopoulou,
Paul G. Spirakis,
Dimitra Terpou,
Athanasios K. Tsakalidis:
A Conceptual DataBase Approach for Modelling 3D Objects of Irregular Geometry.
DEXA 1994: 290-299 |
| 64 | | Anil Kamath,
Rajeev Motwani,
Krishna V. Palem,
Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
FOCS 1994: 592-603 |
| 63 | | Sotiris E. Nikoletseas,
Krishna V. Palem,
Paul G. Spirakis,
Moti Yung:
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing.
ICALP 1994: 508-519 |
| 62 | | Dimitris Androutsopoulos,
Per Kaijser,
Sokratis K. Katsikas,
Kåre Presttun,
Don Salmon,
Paul G. Spirakis:
Surveillance and Protection in IBC Management: The Applicability of Two RACE Security Projects - SecureNet II and SESAME.
IS&N 1994: 61-72 |
| 61 | | Dimitris J. Kavvadias,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem.
ISAAC 1994: 270-278 |
| 60 | | Dimitris J. Kavvadias,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
MFCS 1994: 462-472 |
| 59 | | Paul G. Spirakis,
Basil Tampakas:
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing.
PODC 1994: 403 |
| 58 | | Michel Denault,
Dimitris Karagiannis,
Dimitris Gritzalis,
Paul G. Spirakis:
Intrusion detection: Approach and performance issues of the SECURENET system.
Computers & Security 13(6): 495-508 (1994) |
| 57 | | Lefteris M. Kirousis,
Paul G. Spirakis,
Philippas Tsigas:
Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity.
IEEE Trans. Parallel Distrib. Syst. 5(7): 688-696 (1994) |
| 56 | | John D. Garofalakis,
Paul G. Spirakis,
Basil Tampakas,
Sergio Rajsbaum:
Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.
Theor. Comput. Sci. 128(1&2): 63-74 (1994) |
| 1993 |
|---|
| 55 | | G. Anogianakis,
Aikaterini Krotopoulou,
Paul G. Spirakis,
Dimitra Terpou,
Athanasios K. Tsakalidis:
Brain Data Base (BDB).
DEXA 1993: 361-364 |
| 54 | | Christos Bouras,
Paul G. Spirakis:
The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases.
ICCI 1993: 403-407 |
| 53 | | Christos Bouras,
Paul G. Spirakis:
Performance Models for Perfect and Imperfect Clocks on Timestamp Ordering in Distributed Databases.
MASCOTS 1993: 243-246 |
| 52 | | Sotiris E. Nikoletseas,
Paul G. Spirakis:
Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time.
WG 1993: 1-10 |
| 51 | | Hermann Jung,
Lefteris M. Kirousis,
Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays
Inf. Comput. 105(1): 94-104 (1993) |
| 50 | | Lefteris M. Kirousis,
Maria J. Serna,
Paul G. Spirakis:
Parallel Complexity of the Connected Subgraph Problem.
SIAM J. Comput. 22(3): 573-586 (1993) |
| 1992 |
|---|
| 49 | | Sam Toueg,
Paul G. Spirakis,
Lefteris M. Kirousis:
Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings
Springer 1992 |
| 48 | | Paul G. Spirakis,
Basil Tampakas,
Marina Papatriantafilou,
K. Konstantoulis,
K. Vlaxodimitropoulos,
V. Antonopoulos,
P. Kazazis,
T. Metallidou,
D. Spartiotis:
Distributed System Simulator (DSS).
STACS 1992: 615-616 |
| 47 | | John D. Garofalakis,
Sergio Rajsbaum,
Paul G. Spirakis,
Basil Tampakas:
Tentative and Definite Distributed Computations: An Optimistic Approach to Network Synchronization.
WDAG 1992: 110-119 |
| 46 | | John H. Reif,
Paul G. Spirakis:
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems.
Algorithmica 7(5&6): 597-630 (1992) |
| 45 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs.
BIT 32(2): 215-236 (1992) |
| 1991 |
|---|
| 44 | | Hermann Jung,
Maria J. Serna,
Paul G. Spirakis:
A Parallel Algorithm for Two Processors Precedence Constraint Scheduling.
ICALP 1991: 417-428 |
| 43 | | Lefteris M. Kirousis,
Paul G. Spirakis,
Philippas Tsigas:
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps.
ICCI 1991: 582-587 |
| 42 | | Dimitris Kavadias,
Lefteris M. Kirousis,
Paul G. Spirakis:
The Complexity of The Reliable Connectivity Problem.
MFCS 1991: 259-266 |
| 41 | | Maria J. Serna,
Paul G. Spirakis:
Tight RNC Approximations to Max Flow.
STACS 1991: 118-126 |
| 40 | | Zvi M. Kedem,
Krishna V. Palem,
A. Raghunathan,
Paul G. Spirakis:
Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)
STOC 1991: 381-390 |
| 39 | | Lefteris M. Kirousis,
Paul G. Spirakis,
Philippas Tsigas:
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity.
WDAG 1991: 229-241 |
| 38 | | Zvi M. Kedem,
Krishna V. Palem,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Fast Parallel Algorithms for Coloring Random Graphs.
WG 1991: 135-147 |
| 37 | | Dimitris Kavadias,
Lefteris M. Kirousis,
Paul G. Spirakis:
The Complexity of the Reliable Connectivity Problem.
Inf. Process. Lett. 39(5): 245-252 (1991) |
| 1990 |
|---|
| 36 | | John D. Garofalakis,
Paul G. Spirakis:
The Performance of Multistage Interconnection Networks with Finite Buffers.
SIGMETRICS 1990: 263-264 |
| 35 | | Zvi M. Kedem,
Krishna V. Palem,
Paul G. Spirakis:
Efficient Robust Parallel Computations (Extended Abstract)
STOC 1990: 138-148 |
| 34 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs.
SWAT 1990: 288-300 |
| 33 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Optimal Parallel Algorithms for Sparse Graphs.
WG 1990: 1-17 |
| 1989 |
|---|
| 32 | | Lefteris M. Kirousis,
Maria J. Serna,
Paul G. Spirakis:
The Parallel Complexity of the Subgraph Connectivity Problem
FOCS 1989: 294-299 |
| 31 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization.
FSTTCS 1989: 20-29 |
| 30 | | Maria J. Serna,
Paul G. Spirakis:
The Approximability of Problems Complete for P.
Optimal Algorithms 1989: 193-204 |
| 29 | | Hermann Jung,
Lefteris M. Kirousis,
Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays.
SPAA 1989: 254-264 |
| 28 | | Paul G. Spirakis,
Basil Tampakas,
Athanasios Tsiolis:
Symmetry Breaking in Asynchronous Rings with O(n) Messages.
WDAG 1989: 233-241 |
| 27 | | Paul G. Spirakis,
Basil Tampakas:
Efficient Distributed Algorithms by Using The Archimedean Time Assumption.
ITA 23(1): 113-128 (1989) |
| 1988 |
|---|
| 26 | | Paul G. Spirakis:
Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances).
Parcella 1988: 177-189 |
| 25 | | John D. Garofalakis,
Paul G. Spirakis:
Approximate Queueing Models for the Load Balancing Problem.
SIGMETRICS 1988: 277 |
| 24 | | Paul G. Spirakis,
Basil Tampakas:
Efficient Distributed Algorithms by Using the Archemedean Time Assumption.
STACS 1988: 248-263 |
| 23 | | Lefteris M. Kirousis,
Paul G. Spirakis:
Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P.
SWAT 1988: 163-175 |
| 22 | | Paul G. Spirakis:
Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification
Inf. Comput. 76(1): 1-12 (1988) |
| 1987 |
|---|
| 21 | | Dennis Shasha,
Paul G. Spirakis:
Fast Parallel Algorithms for Processing of Joins.
ICS 1987: 939-953 |
| 20 | | Christos Bouras,
John D. Garofalakis,
Paul G. Spirakis,
Vassilis Triantafillou:
Queueing Delays in Buffered Multistage Interconnection Networks.
SIGMETRICS 1987: 111-121 |
| 19 | | Paul G. Spirakis:
The Parallel Complexity of Deadlock Detection.
Theor. Comput. Sci. 52: 155-163 (1987) |
| 1986 |
|---|
| 18 | | Fillia Makedon,
Kurt Mehlhorn,
Theodore S. Papatheodorou,
Paul G. Spirakis:
VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings
Springer 1986 |
| 17 | | Paul G. Spirakis,
Athanasios K. Tsakalidis:
A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph.
ICALP 1986: 397-406 |
| 16 | | Paul G. Spirakis:
The Logical "First Mile-Last Mile" Digital Termination Systems (Abstract only).
ICC 1986: 1763 |
| 15 | | Paul G. Spirakis:
The Parallel Complexity of Deadlock Detection.
MFCS 1986: 582-593 |
| 14 | | Paul G. Spirakis:
Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification.
STACS 1986: 73-86 |
| 13 | | Paul G. Spirakis:
The Diameter of Connected Components of Random Graphs.
WG 1986: 264-276 |
| 1985 |
|---|
| 12 | | Alexander Tuzhilin,
Paul G. Spirakis:
A Semantic Approach to Correctness of Concurrent Transaction Executions.
PODS 1985: 85-95 |
| 11 | | Paul G. Spirakis:
The Volume of the Union of Many Sheres and Point Inclusion Problems.
STACS 1985: 328-338 |
| 10 | | John H. Reif,
Paul G. Spirakis:
k-connectivity in random undirected graphs.
Discrete Mathematics 54(2): 181-191 (1985) |
| 9 | | John H. Reif,
Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communications Systems.
SIAM J. Comput. 14(1): 75-92 (1985) |
| 1984 |
|---|
| 8 | | Daniel Kornhauser,
Gary L. Miller,
Paul G. Spirakis:
Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications
FOCS 1984: 241-250 |
| 7 | | John H. Reif,
Paul G. Spirakis:
Probabilistic Bidding Gives Optimal Distributed Resource Allocation.
ICALP 1984: 391-402 |
| 6 | | John H. Reif,
Paul G. Spirakis:
Real-Time Synchronization of Interprocess Communications.
ACM Trans. Program. Lang. Syst. 6(2): 215-238 (1984) |
| 5 | | Paul G. Spirakis,
Chee-Keng Yap:
Strong NP-Hardness of Moving Many Discs.
Inf. Process. Lett. 19(1): 55-59 (1984) |
| 1982 |
|---|
| 4 | | John H. Reif,
Paul G. Spirakis:
Real Time Resource Allocation in Distributed Systems.
PODC 1982: 84-94 |
| 3 | | John H. Reif,
Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communication Systems.
POPL 1982: 46-56 |
| 1981 |
|---|
| 2 | | John H. Reif,
Paul G. Spirakis:
Distributed Algorithms for Synchronizing Interprocess Communication within Real Time
STOC 1981: 133-145 |
| 1980 |
|---|
| 1 | | John H. Reif,
Paul G. Spirakis:
Random Matroids
STOC 1980: 385-397 |
