Author of the publication

Improving the Average Delay of Sorting.

, , , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 330-341. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Dynamic Kernels for Hitting Sets and Set Packing., , , and . IPEC, volume 214 of LIPIcs, page 7:1-7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Hardness of k-anonymous microaggregation., and . Discret. Appl. Math., (2021)Learning 1-variable Pattern Languages in Linear Average Time, and . Proceedings of the Eleventh Annual Conference on Computational Learning Theory, page 198--208. (1998)Improving Time Complexity and Utility of k-anonymous Microaggregation., and . ICETE (Selected Papers), volume 1795 of Communications in Computer and Information Science, page 195-223. Springer, (2021)Learning residual alternating automata., , , and . Inf. Comput., 289 (Part): 104981 (2022)The kangaroo problem.. Theor. Comput. Sci., (2022)Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss., and . SECRYPT, page 87-98. SCITEPRESS, (2021)Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle.. GI Jahrestagung, volume 156 of Informatik-Fachberichte, page 65-81. Springer, (1987)Improving the Average Delay of Sorting., , , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 330-341. Springer, (2007)Über den Nutzen von Orakelfragen bei nichtdeterministischen Kommunikationsprotokollen., and . Informatik, volume 1 of Teubner-Texte zur Informatik, Teubner / Springer, (1992)