| 2008 |
|---|
| 25 | EE | Panagiota Fatourou:
Schedulers for Optimistic Rate Based Flow Control.
Encyclopedia of Algorithms 2008 |
| 24 | EE | Faith Ellen,
Panagiota Fatourou,
Eric Ruppert:
The space complexity of unbounded timestamps.
Distributed Computing 21(2): 103-115 (2008) |
| 2007 |
|---|
| 23 | EE | Faith Ellen,
Panagiota Fatourou,
Eric Ruppert:
The Space Complexity of Unbounded Timestamps.
DISC 2007: 223-237 |
| 22 | EE | Hagit Attiya,
Faith Ellen,
Panagiota Fatourou:
The complexity of updating multi-writer snapshot objects.
PODC 2007: 318-319 |
| 21 | EE | Panagiota Fatourou,
Nikolaos D. Kallimanis:
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS.
PODC 2007: 33-42 |
| 20 | EE | Faith Ellen,
Panagiota Fatourou,
Eric Ruppert:
Time lower bounds for implementations of multi-writer snapshots.
J. ACM 54(6): (2007) |
| 2006 |
|---|
| 19 | EE | Hagit Attiya,
Faith Ellen,
Panagiota Fatourou:
The Complexity of Updating Multi-writer Snapshot Objects.
ICDCN 2006: 319-330 |
| 18 | EE | Panagiota Fatourou,
Nikolaos D. Kallimanis:
Single-scanner multi-writer snapshot implementations are fast!
PODC 2006: 228-237 |
| 17 | EE | Panagiota Fatourou,
Faith Ellen Fich,
Eric Ruppert:
Time-space tradeoffs for implementations of snapshots.
STOC 2006: 169-178 |
| 2005 |
|---|
| 16 | EE | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
Max-min Fair Flow Control Sensitive to Priorities.
Journal of Interconnection Networks 6(2): 85-114 (2005) |
| 15 | EE | 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) |
| 2004 |
|---|
| 14 | EE | Panagiota Fatourou,
Maurice Herlihy:
Read-modify-write networks.
Distributed Computing 17(1): 33-46 (2004) |
| 2003 |
|---|
| 13 | EE | Panagiota Fatourou,
Faith Ellen Fich,
Eric Ruppert:
A tight time lower bound for space-optimal implementations of multi-writer snapshots.
STOC 2003: 259-268 |
| 2002 |
|---|
| 12 | EE | Panagiota Fatourou,
Faith Ellen Fich,
Eric Ruppert:
Space-optimal multi-writer snapshot objects are slow.
PODC 2002: 13-20 |
| 2001 |
|---|
| 11 | EE | Panagiota Fatourou,
Maurice Herlihy:
Adding Networks.
DISC 2001: 330-342 |
| 10 | EE | Panagiota Fatourou,
Maurice Herlihy:
Adding networks.
PODC 2001: 308-310 |
| 9 | EE | Panagiota Fatourou:
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables.
SPAA 2001: 189-198 |
| 2000 |
|---|
| 8 | EE | Panagiota Fatourou,
Paul G. Spirakis:
Efficient Scheduling of Strict Multithreaded Computations.
Theory Comput. Syst. 33(3): 173-232 (2000) |
| 1999 |
|---|
| 7 | EE | Panagiota Fatourou,
Paul G. Spirakis,
Panagiotis Zarafidis,
Anna Zoura:
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.
Algorithm Engineering 1999: 124-138 |
| 6 | EE | Panagiota Fatourou,
Paul G. Spirakis:
A New Scheduling Algorithm for General Strict Multithreaded Computations.
DISC 1999: 297-311 |
| 1998 |
|---|
| 5 | EE | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
PODC 1998: 311 |
| 4 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
SIROCCO 1998: 244-258 |
| 1997 |
|---|
| 3 | | 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 |
| 2 | | Panagiota Fatourou,
Marios Mavronicolas,
Paul G. Spirakis:
Advances in Rate-Based Flow Control.
SIROCCO 1997: 266-281 |
| 1996 |
|---|
| 1 | | Panagiota Fatourou,
Paul G. Spirakis:
Scheduling Algorithms for Strict Multithreaded Computations.
ISAAC 1996: 407-416 |
