Vinall-Smeeth, Harry:
From quantifier depth to quantifier number: separating structures with k variables
#!ilm_mods_00017706!#
In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science (ISBN 979-8-4007-0660-8), (2024), art. 71
DOI: https://doi.org/10.1145/3661814.3662125
Berkholz, Christoph; Mengel, Stefan; Wilhelm, Hermann:
A characterization of efficiently compilable constraint languages
#!ilm_mods_00012376!#
In: 41st International Symposium on Theoretical Aspects of Computer Science: STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (ISBN 978-3-95977-311-9), (2024), art. 11
DOI: https://doi.org/10.4230/LIPIcs.STACS.2024.11
Berkholz, Christoph; Kuske, Dietrich; Schwarz, Christian:
Modal logic is more succinct iff bi-implication is available in some form
#!ilm_mods_00012377!#
In: 41st International Symposium on Theoretical Aspects of Computer Science: STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (ISBN 978-3-95977-311-9), (2024), art. 12
DOI: https://doi.org/10.4230/LIPIcs.STACS.2024.12
Berkholz, Christoph; Vinall-Smeeth, Harry:
A dichotomy for succinct representations of homomorphisms
#!ilm_mods_00006037!#
In: 50th International Colloquium on Automata, Languages, and Programming: ICALP 2023, July 10-14, 2023, Paderborn, Germany (ISBN 978-3-95977-278-5), (2023), art. 113
DOI: https://doi.org/10.4230/LIPIcs.ICALP.2023.113
Berkholz, Christoph; Nordström, Jakob:
Near-optimal lower bounds on quantifier depth and Weisfeiler-Leman refinement steps
#!ilm_mods_00008014!#
In: Journal of the ACM: JACM, vol. 70 (2023), no. 5, art. 32
DOI: https://doi.org/10.1145/3195257
Carmeli, Nofar; Zeevi, Shai; Berkholz, Christoph; Conte, Alessio; Kimelfeld, Benny; Schweikardt, Nicole:
Answering (unions of) conjunctive queries using random access and random-order enumeration
#!ilm_mods_00001101!#
In: ACM transactions on database systems: TODS, vol. 47 (2022), no. 3, art. 9
DOI: https://doi.org/10.1145/3531055
Walzer, Stefan:
Peeling close to the orientability threshold - spatial coupling in hashing-based data structures
#!ilm_mods_00009138!#
In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (ISBN 978-1-61197-646-5), (2021), pp. 2194–2211
DOI: https://doi.org/10.1137/1.9781611976465.131
Walzer, Stefan:
Random hypergraphs for hashing-based data structures
#!ilm_mods_00005475!#
Ilmenau : Universitätsbibliothek Ilmenau, 2020
URL: https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2020000498
Koch, Alexander; Walzer, Stefan:
Foundations for actively secure card-based cryptography
#!ilm_mods_00010015!#
In: 10th International Conference on Fun with Algorithms: FUN 2021, May 30-June 1, 2021, Favignana Island, Sicily, Italy (ISBN 978-3-95977-145-0), (2020), art. 17
DOI: https://doi.org/10.4230/LIPIcs.FUN.2021.17
Aumüller, Martin; Dietzfelbinger, Martin; Heuberger, Clemens; Krenn, Daniel; Prodinger, Helmut:
Dual-Pivot quicksort: optimality, analysis and zeros of associated lattice paths
#!ilm_mods_00002769!#
In: Combinatorics, probability & computing: CPC, vol. 28 (2019), no. 4, pp. 485–518
[International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA) ; 27 (Krakow) : 2016.07.04-08]
DOI: https://doi.org/10.1017/S096354831800041X
Dietzfelbinger, Martin; Keller, Jörg:
Determining minimum hash width for hash chains
#!ilm_mods_00016781!#
In: CECC 2019: proceedings of the third Central European Cybersecurity Conference, Munich, Germany, November 14-15, 2019 (ISBN 978-1-4503-7296-1), (2019), art. 18
DOI: https://doi.org/10.1145/3360664.3360682
Dietzfelbinger, Martin; Walzer, Stefan:
Dense peelable random uniform hypergraphs
#!ilm_mods_00016784!#
In: 27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany (ISBN 978-3-95977-124-5), (2019), art. 38
DOI: https://doi.org/10.4230/LIPIcs.ESA.2019.38
Dietzfelbinger, Martin; Walzer, Stefan:
Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications
#!ilm_mods_00016785!#
In: 27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany (ISBN 978-3-95977-124-5), (2019), art. 39
DOI: https://doi.org/10.4230/LIPIcs.ESA.2019.39
Maier, Tobias; Sanders, Peter; Walzer, Stefan:
Dynamic space efficient hashing
#!ilm_mods_00013204!#
In: Algorithmica: an international journal in computer science, vol. 81 (2019), no. 8, pp. 3162–3185
DOI: https://doi.org/10.1007/s00453-019-00572-x
Dietzfelbinger, Martin; Walzer, Stefan:
Constant-time retrieval with O(log m) extra bits
#!ilm_mods_00015836!#
In: 36th International Symposium on Theoretical Aspects of Computer Science: STACS 2019, March 13-16, 2019, Berlin, Germany (ISBN 978-3-95977-100-9), (2019), art. 24
DOI: https://doi.org/10.4230/LIPIcs.STACS.2019.24
Sanders, Peter; Mehlhorn, Kurt; Dietzfelbinger, Martin; Dementiev, Roman:
Sequential and parallel algorithms and data structures: the basic toolbox
#!ilm_mods_00012562!#
Cham : Springer, 2019. - ISBN 978-3-030-25208-3
DOI: https://doi.org/10.1007/978-3-030-25209-0
Dietzfelbinger, Martin:
Universal hashing via integer arithmetic without primes, revisited
#!ilm_mods_00018060!#
In: Adventures between lower bounds and higher altitudes: essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. - Cham : Springer, 2018, pp. 257–279
DOI: https://doi.org/10.1007/978-3-319-98355-4_15
Walzer, Stefan:
Load thresholds for cuckoo hashing with overlapping blocks
#!ilm_mods_00019176!#
In: 45th International Colloquium on Automata, Languages, and Programming: ICALP 2018, Prague, Czech Republic, July 9-13, 2018 (ISBN 978-3-95977-076-7), (2018), art. 102
DOI: https://doi.org/10.4230/LIPIcs.ICALP.2018.102
Dietzfelbinger, Martin; Schlag, Philipp; Walzer, Stefan:
A subquadratic algorithm for 3XOR
#!ilm_mods_00019964!#
In: 43rd International Symposium on Mathematical Foundations of Computer Science: MFCS 2018, August 27-31, 2018, Liverpool, United Kingdom (ISBN 978-3-95977-086-6), (2018), art. 59
DOI: https://doi.org/10.4230/LIPIcs.MFCS.2018.59
Mitzenmacher, Michael; Panagiotou, Konstantinos; Walzer, Stefan:
Load thresholds for cuckoo hashing with double hashing
#!ilm_mods_00019931!#
In: 16th Scandinavian Symposium and Workshops on Algorithm Theory: SWAT 2018, June 18-20, 2018, Malmö University, Malmö, Sweden (ISBN 978-3-95977-068-2), (2018), art. 29
DOI: https://doi.org/10.4230/LIPIcs.SWAT.2018.29
Dietzfelbinger, Martin; Rowe, Jonathan E.; Wegener, Ingo; Wölfel, Philipp:
Tight bounds for blind search on the integers and the reals
#!ilm_mods_00002772!#
In: Combinatorics, probability & computing: CPC, vol. 19 (2010), no. 5/6, pp. 711–728
[Meeting on Combinatorics and Probability ; (Oberwolfach) : 2009.04.26-05.02]
DOI: https://doi.org/10.1017/S0963548309990599
Niggl, Karl-Heinz; Wunderlich, Henning:
Certifying polynomial time and linear/polynomial space for imperative programs
#!ilm_mods_00017483!#
In: SIAM journal on computing, vol. 35 (2006), no. 5, pp. 1122–1147
DOI: https://doi.org/10.1137/S0097539704445597
Dietzfelbinger, Martin:
Gossiping and broadcasting versus computing functions in networks
#!ilm_mods_00002339!#
In: Discrete applied mathematics, vol. 137 (2004), no. 2, pp. 127–153
DOI: https://doi.org/10.1016/S0166-218X(03)00257-9
Kristiansen, Lars; Niggl, Karl-Heinz:
The Garland measure and computational complexity of stack programs
#!ilm_mods_00015380!#
In: Electronic notes in theoretical computer science: ENTCS, vol. 90 (2003), pp. 15–35
[5. International Workshop on Implicit Computational Complexity (ICC) (Ottawa, 26.-27.06.2003)]
DOI: https://doi.org/10.1016/S1571-0661(03)00003-3
Bellantoni, Stephen J.; Niggl, Karl-Heinz:
Ranking primitive recursions: the low Grzegorczyk classes revisited
#!ilm_mods_00017484!#
In: SIAM journal on computing, vol. 29 (1999), no. 2, pp. 401–415
DOI: https://doi.org/10.1137/S009753979528175X
