default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Dietzfelbinger
- > Home > Persons > Martin Dietzfelbinger
Publications
- 2023
[c52]Martin Dietzfelbinger:
On Hashing by (Random) Equations (Invited Talk). ESA 2023: 1:1-1:1- 2018
- [c47]Martin Dietzfelbinger:
Universal Hashing via Integer Arithmetic Without Primes, Revisited. Adventures Between Lower Bounds and Higher Altitudes 2018: 257-279 - 2017
- [j33]Martin Dietzfelbinger:
Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary. Inf. Comput. 256: 1 (2017) - 2012
- [c41]Martin Dietzfelbinger:
On Randomness in Hash Functions (Invited Talk). STACS 2012: 25-28 - 2011
- [p3]Martin Dietzfelbinger:
Fingerprinting. Algorithms Unplugged 2011: 181-193 - 2010
- [j24]Martin Dietzfelbinger:
Ingo Wegener: seine Bücher. Inform. Spektrum 33(5): 489-498 (2010) - 2009
- [j23]Martin Dietzfelbinger:
In memoriam Prof. Dr. math. Ingo Wegener, 1950-2008. Theor. Comput. Sci. 410(44): 4446-4447 (2009) - 2008
- [j22]Martin Dietzfelbinger:
Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, Algorithms, McGraw Hill, Boston (2007) ISBN 978-007352340-8, Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson/Addison Wesley, Boston (2006) ISBN 978-032129535-4. Comput. Sci. Rev. 2(2): 131-136 (2008) - [p2]Martin Dietzfelbinger:
Fingerprinting. Taschenbuch der Algorithmen 2008: 193-204 - 2007
- [c26]Martin Dietzfelbinger
:
Design Strategies for Minimal Perfect Hash Functions. SAGA 2007: 2-17 - 2004
- [b2]Martin Dietzfelbinger:
Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P". Lecture Notes in Computer Science 3000, Springer 2004, ISBN 3-540-40344-2 - [j17]Martin Dietzfelbinger:
Gossiping and broadcasting versus computing functions in networks. Discret. Appl. Math. 137(2): 127-153 (2004) - 2002
- [c23]Martin Dietzfelbinger:
The Probability of a Rendezvous is Minimal in Complete Graphs. ISAAC 2002: 55-66 - 1997
- [c21]Martin Dietzfelbinger:
Gossiping and Broadcasting versus Computing Functions in Networks. STACS 1997: 189-200 - [c20]Martin Dietzfelbinger:
The Linear-Array Problem in Communication Complexity Resolved. STOC 1997: 373-382 - 1996
- [c18]Martin Dietzfelbinger:
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. STACS 1996: 569-580 - [i3]Martin Dietzfelbinger:
Gossiping and Broadcasting versus Computing Functions in Networks. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Martin Dietzfelbinger:
The Linear-Array Problem in Communication Complexity Resolved. Electron. Colloquium Comput. Complex. TR96 (1996) - 1993
- [c15]Martin Dietzfelbinger:
Simulations Between Different Models of Parallel Computers. FCT 1993: 16-30 - 1989
- [j3]Martin Dietzfelbinger:
The Speed of Copying on One-Tape Off-Line Turing Machines. Inf. Process. Lett. 33(2): 83-89 (1989) - [j2]Martin Dietzfelbinger:
Lower Bounds for Sorting of Sums. Theor. Comput. Sci. 66(2): 137-155 (1989) - 1987
- [b1]Martin Dietzfelbinger:
Lower bounds on computation time for various models in computational complexity theory. University of Illinois at Chicago, IL, USA, 1987, pp. 1-80 - [c2]Martin Dietzfelbinger:
Lower Bounds for Sorting of Sums. ICALP 1987: 457-466
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 2024-05-02 21:02 CEST 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:
