The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philipp Woelfel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Philipp Woelfel
    Maintaining External Memory Efficient Hash Tables. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:508-519 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Robin Nunkesser, Philipp Woelfel
    Representation of Graphs by OBDDs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1132-1142 [Conf]
  7. 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]
  8. Philipp Woelfel
    Symbolic Topological Sorting with OBDDS. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:671-680 [Conf]
  9. Philipp Woelfel
    Efficient Strongly Universal and Optimally Universal Hashing. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:262-272 [Conf]
  10. Wojciech M. Golab, Danny Hendler, Philipp Woelfel
    An O(1) RMRs leader election algorithm. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:238-247 [Conf]
  11. Philipp Woelfel
    Asymmetric balanced allocation with simple hash functions. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:424-433 [Conf]
  12. 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]
  13. Philipp Woelfel
    A Lower Bound Technique for Restricted Branching Programs and Applications. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:431-442 [Conf]
  14. Beate Bollig, Philipp Woelfel
    A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:419-424 [Conf]
  15. Martin Dietzfelbinger, Philipp Woelfel
    Almost random graphs with simple hash functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:629-638 [Conf]
  16. 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]
  17. Alex Brodsky, Faith Ellen, Philipp Woelfel
    Fully-Adaptive Algorithms for Long-Lived Renaming. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:413-427 [Conf]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Philipp Woelfel
    Symbolic topological sorting with OBDDs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:1, pp:51-71 [Journal]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]

  29. Precision, local search and unimodal functions. [Citation Graph (, )][DBLP]


  30. Tight RMR lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP]


  31. Brief announcement: tight lower bounds for greedy routing in uniform small world rings. [Citation Graph (, )][DBLP]


  32. Randomized mutual exclusion in O(log N / log log N) RMRs. [Citation Graph (, )][DBLP]


  33. Adaptive randomized mutual exclusion in sub-logarithmic expected time. [Citation Graph (, )][DBLP]


  34. Tight Bounds for Blind Search on the Integers. [Citation Graph (, )][DBLP]


  35. Tight rmr lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP]


  36. Tight lower bounds for greedy routing in uniform small world rings. [Citation Graph (, )][DBLP]


  37. New Results on the Complexity of the Middle Bit of Multiplication. [Citation Graph (, )][DBLP]


  38. Tight Bounds for Blind Search on the Integers [Citation Graph (, )][DBLP]


  39. Representation of graphs by OBDDs. [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.037secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002