Panagiota Fatourou

	2012
33		Panagiota Fatourou, Nikolaos D. Kallimanis: Revisiting the combining synchronization technique. PPOPP 2012: 257-266
	2011
32		Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien: Introduction. Euro-Par (2) 2011: 224-225
31		Panagiota Fatourou, Nikolaos D. Kallimanis: A highly-efficient wait-free universal construction. SPAA 2011: 325-334
30		Hagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating snapshot objects. J. Parallel Distrib. Comput. 71(12): 1570-1577 (2011)
	2010
29		Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel: Non-blocking binary search trees. PODC 2010: 131-140
28		Panagiota Fatourou: The Distributed Computing Column. Bulletin of the EATCS 102: 83 (2010)
	2009
27		Panagiota Fatourou, Nikolaos D. Kallimanis: The RedBlue Adaptive Universal Constructions. DISC 2009: 127-141
	2008
26		Panagiota Fatourou: Schedulers for Optimistic Rate Based Flow Control. Encyclopedia of Algorithms 2008
25		Faith Ellen, Panagiota Fatourou, Eric Ruppert: The space complexity of unbounded timestamps. Distributed Computing 21(2): 103-115 (2008)
	2007
24		Faith Ellen, Panagiota Fatourou, Eric Ruppert: The Space Complexity of Unbounded Timestamps. DISC 2007: 223-237
23		Hagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319
22		Panagiota Fatourou, Nikolaos D. Kallimanis: Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. PODC 2007: 33-42
21		Faith Ellen, Panagiota Fatourou, Eric Ruppert: Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6): (2007)
	2006
20		Hagit Attiya, Faith Ellen, Panagiota Fatourou: The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330
19		Panagiota Fatourou, Nikolaos D. Kallimanis: Single-scanner multi-writer snapshot implementations are fast! PODC 2006: 228-237
18		Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert: Time-space tradeoffs for implementations of snapshots. STOC 2006: 169-178
17		James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer: Eight Open Problems in Distributed Computing. Bulletin of the EATCS 90: 109-126 (2006)
	2005
16		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		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		Panagiota Fatourou, Maurice Herlihy: Read-modify-write networks. Distributed Computing 17(1): 33-46 (2004)
	2003
13		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		Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert: Space-optimal multi-writer snapshot objects are slow. PODC 2002: 13-20
	2001
11		Panagiota Fatourou, Maurice Herlihy: Adding Networks. DISC 2001: 330-342
10		Panagiota Fatourou, Maurice Herlihy: Adding networks. PODC 2001: 308-310
9		Panagiota Fatourou: Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. SPAA 2001: 189-198
	2000
8		Panagiota Fatourou, Paul G. Spirakis: Efficient Scheduling of Strict Multithreaded Computations. Theory Comput. Syst. 33(3): 173-232 (2000)
	1999
7		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		Panagiota Fatourou, Paul G. Spirakis: A New Scheduling Algorithm for General Strict Multithreaded Computations. DISC 1999: 297-311
	1998
5		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

Coauthor Index

1	Kunal Agarwal	[32]
2	James Aspnes	[17]
3	Hagit Attiya (Chagit Attiya)	[20] [23] [30]
4	Franck van Breugel	[29]
5	Costas Busch	[17]
6	Shlomi Dolev	[17]
7	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[12] [13] [18] [20] [21] [23] [24] [25] [29] [30]
8	Chryssis Georgiou	[17]
9	Maurice Herlihy	[10] [11] [14]
10	Nikolaos D. Kallimanis	[19] [22] [27] [31] [33]
11	Marios Mavronicolas	[2] [3] [4] [5] [15] [16]
12	Arnold L. Rosenberg	[32]
13	Eric Ruppert	[12] [13] [18] [21] [24] [25] [29]
14	Alexander A. Shvartsman	[17]
15	Paul G. Spirakis	[1] [2] [3] [4] [5] [6] [7] [8] [15] [16] [17]
16	Frédéric Vivien	[32]
17	Roger Wattenhofer	[17]
18	Panagiotis Zarafidis	[7]
19	Anna Zoura	[7]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page