default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Sauerhoff
Person information
- affiliation: Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j15]Martin Sauerhoff:
An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order. Discret. Appl. Math. 158(11): 1195-1204 (2010)- [p2]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer:
Binary Decision Diagrams. Boolean Models and Methods 2010: 473-505
2000 – 2009
- 2009
- [j14]André Gronemeier, Martin Sauerhoff:
Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams. Theory Comput. Syst. 44(3): 332-348 (2009) - 2006
- [i9]Martin Sauerhoff:
Quantum vs. Classical Read-Once Branching Programs. Complexity of Boolean Functions 2006 - 2005
- [j13]Martin Sauerhoff, Detlef Sieling:
Quantum branching programs and space-bounded nonuniform quantum complexity. Theor. Comput. Sci. 334(1-3): 177-225 (2005) - 2004
- [j12]Pavol Duris, Juraj Hromkovic, Stasys Jukna
, Martin Sauerhoff, Georg Schnitger:
On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004) - 2003
- [j11]Martin Sauerhoff:
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. J. Comput. Syst. Sci. 66(3): 473-495 (2003) - [j10]Juraj Hromkovic, Martin Sauerhoff:
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. Theory Comput. Syst. 36(2): 159-182 (2003) - [j9]Martin Sauerhoff:
Approximation of boolean functions by combinatorial rectangles. Theor. Comput. Sci. 301(1-3): 45-78 (2003) - [c10]Martin Sauerhoff:
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs. STACS 2003: 307-318 - [c9]Martin Sauerhoff, Philipp Woelfel:
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. STOC 2003: 186-195 - 2002
- [j8]Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178(1): 263-278 (2002) - 2001
- [j7]Martin Sauerhoff:
On the size of randomized OBDDs and read-once branching programs for k-stable functions. Comput. Complex. 10(2): 155-178 (2001) - [c8]Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. CCC 2001: 172-183 - [c7]Martin Sauerhoff:
Randomized Branching Programs. SAGA 2001: 65-72 - [c6]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. STACS 2001: 206-217 - [i8]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j6]Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Optimal ordered binary decision diagrams for read-once formulas. Discret. Appl. Math. 103(1-3): 237-258 (2000) - [j5]Martin Sauerhoff:
An Improved Hierarchy Result for Partitioned BDDs. Theory Comput. Syst. 33(4): 313-329 (2000) - [c5]Juraj Hromkovic, Martin Sauerhoff:
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. STACS 2000: 145-156 - [i7]Martin Sauerhoff:
An Improved Hierarchy Result for Partitioned BDDs. Electron. Colloquium Comput. Complex. TR00 (2000) - [i6]Martin Sauerhoff:
Approximation of Boolean Functions by Combinatorial Rectangles. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [b1]Martin Sauerhoff:
Complexity theoretical results for randomized branching programs. Technical University of Dortmund, Germany, Shaker 1999, ISBN 978-3-8265-4827-7, pp. 1-141 - [j4]Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener:
On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Informatics Appl. 33(2): 103-116 (1999) - [c4]Martin Sauerhoff:
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables. FSTTCS 1999: 342-355 - [c3]Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Relating Branching Program Size and Formula Size over the Full Binary Basis. STACS 1999: 57-67 - [c2]Martin Sauerhoff:
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. STACS 1999: 488-499 - [p1]Martin Sauerhoff:
Komplexitätstheoretische Ergebnisse für Randomisierte Branchingprogramme. Ausgezeichnete Informatikdissertationen 1999: 203-212 - 1998
- [j3]Rolf Drechsler, Martin Sauerhoff, Detlef Sieling:
The complexity of the inclusion operation on OFDD's. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(5): 457-459 (1998) - [j2]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
Hierarchy Theorems for kOBDDs and kIBDDs. Theor. Comput. Sci. 205(1-2): 45-60 (1998) - [c1]Martin Sauerhoff:
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). STACS 1998: 105-115 - [i5]Martin Sauerhoff:
Randomness and Nondeterminism are Incomparable for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [i4]Martin Sauerhoff:
A Lower Bound for Randomized Read-k-Times Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997) - [i3]Martin Sauerhoff:
On Nondeterminism versus Randomness for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j1]Martin Sauerhoff, Ingo Wegener:
On the complexity of minimizing the OBDD size for incompletely specified functions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(11): 1435-1437 (1996) - [i2]Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits. Electron. Colloquium Comput. Complex. TR96 (1996) - 1994
- [i1]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs. Electron. Colloquium Comput. Complex. TR94 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
