Philipp Woelfel

	2012
56		Toryn Qwyllyn Klassen, Philipp Woelfel: Independence of Tabulation-Based Hash Classes. LATIN 2012: 506-517
55		George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel: Low Randomness Rumor Spreading via Hashing. STACS 2012: 314-325
54		George Giakkoupis, Philipp Woelfel: A tight RMR lower bound for randomized mutual exclusion. STOC 2012: 983-1002
53		Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel: Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash CoRR abs/1204.4431: (2012)
52		Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel: RMR-efficient implementations of comparison primitives using read and write operations. Distributed Computing 25(2): 109-162 (2012)
	2011
51		Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel: The space complexity of long-lived and one-shot timestamp implementations. PODC 2011: 139-148
50		George Giakkoupis, Philipp Woelfel: On the Randomness Requirements of Rumor Spreading. SODA 2011: 449-461
49		Wojciech M. Golab, Lisa Higham, Philipp Woelfel: Linearizable implementations do not suffice for randomized distributed computation. STOC 2011: 373-382
48		Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, Local Search and Unimodal Functions. Algorithmica 59(3): 301-322 (2011)
47		Wojciech M. Golab, Lisa Higham, Philipp Woelfel: Linearizable Implementations Do Not Suffice for Randomized Distributed Computation CoRR abs/1103.4690: (2011)
46		Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel: The Space Complexity of Long-lived and One-Shot Timestamp Implementations CoRR abs/1103.5794: (2011)
45		Toryn Qwyllyn Klassen, Philipp Woelfel: Independence of Tabulation-Based Hash Classes CoRR abs/1112.3323: (2011)
44		Danny Hendler, Philipp Woelfel: Randomized mutual exclusion with sub-logarithmic RMR-complexity. Distributed Computing 24(1): 3-19 (2011)
43		Alex Brodsky, Faith Ellen, Philipp Woelfel: Fully-adaptive algorithms for long-lived renaming. Distributed Computing 24(2): 119-134 (2011)
	2010
42		Danny Hendler, Philipp Woelfel: Adaptive randomized mutual exclusion in sub-logarithmic expected time. PODC 2010: 141-150
41		Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers and the Reals. Combinatorics, Probability & Computing 19(5-6): 711-728 (2010)
40		Wojciech M. Golab, Danny Hendler, Philipp Woelfel: An O(1) RMRs Leader Election Algorithm. SIAM J. Comput. 39(7): 2726-2760 (2010)
39		Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel: Separating Deterministic from Randomized Multiparty Communication Complexity. Theory of Computing 6(1): 201-225 (2010)
	2009
38		Danny Hendler, Philipp Woelfel: Randomized mutual exclusion in O(log N / log log N) RMRs. PODC 2009: 26-35
37		Martin Dietzfelbinger, Philipp Woelfel: Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC 2009: 300-301
36		Martin Dietzfelbinger, Philipp Woelfel: Tight lower bounds for greedy routing in uniform small world rings. STOC 2009: 591-600
35		Robin Nunkesser, Philipp Woelfel: Representation of graphs by OBDDs. Discrete Applied Mathematics 157(2): 247-261 (2009)
	2008
34		Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, local search and unimodal functions. GECCO 2008: 771-778
33		Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447
32		Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252
31		Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226
30		Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers CoRR abs/0802.2852: (2008)
	2007
29		Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel: Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. ICALP 2007: 134-145
28		Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. PODC 2007: 3-12
27		Ingo Wegener, Philipp Woelfel: New Results on the Complexity of the Middle Bit of Multiplication. Computational Complexity 16(3): 298-323 (2007)
	2006
26		Philipp Woelfel: Maintaining External Memory Efficient Hash Tables. APPROX-RANDOM 2006: 508-519
25		Alex Brodsky, Faith Ellen, Philipp Woelfel: Fully-Adaptive Algorithms for Long-Lived Renaming. DISC 2006: 413-427
24		Wojciech M. Golab, Danny Hendler, Philipp Woelfel: An O(1) RMRs leader election algorithm. PODC 2006: 238-247
23		Philipp Woelfel: Asymmetric balanced allocation with simple hash functions. SODA 2006: 424-433
22		Philipp Woelfel: Symbolic topological sorting with OBDDs. J. Discrete Algorithms 4(1): 51-71 (2006)
21		Beate Bollig, Stephan Waack, Philipp Woelfel: Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. Theor. Comput. Sci. 362(1-3): 86-99 (2006)
20		Philipp Woelfel: A construction method for optimally universal hash families and its consequences for the existence of RBIBDs. Theor. Comput. Sci. 363(1): 76-84 (2006)
	2005
19		Ingo Wegener, Philipp Woelfel: New Results on the Complexity of the Middle Bit of Multiplication. IEEE Conference on Computational Complexity 2005: 100-110
18		Robin Nunkesser, Philipp Woelfel: Representation of Graphs by OBDDs. ISAAC 2005: 1132-1142
17		Philipp Woelfel: Bounds on the OBDD-size of integer multiplication via universal hashing. J. Comput. Syst. Sci. 71(4): 520-534 (2005)
16		Beate Bollig, Philipp Woelfel: A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Theory Comput. Syst. 38(6): 671-685 (2005)
	2004
15		Philipp Woelfel: A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs. COCOON 2004: 23-32
14		Ingo Wegener, Philipp Woelfel: New Results on the Complexity of the Middle Bit of Multiplication Electronic Colloquium on Computational Complexity (ECCC)(107): (2004)
	2003
13		Philipp Woelfel: Symbolic Topological Sorting with OBDDS. MFCS 2003: 671-680
12		Martin Sauerhoff, Philipp Woelfel: Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. STOC 2003: 186-195
11		Martin Dietzfelbinger, Philipp Woelfel: Almost random graphs with simple hash functions. STOC 2003: 629-638
	2002
10		Philipp Woelfel: On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. IEEE Conference on Computational Complexity 2002: 80-89
9		Beate Bollig, Stephan Waack, Philipp Woelfel: Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. IFIP TCS 2002: 83-94
8		Beate Bollig, Philipp Woelfel: A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. MFCS 2002: 131-142
7		Philipp Woelfel: A Lower Bound Technique for Restricted Branching Programs and Applications. STACS 2002: 431-442
	2001
6		Philipp Woelfel: New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. STACS 2001: 563-574
5		Beate Bollig, Philipp Woelfel: A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. STOC 2001: 419-424
4		Beate Bollig, Philipp Woelfel, Stephan Waack: Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication Electronic Colloquium on Computational Complexity (ECCC) 8(073): (2001)
3		Philipp Woelfel: A Lower Bound Technique for Restricted Branching Programs and Applications Electronic Colloquium on Computational Complexity (ECCC)(101): (2001)
	2000
2		Philipp Woelfel: New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing Electronic Colloquium on Computational Complexity (ECCC) 7(46): (2000)
	1999
1		Philipp Woelfel: Efficient Strongly Universal and Optimally Universal Hashing. MFCS 1999: 262-272

Coauthor Index

1	Hagit Attiya (Chagit Attiya)	[31] [33]
2	Martin Aumüller	[53]
3	Paul Beame	[29] [39]
4	Beate Bollig	[4] [5] [8] [9] [16] [21]
5	Alex Brodsky (Alexander O. Brodsky, Alexander Brodsky)	[25] [43]
6	Matei David	[29] [39]
7	Martin Dietzfelbinger	[11] [30] [32] [34] [36] [37] [41] [48] [53]
8	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[25] [43]
9	George Giakkoupis	[50] [54] [55]
10	Wojciech M. Golab	[24] [28] [40] [47] [49] [52]
11	Vassos Hadzilacos	[28] [52]
12	Maryam Helmi	[46] [51]
13	Danny Hendler	[24] [28] [31] [33] [38] [40] [42] [44] [52]
14	Lisa Higham	[46] [47] [49] [51]
15	Toryn Qwyllyn Klassen	[45] [56]
16	Robin Nunkesser	[18] [35]
17	Eduardo Pacheco	[46] [51]
18	Toniann Pitassi	[29] [39]
19	Jonathan E. Rowe	[30] [32] [34] [41] [48]
20	Martin Sauerhoff	[12]
21	Thomas Sauerwald	[55]
22	He Sun	[55]
23	Stephan Waack	[4] [9] [21]
24	Ingo Wegener	[14] [19] [27] [30] [32] [34] [41] [48]

Colors in the list of coauthors

Last update Sat May 26 02:31:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page