Kristiansen, Lars; Niggl, Karl-Heinz
The Garland measure and computational complexity of stack programs. - In: Electronic notes in theoretical computer science, ISSN 1571-0661, Bd. 90 (2003), S. 15-35
https://doi.org/10.1016/S1571-0661(03)00003-3
The Garland measure and computational complexity of stack programs. - In: Electronic notes in theoretical computer science, ISSN 1571-0661, Bd. 90 (2003), S. 15-35
https://doi.org/10.1016/S1571-0661(03)00003-3
Dietzfelbinger, Martin; Naudts, Bart; Hoyweghen, Clarissa; Wegener, Ingo
The analysis of a recombinative hill-climber on H-IFF. - In: IEEE transactions on evolutionary computation, ISSN 1089-778X, Bd. 7 (2003), 5, S. 417-423
The analysis of a recombinative hill-climber on H-IFF. - In: IEEE transactions on evolutionary computation, ISSN 1089-778X, Bd. 7 (2003), 5, S. 417-423
Dietzfelbinger, Martin;
Wölfel, Philipp;
Almost random graphs with simple hash functions. - In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, (2003), S. 629-638
Almost random graphs with simple hash functions. - In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, (2003), S. 629-638
Dietzfelbinger, Martin; Tamaki, Hisao
On the probability of rendezvous in graphs. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003. - 27 S. - (Forschungsberichte des Max-Planck-Instituts für Informatik ; 2003-1-006)
On the probability of rendezvous in graphs. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003. - 27 S. - (Forschungsberichte des Max-Planck-Instituts für Informatik ; 2003-1-006)
Dietzfelbinger, Martin;
Wölfel, Philipp;
Almost random graphs with simple hash functions. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003. - 20 S. - (Forschungsberichte des Max-Planck-Instituts für Informatik ; 2003-1-005)
Almost random graphs with simple hash functions. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 2003. - 20 S. - (Forschungsberichte des Max-Planck-Instituts für Informatik ; 2003-1-005)
Dietzfelbinger, Martin;
The probability of a rendezvous is minimal in complete graphs. - In: Algorithms and Computation, (2002), S. 55-66
http://dx.doi.org/10.1007/3-540-36136-7_6
The probability of a rendezvous is minimal in complete graphs. - In: Algorithms and Computation, (2002), S. 55-66
http://dx.doi.org/10.1007/3-540-36136-7_6
Niggl, Karl-Heinz;
Control structures in programs and computational complexity. - 60 S. = 571,4 KB, Text : Ilmenau, Techn. Univ., Habil.-Schr., 2002
Digitalisat der Druckausg.
http://www.db-thueringen.de/servlets/DocumentServlet?id=3175
Control structures in programs and computational complexity. - 60 S. = 571,4 KB, Text : Ilmenau, Techn. Univ., Habil.-Schr., 2002
Digitalisat der Druckausg.
http://www.db-thueringen.de/servlets/DocumentServlet?id=3175
Dietzfelbinger, Martin
The analysis of a recombinative hill climber on HIFF. - Dortmund : Secretary of the SFB 531, 2002. - 6 Bl. - (Reihe computational intelligence ; 138)
The analysis of a recombinative hill climber on HIFF. - Dortmund : Secretary of the SFB 531, 2002. - 6 Bl. - (Reihe computational intelligence ; 138)
Dietzfelbinger, Martin;
Hagerup, Torben
Simple minimal perfect hashing in less space. - In: Algorithms — ESA 2001, (2001), S. 109-120
http://dx.doi.org/10.1007/3-540-44676-1_9
Simple minimal perfect hashing in less space. - In: Algorithms — ESA 2001, (2001), S. 109-120
http://dx.doi.org/10.1007/3-540-44676-1_9
Dietzfelbinger, Martin; Gambin, Anna; Lasota, Sławomir
On different models for packet flow in multistage interconnection networks. - In: Fundamenta informaticae, ISSN 0169-2968, Bd. 46 (2001), 4, S. 287-314
On different models for packet flow in multistage interconnection networks. - In: Fundamenta informaticae, ISSN 0169-2968, Bd. 46 (2001), 4, S. 287-314