The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Martin Sauerhoff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:172-183 [Conf]
  2. Martin Sauerhoff
    Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:342-355 [Conf]
  3. Martin Sauerhoff
    Randomized Branching Programs. [Citation Graph (0, 0)][DBLP]
    SAGA, 2001, pp:65-72 [Conf]
  4. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On Multipartition Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:206-217 [Conf]
  5. Juraj Hromkovic, Martin Sauerhoff
    Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:145-156 [Conf]
  6. Martin Sauerhoff
    Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:307-318 [Conf]
  7. Martin Sauerhoff
    Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:105-115 [Conf]
  8. Martin Sauerhoff
    On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:488-499 [Conf]
  9. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
    Relating Branching Program Size and Formula Size over the Full Binary Basis. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:57-67 [Conf]
  10. 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]
  11. Martin Sauerhoff
    On the size of randomized OBDDs and read-once branching programs for k-stable functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:155-178 [Journal]
  12. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
    Optimal ordered binary decision diagrams for read-once formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:237-258 [Journal]
  13. Martin Sauerhoff
    An Improved Hierarchy Result for Partitioned BDDs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:57, pp:- [Journal]
  14. Martin Sauerhoff
    Approximation of Boolean Functions by Combinatorial Rectangles [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:58, pp:- [Journal]
  15. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On Multipartition Communication Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:066, pp:- [Journal]
  16. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
    On the Power of Different Types of Restricted Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:26, pp:- [Journal]
  17. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
    Optimal Ordered Binary Decision Diagrams for Tree-like Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:22, pp:- [Journal]
  18. Martin Sauerhoff
    A Lower Bound for Randomized Read-k-Times Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:19, pp:- [Journal]
  19. Martin Sauerhoff
    On Nondeterminism versus Randomness for Read-Once Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:30, pp:- [Journal]
  20. Martin Sauerhoff
    Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:18, pp:- [Journal]
  21. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:263-278 [Journal]
  22. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On multi-partition communication complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:1, pp:49-75 [Journal]
  23. Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener
    On the complexity of the hidden weighted bit function for various BDD models. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:103-116 [Journal]
  24. Martin Sauerhoff
    Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:3, pp:473-495 [Journal]
  25. Juraj Hromkovic, Martin Sauerhoff
    The Power of Nondeterminism and Randomness for Oblivious Branching Programs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:2, pp:159-182 [Journal]
  26. Martin Sauerhoff
    An Improved Hierarchy Result for Partitioned BDDs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:4, pp:313-329 [Journal]
  27. Rolf Drechsler, Martin Sauerhoff, Detlef Sieling
    The complexity of the inclusion operation on OFDD's. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1998, v:17, n:5, pp:457-459 [Journal]
  28. Martin Sauerhoff, Ingo Wegener
    On the complexity of minimizing the OBDD size for incompletely specified functions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:11, pp:1435-1437 [Journal]
  29. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
    Hierarchy Theorems for kOBDDs and kIBDDs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:45-60 [Journal]
  30. Martin Sauerhoff
    Approximation of boolean functions by combinatorial rectangles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:45-78 [Journal]
  31. Martin Sauerhoff, Detlef Sieling
    Quantum branching programs and space-bounded nonuniform quantum complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:334, n:1-3, pp:177-225 [Journal]

  32. Quantum vs. Classical Read-Once Branching Programs. [Citation Graph (, )][DBLP]


  33. An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002