|
Search the dblp DataBase
Panagiota Fatourou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Panagiota Fatourou, Paul G. Spirakis
Scheduling Algorithms for Strict Multithreaded Computations. [Citation Graph (0, 0)][DBLP] ISAAC, 1996, pp:407-416 [Conf]
- Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
Space-optimal multi-writer snapshot objects are slow. [Citation Graph (0, 0)][DBLP] PODC, 2002, pp:13-20 [Conf]
- Panagiota Fatourou, Maurice Herlihy
Adding networks. [Citation Graph (0, 0)][DBLP] PODC, 2001, pp:308-310 [Conf]
- Panagiota Fatourou, Nikolaos D. Kallimanis
Single-scanner multi-writer snapshot implementations are fast! [Citation Graph (0, 0)][DBLP] PODC, 2006, pp:228-237 [Conf]
- Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). [Citation Graph (0, 0)][DBLP] PODC, 1997, pp:139-148 [Conf]
- Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. [Citation Graph (0, 0)][DBLP] PODC, 1998, pp:311- [Conf]
- Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Advances in Rate-Based Flow Control. [Citation Graph (0, 0)][DBLP] SIROCCO, 1997, pp:266-281 [Conf]
- Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. [Citation Graph (0, 0)][DBLP] SIROCCO, 1998, pp:244-258 [Conf]
- Panagiota Fatourou
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. [Citation Graph (0, 0)][DBLP] SPAA, 2001, pp:189-198 [Conf]
- Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
A tight time lower bound for space-optimal implementations of multi-writer snapshots. [Citation Graph (0, 0)][DBLP] STOC, 2003, pp:259-268 [Conf]
- Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
Time-space tradeoffs for implementations of snapshots. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:169-178 [Conf]
- Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 1999, pp:124-138 [Conf]
- Panagiota Fatourou, Maurice Herlihy
Adding Networks. [Citation Graph (0, 0)][DBLP] DISC, 2001, pp:330-342 [Conf]
- Panagiota Fatourou, Paul G. Spirakis
A New Scheduling Algorithm for General Strict Multithreaded Computations. [Citation Graph (0, 0)][DBLP] DISC, 1999, pp:297-311 [Conf]
- Hagit Attiya, Faith Ellen, Panagiota Fatourou
The Complexity of Updating Multi-writer Snapshot Objects. [Citation Graph (0, 0)][DBLP] ICDCN, 2006, pp:319-330 [Conf]
- Panagiota Fatourou, Maurice Herlihy
Read-modify-write networks. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2004, v:17, n:1, pp:33-46 [Journal]
- Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Max-min Fair Flow Control Sensitive to Priorities. [Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2005, v:6, n:2, pp:85-114 [Journal]
- Panagiota Fatourou, Paul G. Spirakis
Efficient Scheduling of Strict Multithreaded Computations. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2000, v:33, n:3, pp:173-232 [Journal]
- Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:5, pp:1216-1252 [Journal]
- Panagiota Fatourou, Nikolaos D. Kallimanis
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. [Citation Graph (0, 0)][DBLP] PODC, 2007, pp:33-42 [Conf]
- Hagit Attiya, Faith Ellen, Panagiota Fatourou
The complexity of updating multi-writer snapshot objects. [Citation Graph (0, 0)][DBLP] PODC, 2007, pp:318-319 [Conf]
- Faith Ellen, Panagiota Fatourou, Eric Ruppert
The Space Complexity of Unbounded Timestamps. [Citation Graph (0, 0)][DBLP] DISC, 2007, pp:223-237 [Conf]
Non-blocking binary search trees. [Citation Graph (, )][DBLP]
The RedBlue Adaptive Universal Constructions. [Citation Graph (, )][DBLP]
The space complexity of unbounded timestamps. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.304secs
|