The SCEAS System
| |||||||

## Search the dblp DataBase
Philipp Woelfel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Philipp Woelfel
**Maintaining External Memory Efficient Hash Tables.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:508-519 [Conf] - Ingo Wegener, Philipp Woelfel
**New Results on the Complexity of the Middle Bit of Multiplication.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:100-110 [Conf] - Philipp Woelfel
**On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:80-89 [Conf] - Philipp Woelfel
**A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs.**[Citation Graph (0, 0)][DBLP] COCOON, 2004, pp:23-32 [Conf] - Beate Bollig, Stephan Waack, Philipp Woelfel
**Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:83-94 [Conf] - Robin Nunkesser, Philipp Woelfel
**Representation of Graphs by OBDDs.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:1132-1142 [Conf] - Beate Bollig, Philipp Woelfel
**A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:131-142 [Conf] - Philipp Woelfel
**Symbolic Topological Sorting with OBDDS.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:671-680 [Conf] - Philipp Woelfel
**Efficient Strongly Universal and Optimally Universal Hashing.**[Citation Graph (0, 0)][DBLP] MFCS, 1999, pp:262-272 [Conf] - Wojciech M. Golab, Danny Hendler, Philipp Woelfel
**An**[Citation Graph (0, 0)][DBLP]*O*(1) RMRs leader election algorithm. PODC, 2006, pp:238-247 [Conf] - Philipp Woelfel
**Asymmetric balanced allocation with simple hash functions.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:424-433 [Conf] - Philipp Woelfel
**New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:563-574 [Conf] - Philipp Woelfel
**A Lower Bound Technique for Restricted Branching Programs and Applications.**[Citation Graph (0, 0)][DBLP] STACS, 2002, pp:431-442 [Conf] - Beate Bollig, Philipp Woelfel
**A read-once branching program lower bound of Omega(2**[Citation Graph (0, 0)][DBLP]^{n/4}) for integer multiplication using universal. STOC, 2001, pp:419-424 [Conf] - Martin Dietzfelbinger, Philipp Woelfel
**Almost random graphs with simple hash functions.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:629-638 [Conf] - Martin Sauerhoff, Philipp Woelfel
**Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:186-195 [Conf] - Alex Brodsky, Faith Ellen, Philipp Woelfel
**Fully-Adaptive Algorithms for Long-Lived Renaming.**[Citation Graph (0, 0)][DBLP] DISC, 2006, pp:413-427 [Conf] - Philipp Woelfel
**New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:46, pp:- [Journal] - Beate Bollig, Philipp Woelfel, Stephan Waack
**Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:073, pp:- [Journal] - Philipp Woelfel
**A Lower Bound Technique for Restricted Branching Programs and Applications**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:101, pp:- [Journal] - Ingo Wegener, Philipp Woelfel
**New Results on the Complexity of the Middle Bit of Multiplication**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:107, pp:- [Journal] - Philipp Woelfel
**Bounds on the OBDD-size of integer multiplication via universal hashing.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:520-534 [Journal] - Philipp Woelfel
**Symbolic topological sorting with OBDDs.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:1, pp:51-71 [Journal] - Beate Bollig, Philipp Woelfel
**A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:6, pp:671-685 [Journal] - Beate Bollig, Stephan Waack, Philipp Woelfel
**Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:86-99 [Journal] - Philipp Woelfel
**A construction method for optimally universal hash families and its consequences for the existence of RBIBDs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:1, pp:76-84 [Journal] - Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
**Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:134-145 [Conf] - Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel
**Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:3-12 [Conf] **Precision, local search and unimodal functions.**[Citation Graph (, )][DBLP]**Tight RMR lower bounds for mutual exclusion and other problems.**[Citation Graph (, )][DBLP]**Brief announcement: tight lower bounds for greedy routing in uniform small world rings.**[Citation Graph (, )][DBLP]**Randomized mutual exclusion in O(log N / log log N) RMRs.**[Citation Graph (, )][DBLP]**Adaptive randomized mutual exclusion in sub-logarithmic expected time.**[Citation Graph (, )][DBLP]**Tight Bounds for Blind Search on the Integers.**[Citation Graph (, )][DBLP]**Tight rmr lower bounds for mutual exclusion and other problems.**[Citation Graph (, )][DBLP]**Tight lower bounds for greedy routing in uniform small world rings.**[Citation Graph (, )][DBLP]**New Results on the Complexity of the Middle Bit of Multiplication.**[Citation Graph (, )][DBLP]**Tight Bounds for Blind Search on the Integers**[Citation Graph (, )][DBLP]**Representation of graphs by OBDDs.**[Citation Graph (, )][DBLP]
Search in 0.035secs, Finished in 0.037secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |