Martin Sauerhoff
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
7
Venues
2
Active years
1998–2003
Best venue rank
A*
Where they publish
Papers
7 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2003 | STOC | Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. | Martin Sauerhoff, Philipp Woelfel |
| 2003 | STACS | Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs. | Martin Sauerhoff |
| 2001 | STACS | On Multipartition Communication Complexity. | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
| 2000 | STACS | Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. | Juraj Hromkovic, Martin Sauerhoff |
| 1999 | STACS | On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. | Martin Sauerhoff |
| 1999 | STACS | Relating Branching Program Size and Formula Size over the Full Binary Basis. | Martin Sauerhoff, Ingo Wegener, Ralph Werchner |
| 1998 | STACS | Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). | Martin Sauerhoff |