Mehlhorn, Kurt On the implementation of combinatorial algorithms for the linear exchange market. (English) Zbl 1331.91088 Zaroliagis, Christos (ed.) et al., Algorithms, probability, networks, and games. Scientific papers and essays dedicated to Paul G. Spirakis on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-24023-7/pbk; 978-3-319-24024-4/ebook). Lecture Notes in Computer Science 9295, 87-94 (2015). MSC: 91B26 68Q25 91B52 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 9295, 87--94 (2015; Zbl 1331.91088) Full Text: DOI
Manlove, David F. [Mehlhorn, Kurt] Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. (English) Zbl 1283.68018 Series on Theoretical Computer Science 2. Hackensack, NJ: World Scientific (ISBN 978-981-4425-24-7/hbk; 978-981-4425-26-1/ebook). xxxi, 491 p. (2013). Reviewer: Vladimír Lacko (Košice) MSC: 68-02 68Wxx 05C70 91B68 90C35 PDFBibTeX XMLCite \textit{D. F. Manlove}, Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn. Hackensack, NJ: World Scientific (2013; Zbl 1283.68018) Full Text: DOI
Mehlhorn, Kurt Reliable and efficient geometric computing. (English) Zbl 1294.68143 Fukuda, Komei (ed.) et al., Mathematical software – ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13–17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15581-9/pbk). Lecture Notes in Computer Science 6327, 10-11 (2010). MSC: 68U05 65D17 65D18 68U07 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 6327, 10--11 (2010; Zbl 1294.68143) Full Text: DOI
Mehlhorn, Kurt Reliable geometric computing. (English) Zbl 1209.68587 Waldmann, Karl-Heinz (ed.) et al., Operations research proceedings 2006. Selected papers of the annual international conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6–8, 2006. Berlin: Springer (ISBN 978-3-540-69994-1/pbk). 111 (2007). MSC: 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, in: Operations research proceedings 2006. Selected papers of the annual international conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6--8, 2006. Berlin: Springer. 111 (2007; Zbl 1209.68587) Full Text: DOI
Mehlhorn, Kurt Matchings in graphs. Variations of the problem. (English) Zbl 1175.90336 Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 1-2 (2007). MSC: 90C27 05C70 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 4616, 1--2 (2007; Zbl 1175.90336) Full Text: DOI Link
Mehlhorn, Kurt Minimum cycle bases in graphs. Algorithms and applications. (English) Zbl 1147.68610 Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 13-14 (2007). MSC: 68R10 05C38 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 4708, 13--14 (2007; Zbl 1147.68610) Full Text: DOI Link
Mehlhorn, Kurt Reliable and efficient geometric computing. (English) Zbl 1131.68565 Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 2 (2006). MSC: 68U05 68U07 68W05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 4168, 2 (2006; Zbl 1131.68565) Full Text: DOI
Mehlhorn, Kurt Reliable and efficient geometric computing. (English) Zbl 1183.68670 Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 6th Italian conference, CIAC 2006, Rome, Italy, May 29–31, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34375-X/pbk). Lecture Notes in Computer Science 3998, 1-2 (2006). MSC: 68U05 68W01 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 3998, 1--2 (2006; Zbl 1183.68670) Full Text: DOI
Mehlhorn, Kurt Minimum cycle bases and surface reconstruction. (Abstract). (English) Zbl 1171.68631 Healy, Patrick (ed.) et al., Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12–14, 2005. Revised papers. Berlin: Springer (ISBN 3-540-31425-3/pbk). Lecture Notes in Computer Science 3843, 532 (2006). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 3843, 532 (2006; Zbl 1171.68631) Full Text: DOI
Mehlhorn, Kurt The reliable algorithmic software challenge RASC. (English) Zbl 1023.68885 Jansen, Klaus (ed.) et al., Experimental and efficient algorithms. Second international workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2647, 222 (2003). MSC: 68W99 68N99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 2647, 222 (2003; Zbl 1023.68885) Full Text: Link
Mehlhorn, Kurt The reliable algorithmic software challenge RASC. (English) Zbl 1023.68884 Klein, Rolf (ed.) et al., Computer science in perspective. Essays dedicated to Thomas Ottmann. Berlin: Springer. Lect. Notes Comput. Sci. 2598, 255-263 (2003). MSC: 68W99 68N99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 2598, 255--263 (2003; Zbl 1023.68884) Full Text: Link
Mehlhorn, Kurt Constraint programming and graph algorithms. (English) Zbl 0973.68252 Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 571-575 (2000). MSC: 68U99 68N19 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 1853, 571--575 (2000; Zbl 0973.68252)
Mehlhorn, Kurt (ed.) Special issue: Second workshop on algorithm engineering (WAE 98), Saarbrücken, Germany, August 20-22, 1998. Selected papers. (English) Zbl 1068.68504 ACM J. Exp. Algorithm. 4, Spec. Iss., articles 3-8 (1999). MSC: 68-06 00B25 PDFBibTeX XMLCite \textit{K. Mehlhorn} (ed.), ACM J. Exp. Algorithm. 3, articles 3--8 (1999; Zbl 1068.68504) Full Text: DOI Link
Mehlhorn, Kurt The engineering of some bipartite matching programs. (English) Zbl 0970.68686 Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 1-3 (1999). MSC: 68U99 68W05 68R10 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 1741, 1--3 (1999; Zbl 0970.68686)
Mehlhorn, Kurt (ed.) Special issue: 10th ACM Symposium on Computational Geometry. Selected papers from the Symposium held in Stony Brook, New York, USA, June 6–8, 1994. (English) Zbl 1133.52300 Discrete Comput. Geom. 14, No. 4, 363-479 (1995). MSC: 52-06 68-06 00B25 52B55 68U05 PDFBibTeX XMLCite \textit{K. Mehlhorn} (ed.), Discrete Comput. Geom. 14, No. 4, 363--479 (1995; Zbl 1133.52300) Full Text: DOI
Mehlhorn, Kurt A faster approximation algorithm for the Steiner problem in graphs. (English) Zbl 0635.68071 Inf. Process. Lett. 27, No. 3, 125-128 (1988). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Inf. Process. Lett. 27, No. 3, 125--128 (1988; Zbl 0635.68071) Full Text: DOI
Mehlhorn, Kurt Data structures and efficient algorithms. Vol. 1: Sorting and searching. 2. Aufl. (Datenstrukturen und effiziente Algorithmen. Band 1: Sortieren und Suchen. Nach der englischen Fassung durchgesehen und ins Deutsche übertragen von Hans Rohnert.) (German) Zbl 0637.68063 Leitfäden und Monographien der Informatik. Stuttgart: B. G. Teubner. X, 317 S.; DM 48.00 (1988). MSC: 68P10 68-02 68Q25 68W99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Datenstrukturen und effiziente Algorithmen. Band 1: Sortieren und Suchen. Nach der englischen Fassung durchgesehen und ins Deutsche übertragen von Hans Rohnert. 2. Aufl. Stuttgart: B.G. Teubner (1988; Zbl 0637.68063)
Mehlhorn, Kurt Datenstrukturen und effiziente Algorithmen. Band 1: Sortieren und Suchen. Nach der englischen Fassung durchgesehen und ins Deutsche übertragen von Hans Rohnert. (German) Zbl 0608.68055 Leitfäden und Monographien der Informatik. Stuttgart: B. G. Teubner. X, 314 S. DM 42.00 (1986). Reviewer: D.Fisher MSC: 68P10 68-02 68Q25 68W99 PDFBibTeX XML
Trullemans, Ch. (ed.) [Lea, R. M.; Lengauer, T.; Mehlhorn, K.; Anceau, F.] Algorithmics for VLSI. (English) Zbl 0716.68008 International Lecture Series in Computer Science. London etc.: Academic Press. xii, 131 p. (1986). Reviewer: Bernd Becker (Frankfurt/Main) MSC: 68-06 68M07 68W35 68M01 PDFBibTeX XMLCite \textit{Ch. Trullemans} (ed.), Algorithmics for VLSI. London etc.: Academic Press (1986; Zbl 0716.68008)
Mehlhorn, K. (ed.) STACS 85. 2nd annual symposium on theoretical aspects of computer science. Saarbrücken, January 3–5, 1985. (English) Zbl 0561.00020 Lecture Notes in Computer Science, 182. Berlin etc.: Springer-Verlag. VII, 374 p. DM 45.00 (1985). MSC: 00Bxx 68-06 PDFBibTeX XML
Mehlhorn, Kurt Optimal VLSI-circuits for the basic arithmetic functions. (English) Zbl 0576.94032 Trees in algebra and programming, 9th Colloq., Bordeaux/France 1984, 23-30 (1984). MSC: 94C10 68Q25 PDFBibTeX XML
Mehlhorn, Kurt Data structures and algorithms 3: Multi-dimensional searching and computational geometry. Transl. from the German. (English) Zbl 0556.68003 EATCS. Monographs on Theoretical Computer Science, 3. Berlin etc.: Springer-Verlag. XII, 284 p. DM 48.00 (1984). Reviewer: P.Brucker MSC: 68-02 68W99 68Q25 68P10 68R99 PDFBibTeX XML
Mehlhorn, Kurt Data structures and algorithms 2: Graph algorithms and NP-completeness. Transl. from the German. (English) Zbl 0556.68002 EATCS. Monographs on Theoretical Computer Science, 2. Berlin etc.: Springer-Verlag. XII, 260 p. DM 48.00 (1984). Reviewer: P.Brucker MSC: 68-02 68W99 68Q25 68R10 PDFBibTeX XML
Mehlhorn, Kurt Data structures and algorithms 1: Sorting and searching. Transl. from the German. (English) Zbl 0556.68001 EATCS. Monographs on Theoretical Computer Science, 1. Berlin etc.: Springer-Verlag. XII, 336 p. DM. 48.00 (1984). Reviewer: P.Brucker MSC: 68-02 68W99 68Q25 68P10 PDFBibTeX XML
Mehlhorn, Kurt Lower bounds on the efficiency of transforming static data structures into dynamic structures. (English) Zbl 0536.68046 Graphtheoretic concepts in computer science, Proc. 7th Conf., Linz/Austria 1981, 265-277 (1982). MSC: 68Q25 68P05 PDFBibTeX XML
Mehlhorn, Kurt A partial analysis of height-balanced trees under random insertions and deletions. (English) Zbl 0496.68029 SIAM J. Comput. 11, 748-760 (1982). MSC: 68Q25 68R10 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, SIAM J. Comput. 11, 748--760 (1982; Zbl 0496.68029) Full Text: DOI
Mehlhorn, Kurt Some remarks on Boolean sums. (Russian) Zbl 0551.94022 Kibern. Sb., Nov. Ser. 18, 39-45 (1981). MSC: 94C10 68Q25 68R99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Kibern. Sb., Nov. Ser. 18, 39--45 (1981; Zbl 0551.94022)
Mehlhorn, Kurt Lower bounds on the efficiency of transforming static data structures into dynamic structures. (English) Zbl 0482.68057 Math. Syst. Theory 15, 1-16 (1981). MSC: 68P10 68Q25 68P05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Math. Syst. Theory 15, 1--16 (1981; Zbl 0482.68057) Full Text: DOI
Mehlhorn, Kurt Arbitrary weight changes in dynamic trees. (English) Zbl 0467.68022 RAIRO, Inf. Théor. 15, 183-211 (1981). MSC: 68P05 68P10 68T50 68P20 PDFBibTeX XMLCite \textit{K. Mehlhorn}, RAIRO, Inf. Théor. 15, 183--211 (1981; Zbl 0467.68022) Full Text: EuDML
Mehlhorn, Kurt A new data structure for representing sorted lists. (English) Zbl 0454.68058 Graphtheoretic concepts in computer science, Proc. int. Workshop, Bad Honnef 1980, Lect. Notes Comput. Sci. 100, 90-112 (1981). MSC: 68P10 68P05 PDFBibTeX XML
Mehlhorn, Kurt Pebbling mountain ranges and its application to DCFL-recognition. (English) Zbl 0445.68033 Automata, languages and programming, 7th Colloq., Noordwijkerhout/ Netherlands 1980, Lect. Notes Comput. Sci. 85, 422-435 (1980). MSC: 68Q25 68Q45 68Q05 PDFBibTeX XML
Mehlhorn, Kurt An efficient algorithm for constructing nearly optimal prefix codes. (English) Zbl 0439.94017 IEEE Trans. Inf. Theory 26, 513-517 (1980). MSC: 94A45 94A24 68Q25 68T99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, IEEE Trans. Inf. Theory 26, 513--517 (1980; Zbl 0439.94017) Full Text: DOI
Mehlhorn, Kurt Some remarks on Boolean sums. (English) Zbl 0421.94022 Acta Inf. 12, 371-375 (1979). MSC: 94C10 68Q25 68R99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Acta Inf. 12, 371--375 (1979; Zbl 0421.94022) Full Text: DOI
Mehlhorn, Kurt Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens. (German) Zbl 0412.68038 GI, 9. Jahrestag., Bonn 1979, Inf.-Fachber. 19, 14-22 (1979). MSC: 68Q25 68P10 PDFBibTeX XML
Mehlhorn, Kurt Parsing macro grammars top down. (English) Zbl 0409.68044 Inf. Control 40, 123-143 (1979). MSC: 68N20 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Inf. Control 40, 123--143 (1979; Zbl 0409.68044) Full Text: DOI
Mehlhorn, Kurt Some remarks on Boolean sums. (English) Zbl 0408.94025 Mathematical foundations of computer science, Proc. 8th Symp., Olomouc/Czech. 1979, Lect. Notes Comput. Sci. 74, 375-380 (1979). MSC: 94C99 94C10 94C15 68Q25 PDFBibTeX XML
Mehlhorn, Kurt Searching, sorting and information theory. (English) Zbl 0408.68057 Mathematical foundations of computer science, Proc. 8th Symp., Olomouc/Czech. 1979, Lect. Notes Comput. Sci. 74, 131-145 (1979). MSC: 68R10 68P10 68Q25 94A15 68P05 PDFBibTeX XML
Mehlhorn, Kurt Dynamic binary search. (English) Zbl 0408.68056 SIAM J. Comput. 8, 175-198 (1979). MSC: 68R10 68P05 68Q25 94A15 PDFBibTeX XMLCite \textit{K. Mehlhorn}, SIAM J. Comput. 8, 175--198 (1979; Zbl 0408.68056) Full Text: DOI
Mehlhorn, K. Dynamic data structures. (English) Zbl 0408.68055 Foundations of computer science. III. Part 1: Automata, data structures, complexity, 3rd adv. Course, Amsterdam 1978, Math. Cent. Tracts 108, 71-96 (1979). MSC: 68P10 68R99 68P05 94A15 68Q25 PDFBibTeX XML
Mehlhorn, Kurt Sorting presorted files. (English) Zbl 0395.68054 Theor. Comput. Sci., 4th GI Conf, Aachen, 1979. Lect. Notes Comput. Sci. 67, 199-212 (1979). MSC: 68P10 68P05 PDFBibTeX XML
Mehlhorn, Kurt Effiziente Algorithmen: Ein Beispiel. (German) Zbl 0489.68028 Inf.-Spektrum 1, 81-89 (1978). MSC: 68W99 68P10 68Q25 PDFBibTeX XML
Mehlhorn, Kurt On digital tree searching. (English) Zbl 0383.68055 Arbres en Algebre et Program., 3eme Coll. Lille 1978, 233-236 (1978). MSC: 68R99 05C05 68R10 68Q25 PDFBibTeX XML
Mehlhorn, Kurt A best possible bound for the weighted path length of binary search trees. (English) Zbl 0362.68072 SIAM J. Comput. 6, 235-239 (1977). MSC: 68W99 68Q25 68N01 05C05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, SIAM J. Comput. 6, 235--239 (1977; Zbl 0362.68072) Full Text: DOI
Mehlhorn, Kurt Effiziente Algorithmen. (German) Zbl 0357.68041 Leitfäden der angewandten Mathematik und Mechanik. Bd. 41. Teubner Studienbücher: Informatik. Stuttgart: B. G. Teubner. 240 S., zahlr. Fig. und Beisp., 71 Aufg. DM 24.80 (1977). MSC: 68-02 68W99 68Q25 PDFBibTeX XML
Mehlhorn, Kurt Dynamic binary search. (English) Zbl 0354.68061 Automata, languages and programming, 4th Colloq., Turku 1977, Lect. Notes Comput. Sci. 52, 323-336 (1977). MSC: 68W99 PDFBibTeX XML
Mehlhorn, Kurt An improved lower bound on the formula complexity of context-free recognition. (English) Zbl 0361.68075 Elektron. Inform.-verarb. Kybernetik 12, 523-524 (1976). MSC: 68Q25 68Q45 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Elektron. Informationsverarbeitung Kybernetik 12, 523--524 (1976; Zbl 0361.68075)
Mehlhorn, Kurt Bracket-languages are recognizable in logarithmic space. (English) Zbl 0352.68089 Inf. Process. Lett. 5, 168-170 (1976). MSC: 68Q45 68Q25 68W99 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Inf. Process. Lett. 5, 168--170 (1976; Zbl 0352.68089) Full Text: DOI DOI
Mehlhorn, Kurt Polynomial and abstract subrecursive classes. (English) Zbl 0329.68049 J. Comput. Syst. Sci. 12, 147-178 (1976). MSC: 68Q25 68W99 68Q45 03D20 03D25 PDFBibTeX XMLCite \textit{K. Mehlhorn}, J. Comput. Syst. Sci. 12, 147--178 (1976; Zbl 0329.68049) Full Text: DOI
Mehlhorn, Kurt Nearly optimal binary search trees. (English) Zbl 0333.68028 Acta Inf. 5, 287-295 (1975). MSC: 68W99 68N01 68P20 68Q25 05C05 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Acta Inf. 5, 287--295 (1975; Zbl 0333.68028) Full Text: DOI
Mehlhorn, Kurt Best possible bounds on the weighted path length of optimum binary search trees. (English) Zbl 0313.68034 Autom. Theor. form. Lang., 2nd GI Conf., Kaiserslautern 1975, Lect. Notes Comput. Sci. 33, 31-41 (1975). MSC: 68Q25 68W99 68N01 PDFBibTeX XML
Mehlhorn, Kurt Polynomial and abstract subrecursive classes. (English) Zbl 0363.68063 Proc. 6th ann. ACM Symp. Theory Comput., Seattle 1974, 96-109 (1974). MSC: 68Q25 03D20 PDFBibTeX XML
Mehlhorn, Kurt The ’almost all’ theory of subrecursive degrees is decidable. (English) Zbl 0284.68041 Automata, Languages, Progr.; 2nd Colloqu., Univ. Saarbrücken, Lecture Notes Computer Sci. 14, 317-325 (1974). MSC: 68Q25 03D30 03B25 PDFBibTeX XML