Alt, H.; Guibas, L.; Mehlhorn, K.; Karp, R.; Wigderson, A. A method for obtaining randomized algorithms with small tail probabilities. (English) Zbl 0857.68057 Algorithmica 16, No. 4-5, 543-547 (1996). MSC: 68W10 PDFBibTeX XMLCite \textit{H. Alt} et al., Algorithmica 16, No. 4--5, 543--547 (1996; Zbl 0857.68057) Full Text: DOI
Alt, Helmut; Fleischer, Rudolf; Kaufmann, Michael; Mehlhorn, Kurt; Näher, Stefan; Schirra, Stefan; Uhrig, Christian Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. (English) Zbl 0760.68082 Algorithmica 8, No. 5-6, 391-406 (1992). Reviewer: N.Korneenko (Bialystok) MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., Algorithmica 8, No. 5--6, 391--406 (1992; Zbl 0760.68082) Full Text: DOI
Alt, Helmut; Geffert, Viliam; Mehlhorn, Kurt A lower bound for the nondeterministic space complexity of context-free recognition. (English) Zbl 0780.68081 Inf. Process. Lett. 42, No. 1, 25-27 (1992). MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 42, No. 1, 25--27 (1992; Zbl 0780.68081) Full Text: DOI
Alt, H.; Blum, N.; Mehlhorn, K.; Paul, M. Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\). (English) Zbl 0714.68036 Inf. Process. Lett. 37, No. 4, 237-240 (1991). MSC: 68Q25 68R10 05C70 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 37, No. 4, 237--240 (1991; Zbl 0714.68036) Full Text: DOI
Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert; Welzl, Emo Congruence, similarity, and symmetries of geometric objects. (English) Zbl 0679.68070 Discrete Comput. Geom. 3, No. 3, 237-256 (1988). MSC: 68Q25 52A20 20H15 68W99 51F99 PDFBibTeX XMLCite \textit{H. Alt} et al., Discrete Comput. Geom. 3, No. 3, 237--256 (1988; Zbl 0679.68070) Full Text: DOI EuDML
Mehlhorn, Kurt; Näher, Stefan; Alt, Helmut A lower bound on the complexity of the union-split-find problem. (English) Zbl 0676.68015 SIAM J. Comput. 17, No. 6, 1093-1102 (1988). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., SIAM J. Comput. 17, No. 6, 1093--1102 (1988; Zbl 0676.68015) Full Text: DOI DOI
Mehlhorn, K.; Näher, S.; Alt, H. A lower bound for the complexity of the union-split-find problem. (English) Zbl 0635.68033 Automata, languages and programming, Proc. 14th Int. Colloq., Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 267, 479-488 (1987). Reviewer: K.Mehlhorn MSC: 68Q25 68P10 PDFBibTeX XML
Alt, Helmut; Hagerup, Torben; Mehlhorn, Kurt; Preparata, Franco P. Deterministic simulation of idealized parallel computers on more realistic ones. (English) Zbl 0635.68015 SIAM J. Comput. 16, 808-835 (1987). Reviewer: K.Mehlhorn MSC: 68N25 68Q25 PDFBibTeX XMLCite \textit{H. Alt} et al., SIAM J. Comput. 16, 808--835 (1987; Zbl 0635.68015) Full Text: DOI
Alt, H.; Hagerup, T.; Mehlhorn, K.; Preparata, F. P. Deterministic simulation of idealized parallel computers on more realistic ones. (English) Zbl 0617.68051 Mathematical foundations of computer science, Proc. 12th Symp., Bratislava/Czech. 1986, Lect. Notes Comput. Sci. 233, 199-208 (1986). MSC: 68Q05 68Q25 68W99 68N25 PDFBibTeX XML
Alt, Helmut; Mehlhorn, Kurt Searching semisorted tables. (English) Zbl 0578.68049 SIAM J. Comput. 14, 840-848 (1985). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{H. Alt} and \textit{K. Mehlhorn}, SIAM J. Comput. 14, 840--848 (1985; Zbl 0578.68049) Full Text: DOI
Alt, Helmut; Mehlhorn, Kurt; Munro, J. Ian Partial match retrieval in implicit data structures. (English) Zbl 0549.68033 Inf. Process. Lett. 19, 61-65 (1984). MSC: 68Q25 68P20 68P05 PDFBibTeX XMLCite \textit{H. Alt} et al., Inf. Process. Lett. 19, 61--65 (1984; Zbl 0549.68033) Full Text: DOI
Alt, Helmut; Mehlhorn, Kurt; Munro, J. Ian Partial match retrieval in implicit data structures. (English) Zbl 0465.68033 Mathematical foundations of computer science 1981, Proc. 10th Symp., Strbske Pleso/Czech. 1981, Lect. Notes Comput. Sci. 118, 156-161 (1981). MSC: 68P10 68P05 68Q25 PDFBibTeX XML
Alt, Helmut; Mehlhorn, Kurt Complexity arguments in algebraic language theory. (English) Zbl 0421.68048 RAIRO, Inf. Théor. 13, 217-225 (1979). MSC: 68Q25 68Q45 PDFBibTeX XMLCite \textit{H. Alt} and \textit{K. Mehlhorn}, RAIRO, Inf. Théor. 13, 217--225 (1979; Zbl 0421.68048) Full Text: EuDML
Alt, H.; Mehlhorn, K. Lower bounds for the space complexity of context-free recognition. (English) Zbl 0368.68069 Automata, languages and programming, 3rd int. Collog. Edinburgh 1976, 338-354 (1976). MSC: 68Q45 68Q25 03D10 PDFBibTeX XML