Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox von Sanders, Peter

Volltext

Universal Hashing via Integer Arithmetic Without Primes, Revisited von Dietzfelbinger, Martin

Volltext

Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary von Dietzfelbinger, Martin

Volltext

Balanced allocation and dictionaries with tightly packed constant size bins von Dietzfelbinger, Martin, Weidling, Christoph

Volltext

On testing single connectedness in directed graphs and some related problems von Dietzfelbinger, Martin, Jaberi, Raed

Volltext

Preface of STACS 2013 Special Issue von Muscholl, Anca, Dietzfelbinger, Martin

Volltext

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash von Aumüller, Martin, Dietzfelbinger, Martin, Woelfel, Philipp

Volltext

Optimal Partitioning for Dual-Pivot Quicksort von Aumüller, Martin, Dietzfelbinger, Martin

Volltext

In memoriam Prof. Dr. math. Ingo Wegener, 1950–2008 von Dietzfelbinger, Martin

Volltext

Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs von Dietzfelbinger, Martin, Rink, Michael

Volltext

How Good Is Multi-Pivot Quicksort? von Aumüller, Martin, Dietzfelbinger, Martin, Klaue, Pascal

Volltext

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" von Dietzfelbinger, Martin

Volltext

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths von AUMÜLLER, MARTIN, DIETZFELBINGER, MARTIN, HEUBERGER, CLEMENS, KRENN, DANIEL, PRODINGER, HELMUT

Volltext

Dynamic perfect hashing: upper and lower bounds von DIETZFELBINGER, M, KARLIN, A, MEHLHORN, K, MEYER AUF DER HEIDE, F, ROHNERT, H, TARJAN, R. E

Volltext

Inferring Strings from Lyndon Factorization von Nakashima, Yuto, Okabe, Takashi, I, Tomohiro, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity von Hirahara, Shuichi, Kawamura, Akitoshi

Volltext

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures von Eickmeyer, Kord, Elberfeld, Michael, Harwath, Frederik

Volltext

Communication Complexity Theory: Thirty-Five Years of Set Disjointness von Sherstov, Alexander A.

Volltext

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash: Algorithm Design and Analysis von AUMÜLLER, Martin, DIETZFELBINGER, Martin, WOELFEL, Philipp

Volltext

Size-Change Abstraction and Max-Plus Automata von Colcombet, Thomas, Daviaud, Laure, Zuleger, Florian

Volltext