default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Dietzfelbinger
Person information
- affiliation: Technische Universität Ilmenau, Germany
- affiliation (former): University of Paderborn, Germany
- affiliation (PhD 1987): University of Illinois at Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2019
[b4]Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger
, Roman Dementiev:
Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox. Springer 2019, ISBN 978-3-030-25208-3, pp. 1-434- 2014
- [b3]Martin Dietzfelbinger, Kurt Mehlhorn, Peter Sanders:
Algorithmen und Datenstrukturen - die Grundwerkzeuge. eXamen.press, Springer 2014, ISBN 978-3-642-05471-6, pp. I-XII, 1-380 - 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 - 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
Journal Articles
- 2019
- [j34]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Comb. Probab. Comput. 28(4): 485-518 (2019) - 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) - 2016
- [j32]Anca Muscholl, Martin Dietzfelbinger:
Preface of STACS 2013 Special Issue. Theory Comput. Syst. 58(4): 503-505 (2016) - [j31]Martin Aumüller, Martin Dietzfelbinger:
Optimal Partitioning for Dual-Pivot Quicksort. ACM Trans. Algorithms 12(2): 18:1-18:36 (2016) - [j30]Martin Aumüller, Martin Dietzfelbinger, Pascal Klaue:
How Good Is Multi-Pivot Quicksort? ACM Trans. Algorithms 13(1): 8:1-8:47 (2016) - 2015
- [j29]Martin Dietzfelbinger, Raed Jaberi:
On testing single connectedness in directed graphs and some related problems. Inf. Process. Lett. 115(9): 684-688 (2015) - [j28]Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs. Theory Comput. Syst. 56(4): 593-611 (2015) - 2014
- [j27]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. Algorithmica 70(3): 428-456 (2014) - 2011
- [j26]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Precision, Local Search and Unimodal Functions. Algorithmica 59(3): 301-322 (2011) - 2010
- [j25]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers and the Reals. Comb. Probab. Comput. 19(5-6): 711-728 (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) - [j21]Martin Dietzfelbinger, Martin Hühne, Christoph Weidling:
A dictionary implementation based on dynamic perfect hashing. ACM J. Exp. Algorithmics 12: 1.11:1-1.11:25 (2008) - 2007
- [j20]Martin Dietzfelbinger, Henning Wunderlich:
A characterization of average case communication complexity. Inf. Process. Lett. 101(6): 245-249 (2007) - [j19]Martin Dietzfelbinger, Christoph Weidling:
Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380(1-2): 47-68 (2007) - 2005
- [j18]Martin Dietzfelbinger, Hisao Tamaki:
On the probability of rendezvous in graphs. Random Struct. Algorithms 26(3): 266-288 (2005) - 2004
- [j17]Martin Dietzfelbinger:
Gossiping and broadcasting versus computing functions in networks. Discret. Appl. Math. 137(2): 127-153 (2004) - 2003
- [j16]Martin Dietzfelbinger, Manfred Kunde:
A case against using Stirling's formula (unless you really need it). Bull. EATCS 80: 153-158 (2003) - [j15]Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener:
The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evol. Comput. 7(5): 417-423 (2003) - 2001
- [j14]Martin Dietzfelbinger, Anna Gambin, Slawomir Lasota:
On Different Models for Packet Flow in Multistage Interconnection Networks. Fundam. Informaticae 46(4): 287-314 (2001) - 1999
- [j13]Martin Dietzfelbinger, Martin Hühne:
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Comput. Complex. 8(4): 371-392 (1999) - [j12]Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos:
Linear Hash Functions. J. ACM 46(5): 667-683 (1999) - 1997
- [j11]Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997) - 1996
- [j10]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. SIAM J. Comput. 25(6): 1196-123 (1996) - [j9]Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996) - 1994
- [j8]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. J. Comput. Syst. Sci. 48(2): 231-254 (1994) - [j7]Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput. 23(4): 738-761 (1994) - 1993
- [j6]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary. Inf. Comput. 102(2): 196-217 (1993) - [j5]Martin Dietzfelbinger, Wolfgang Maass:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. Theor. Comput. Sci. 108(2): 271-290 (1993) - 1991
- [j4]Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. Theor. Comput. Sci. 82(1): 113-129 (1991) - 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) - 1988
- [j1]Martin Dietzfelbinger, Wolfgang Maass:
Lower Bound Arguments with "Inaccessible" Numbers. J. Comput. Syst. Sci. 36(3): 313-335 (1988)
Conference and Workshop Papers
- 2023
- [c52]Martin Dietzfelbinger:
On Hashing by (Random) Equations (Invited Talk). ESA 2023: 1:1-1:1 - 2019
- [c51]Martin Dietzfelbinger, Jörg Keller:
Determining Minimum Hash Width for Hash Chains. CECC 2019: 18:1-18:5 - [c50]Martin Dietzfelbinger, Stefan Walzer:
Dense Peelable Random Uniform Hypergraphs. ESA 2019: 38:1-38:16 - [c49]Martin Dietzfelbinger, Stefan Walzer:
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. ESA 2019: 39:1-39:18 - [c48]Martin Dietzfelbinger, Stefan Walzer:
Constant-Time Retrieval with O(log m) Extra Bits. STACS 2019: 24:1-24:16 - 2018
- [c47]Martin Dietzfelbinger:
Universal Hashing via Integer Arithmetic Without Primes, Revisited. Adventures Between Lower Bounds and Higher Altitudes 2018: 257-279 - [c46]Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer:
A Subquadratic Algorithm for 3XOR. MFCS 2018: 59:1-59:15 - 2014
- [c45]Martin Dietzfelbinger, Philipp Woelfel:
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. SODA 2014: 816-829 - 2013
- [c44]Martin Aumüller, Martin Dietzfelbinger:
Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract). ICALP (1) 2013: 33-44 - 2012
- [c43]Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. CSR 2012: 99-111 - [c42]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. ESA 2012: 108-120 - [c41]Martin Dietzfelbinger:
On Randomness in Hash Functions (Invited Talk). STACS 2012: 25-28 - [c40]Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. SEA 2012: 148-159 - 2011
- [c39]Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink:
Cuckoo Hashing with Pages. ESA 2011: 615-627 - 2010
- [c38]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) 2010: 213-225 - 2009
- [c37]Djamal Belazzougui, Fabiano C. Botelho, Martin Dietzfelbinger:
Hash, Displace, and Compress. ESA 2009: 682-693 - [c36]Martin Aumüller, Martin Dietzfelbinger, Michael Rink:
Experimental Variations of a Theoretically Good Retrieval Data Structure. ESA 2009: 742-751 - [c35]Martin Dietzfelbinger, Michael Rink:
Applications of a Splitting Trick. ICALP (1) 2009: 354-365 - [c34]Martin Dietzfelbinger, Stefan Edelkamp:
Perfect Hashing for State Spaces in BDD Representation. KI 2009: 33-40 - [c33]Martin Dietzfelbinger, Philipp Woelfel:
Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC 2009: 300-301 - [c32]Martin Dietzfelbinger, Ulf Schellbach:
On risks of using cuckoo hashing with simple universal hash classes. SODA 2009: 795-804 - [c31]Martin Dietzfelbinger, Ulf Schellbach:
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. SOFSEM 2009: 217-228 - [c30]Martin Dietzfelbinger, Philipp Woelfel:
Tight lower bounds for greedy routing in uniform small world rings. STOC 2009: 591-600 - 2008
- [c29]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Precision, local search and unimodal functions. GECCO 2008: 771-778 - [c28]Martin Dietzfelbinger, Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) 2008: 385-396 - [c27]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252 - 2007
- [c26]Martin Dietzfelbinger:
Design Strategies for Minimal Perfect Hash Functions. SAGA 2007: 2-17 - 2005
- [c25]Martin Dietzfelbinger, Christoph Weidling:
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. ICALP 2005: 166-178 - 2003
- [c24]Martin Dietzfelbinger, Philipp Woelfel:
Almost random graphs with simple hash functions. STOC 2003: 629-638 - 2002
- [c23]Martin Dietzfelbinger:
The Probability of a Rendezvous is Minimal in Complete Graphs. ISAAC 2002: 55-66 - 2001
- [c22]Martin Dietzfelbinger, Torben Hagerup:
Simple Minimal Perfect Hashing in Less Space. ESA 2001: 109-120 - 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 - [c19]Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos:
Is Linear Hashing Good? STOC 1997: 465-474 - 1996
- [c18]Martin Dietzfelbinger:
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. STACS 1996: 569-580 - 1994
- [c17]Martin Dietzfelbinger, Martin Hühne:
Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. FSTTCS 1994: 24-35 - [c16]Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335 - 1993
- [c15]Martin Dietzfelbinger:
Simulations Between Different Models of Parallel Computers. FCT 1993: 16-30 - [c14]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
Simple, Efficient Shared Memory Simulations. SPAA 1993: 110-119 - 1992
- [c13]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
High Performance Universal Hashing, with Applications to Shared Memory Simulations. Data Structures and Efficient Algorithms 1992: 250-269 - [c12]Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger:
Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP 1992: 235-246 - [c11]Hannah Bast, Martin Dietzfelbinger, Torben Hagerup:
A Perfect Parallel Dictionary. MFCS 1992: 133-141 - 1991
- [c10]Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough:
Three disjoint path paradigms in star networks. SPDP 1991: 400-406 - 1990
- [c9]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. ICALP 1990: 6-19 - [c8]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA 1990: 125-135 - [c7]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
How to Distribute a Dictionary in a Complete Network. STOC 1990: 117-127 - 1989
- [c6]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary. SPAA 1989: 360-368 - 1988
- [c5]Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531 - [c4]Martin Dietzfelbinger, Wolfgang Maass:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. ICALP 1988: 188-200 - [c3]Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert:
Upper and Lower Bounds for the Dictionary Problem (Abstract). SWAT 1988: 214-215 - 1987
- [c2]Martin Dietzfelbinger:
Lower Bounds for Sorting of Sums. ICALP 1987: 457-466 - 1986
- [c1]Martin Dietzfelbinger, Wolfgang Maass:
two Lower Bound Arguments with "Inaccessible" Numbers. SCT 1986: 163-183
Parts in Books or Collections
- 2011
- [p3]Martin Dietzfelbinger:
Fingerprinting. Algorithms Unplugged 2011: 181-193 - 2008
- [p2]Martin Dietzfelbinger:
Fingerprinting. Taschenbuch der Algorithmen 2008: 193-204 - 1992
- [p1]Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
Dynamic Hashing in Real Time. Informatik 1992: 95-119
Editorship
- 2014
- [e5]Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik:
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I. Lecture Notes in Computer Science 8634, Springer 2014, ISBN 978-3-662-44521-1 [contents] - [e4]Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik:
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Lecture Notes in Computer Science 8635, Springer 2014, ISBN 978-3-662-44464-1 [contents] - 2011
- [e3]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3 [contents] - 2008
- [e2]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2 [contents] - 2007
- [e1]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
Probabilistic Methods in the Design and Analysis of Algorithms, 23.09. - 28.09.2007. Dagstuhl Seminar Proceedings 07391, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents]
Informal and Other Publications
- 2019
- [i21]Martin Dietzfelbinger, Stefan Walzer:
Dense Peelable Random Uniform Hypergraphs. CoRR abs/1907.04749 (2019) - [i20]Martin Dietzfelbinger, Stefan Walzer:
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications. CoRR abs/1907.04750 (2019) - 2018
- [i19]Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer:
A Subquadratic Algorithm for 3XOR. CoRR abs/1804.11086 (2018) - 2017
- [i18]Martin Dietzfelbinger, Michael Mitzenmacher, Rasmus Pagh, David P. Woodruff, Martin Aumüller:
Theory and Applications of Hashing (Dagstuhl Seminar 17181). Dagstuhl Reports 7(5): 1-21 (2017) - 2016
- [i17]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. CoRR abs/1602.04031 (2016) - [i16]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs. CoRR abs/1611.00029 (2016) - [i15]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. CoRR abs/1611.00258 (2016) - 2015
- [i14]Martin Aumüller, Martin Dietzfelbinger, Pascal Klaue:
How Good is Multi-Pivot Quicksort? CoRR abs/1510.04676 (2015) - 2013
- [i13]Martin Aumüller, Martin Dietzfelbinger:
Optimal Partitioning for Dual Pivot Quicksort. CoRR abs/1303.5217 (2013) - [i12]Martin Dietzfelbinger, Philipp Woelfel:
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. CoRR abs/1305.1295 (2013) - 2012
- [i11]Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs. CoRR abs/1203.1506 (2012) - [i10]Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. CoRR abs/1203.4117 (2012) - [i9]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. CoRR abs/1204.4431 (2012) - 2011
- [i8]Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink:
Cuckoo Hashing with Pages. CoRR abs/1104.5111 (2011) - 2009
- [i7]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs/0912.0287 (2009) - 2008
- [i6]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers. CoRR abs/0802.2852 (2008) - [i5]Martin Dietzfelbinger, Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership. CoRR abs/0803.3693 (2008) - 2007
- [i4]Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, Berthold Vöcking:
07391 Abstracts Collection - Probabilistic Methods in the Design and Analysis of Algorithms. Probabilistic Methods in the Design and Analysis of Algorithms 2007 - 1996
- [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) - 1995
- [i1]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs. Electron. Colloquium Comput. Complex. TR95 (1995)
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 2024-05-02 21:49 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:
