Travelled to:1 × Belgium
1 × Cyprus
1 × Denmark
1 × Finland
1 × France
1 × Hungary
1 × Israel
1 × Italy
1 × Japan
1 × Latvia
1 × Poland
1 × Portugal
2 × Greece
2 × Spain
8 × USA
Collaborated with:J.H.Reif S.E.Nikoletseas S.C.Kontogiannis D.Fotakis G.B.Mertzios C.Raptopoulos I.Chatzigiannakis K.V.Palem M.Mavronicolas O.Michail Z.M.Kedem C.Efthymiou M.Yung A.K.Tsakalidis A.Tuzhilin A.C.Kaporis H.Jung M.J.Serna V.Liagkou D.Salouros A.Raghunathan E.Koutsoupias P.S.Efraimidis C.Glymidakis B.Mamalis B.Tampakas J.Czyzowicz L.Gasieniec A.Kosowski E.Kranakis P.Uznanski C.Bouras V.Kapoulas D.Miras V.Ouzounis A.Tatakis
Talks about:network (6) random (5) graph (5) algorithm (4) parallel (4) selfish (4) effici (4) comput (4) intersect (3) distribut (3)
Person: Paul G. Spirakis
DBLP: Spirakis:Paul_G=
Facilitated 4 volumes:
EdEdEd
EdContributed to:
2015201420132009
2008200720062005200420022001
19961995
199519941991199119901986
19851984
198219811980Wrote 28 papers:
- ICALP-v1-2015-CzyzowiczGKKSU #convergence #on the #protocol
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (JC, LG, AK, EK, PGS, PU), pp. 393–405.
- ICALP-v1-2014-MertziosNRS #interactive #memory management #network
- Determining Majority in Networks with Local Interactions and Very Small Local Memory (GBM, SEN, CR, PGS), pp. 871–882.
- ICALP-v2-2013-MertziosMCS #constraints #network #optimisation
- Temporal Network Optimization Subject to Connectivity Constraints (GBM, OM, IC, PGS), pp. 657–668.
- ICALP-v2-2013-MertziosS #bound #evolution #network
- Strong Bounds for Evolution in Networks (GBM, PGS), pp. 669–680.
- ICALP-v2-2013-SpirakisNR #graph #random
- A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.
- ICALP-v2-2009-ChatzigiannakisMS #protocol
- Mediated Population Protocols (IC, OM, PGS), pp. 363–374.
- ICALP-v2-2009-FotakisKS #design #network #performance
- Efficient Methods for Selfish Network Design (DF, ACK, PGS), pp. 459–471.
- ECSA-2008-ChatzigiannakisLSS #security
- A Security Model for Internet-Based Digital Asset Management Systems (IC, VL, DS, PGS), pp. 326–329.
- ICALP-2007-KontogiannisS #algorithm #approximate #constant #game studies #performance
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.
- ICALP-v1-2006-FotakisKS #game studies
- Atomic Congestion Games Among Coalitions (DF, SCK, PGS), pp. 572–583.
- ICALP-2005-EfthymiouS #graph #on the #random
- On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.
- ICALP-2004-FotakisKS
- Selfish Unsplittable Flows (DF, SCK, PGS), pp. 593–605.
- ICALP-2004-NikoletseasRS #graph #independence #performance #random #scalability #set
- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
- ICALP-2002-FotakisKKMS #complexity #game studies #nash
- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (DF, SCK, EK, MM, PGS), pp. 123–134.
- STOC-2001-MavronicolasS
- The price of selfish routing (MM, PGS), pp. 510–519.
- HPDC-1996-BourasKMOST #hypermedia #multi #network #on-demand
- On-Demand Hypermedia/Multimedia Service over Broadband Networks (CB, VK, DM, VO, PGS, AT), pp. 224–231.
- ICALP-1995-NikoletseasRSY #graph #memory management #probability
- Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.
- SIGIR-1995-EfraimidisGMST #parallel #performance #retrieval #using
- Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model (PSE, CG, BM, PGS, BT), pp. 58–66.
- ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability
- Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.
- ICALP-1991-JungSS #algorithm #constraints #parallel #precedence #scheduling
- A Parallel Algorithm for Two Processors Precedence Constraint Scheduling (HJ, MJS, PGS), pp. 417–428.
- STOC-1991-KedemPRS #parallel #performance
- Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (ZMK, KVP, AR, PGS), pp. 381–390.
- STOC-1990-KedemPS #parallel #performance #robust
- Efficient Robust Parallel Computations (ZMK, KVP, PGS), pp. 138–148.
- ICALP-1986-SpirakisT #algorithm #performance
- A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.
- PODS-1985-TuzhilinS #approach #concurrent #correctness #semantics #transaction
- A Semantic Approach to Correctness of Concurrent Transaction Executions (AT, PGS), pp. 85–95.
- ICALP-1984-ReifS #distributed #probability #resource management
- Probabilistic Bidding Gives Optimal Distributed Resource Allocation (JHR, PGS), pp. 391–402.
- POPL-1982-ReifS #bound #communication #distributed #variability
- Unbounded Speed Variability in Distributed Communication Systems (JHR, PGS), pp. 46–56.
- STOC-1981-ReifS #algorithm #communication #distributed #realtime
- Distributed Algorithms for Synchronizing Interprocess Communication within Real Time (JHR, PGS), pp. 133–145.
- STOC-1980-ReifS #random
- Random Matroids (JHR, PGS), pp. 385–397.