Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

	Year		Title	BibTeX cite key
Lutter
Lüttke-Hüttmann
Maggs, Vöcking
Mahajan, Ramos, Subrahmanyam
Mainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, Doerr
Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.)
Malamatos
Manjunath
Manjunath, Mehlhorn, Panagiotou, Sun
Manjunath, Sharma
Mannila, Mehlhorn
Manss
Margewitsch
Martens, Skutella
Matijevic
Maue
Maue, Sanders, Matijevic
Maurer
Mavronicolas, Papatriantafilou, Tsigas
McConnella, Mehlhorn, Näher, Schweitzer
McGeoch, Sanders, Fleischer, Cohen, Precup
Megow
Megow, Mehlhorn, Schweitzer
Megow, Mestre
Megow, Möhring, Schulz
Megow, Skutella, Verschae, Wiese
Megow, Verschae
Mehlhorn
	2010		Reliable and Efficient Geometric Computing In: Mathematical Software, ICMS 2010 : Third International Congress on Mathematical Software, 10-11	Mehlhorn2010
	2007		Matchings in Graphs Variations of the Problem In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2	COCOA07
	2007		Minimum Cycle Bases in Graphs Algorithms and Applications In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14	MehlhornMFCS07
	2006		Reliable and Efficient Geometric Computing In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2	mehlhorn06x
	2005		Minimum Cycle Bases and Surface Reconstruction In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532	mehlhorn05
	2003		The Reliable Algorithmic Software Challenge RASC In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222	mehlhorn03
	2003		The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263	KM03b
	2002		Exact geometric computation In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87	Mehlhorn02
	2001		A Remark on the Sign Variation Method for Real Root Isolation	mehlhorn01c
	2001		From Algorithm to Program to Software Library In: Informatics : 10 years back, 10 years ahead, 268-273	mehlhorn01g
	2000		Constraint Programming and Graph Algorithms In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575	Me:ICALP2000
	1999		Ten Years of LEDA Some Thoughts (Abstract) In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14	mehlhorn99
	1999		The Engineering of Some Bipartite Matching Programs In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3	Mehlhorn99
	1999		The Engineering of Some Bipartite Matching Programs In: Foundations of software technology and theoretical computer science : 19th conference, 446-449	mehlhorn99
	1998		Amortisierte Analyse In: Prinzipien des Algorithmenentwurfs, 91-102	mehlhorn98
	1996		Position Paper for Panel Discussion In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52	mehlhorn96
	1996		The LEDA Platform of Combinatorial and Geometric Computing In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126	mehlhorn96
	1995		Experiences with the implementation of geometric algorithms In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518	Mehlhorn95
	1995		Guest Editor's Foreword In: Discrete and Computational Geometry [14], 363-363	mehlhorn95
	1992		Recent Developments in Algorithms for the Maximum Flow Problem (Abstract) In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404	Mehlhorn92d
	1988		A faster approximation algorithm for the Steiner problem in graphs In: Information Processing Letters [27], 125-128	IPL::Mehlhorn1988
	1988		Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen	mehlhorn88k
	1988		SFB 124: VLSI-Entwurfsmethoden und Parallelität In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29	conf/gi/MehlhornZ88
	1987		A Faster Approximation Algorithm for the Steiner Problem in Graphs	mehlhorn87h
	1986		Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen	mehlhorn86a
	1986		Über Verdrahtungsalgorithmen In: Informatik Spektrum [9], 227-234	mehlhorn86c
	1984		Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof	mehlhorn84
	1984		Data structures and algorithms. Volume 1 : Sorting and searching	mehlhorn84a
	1984		Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness	mehlhorn84b
	1984		Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry	mehlhorn84b
	1984		On Optimal VLSI-Circuits for the Basic Arithmetic Functions In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30	mehlhorn84k
	1984		Über Verdrahtungsalgorithmen In: GI Jahrestagung (Fachgespräche), 79-89	mehlhorn84j
	1984		$AT^2$-optimal VLSI integer division and integer square rooting In: Integration, the VLSI Journal [2], 163-167	mehlhorn84r
	1983		$AT^2$-optimal VLSI for integer division and integer square rooting	mehlhorn83j
	1982		A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions In: SIAM Journal on Computing [11], 748-760	mehlhorn82a
	1982		On the Program Size of Perfect and Universal Hash Functions In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175	mehlhorn82f
	1981		Arbitrary Weight Changes in Dynamic Trees In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211	mehlhorn81d
	1981		Lower bounds on the efficiency of transforming static data structures into dynamic structures In: Mathematical Systems Theory [15], 1-16	mehlhorn81dz
	1980		A New Data Structure for Representing Sorted Lists In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112	mehlhorn80dz
	1980		An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes In: IEEE Transactions on Information Theory [26], 513-517	mehlhorn80f
	1980		Lower bounds on the efficiency of transforming static data structures into dynamic structures	mehlhorn80z
	1980		Pebbling Mountain Ranges and its Application of DCFL-Recognition In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435	mehlhorn80b
	1979		Dynamic Binary Search In: SIAM Journal on Computing [8], 175-198	mehlhorn79bz
	1979		Dynamic data structures In: Mathematical Centre Tracts [108], 71-96	mehlhorn79c
	1979		Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens In: GI - 9. Jahrestagung, 16-22	mehlhorn79e
	1979		Parsing Macro Grammars Top Down In: Information and Control [40], 123-143	mehlhorn79b
	1979		Searching, Sorting and Information Theory In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145	mehlhorn79dz
	1979		Some Remarks on Boolean Sums In: Acta Informatica [12], 371-375	mehlhorn79j
	1979		Some Remarks on Boolean Sums In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380	mehlhorn79d
	1979		Sorting Presorted Files In: Theoretical Computer Science, 4th GI-Conference, 199-212	mehlhorn79h
	1978		An efficient algorithm for constructing nearly optimal prefix codes	mehlhorn78y
	1978		Arbitrary Weight Changes in Dynamic Trees	mehlhorn78z
	1978		Effiziente Algorithmen: Ein Beispiel	mehlhorn78
	1978		Effiziente Algorithmen: Ein Beispiel In: Informatik Spektrum [1], 81-89	mehlhorn78a
	1978		Sorting Presorted Files	mehlhorn78u
	1977		A best possible bound for the weighted path length of binary search trees In: SIAM Journal on Computing [6], 235-239	Mehlhorn77a
	1977		Dynamic Binary Search In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336	mehlhorn77
	1977		Effiziente Algorithmen	mehlhorn77c
	1976		An improved lower bound on the formula complexity of context-free recognition	mehlhorn76v
	1976		An Improved Lower Bound on the Formula Complexity of Context-Free Recognition In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524	Mehlhorn76b
	1976		An O(n log n) lower bound for the synchronous circuit size of integer multiplication	mehlhorn76
	1976		Bracket-languages are recognizable in logarithmic space In: Information Processing Letters [5], 168-170	mehlhorn76f
	1976		Dynamic Binary Search	mehlhorn76x
	1976		Dynamic Binary Search Trees : Extended Abstracts	mehlhorn76w
	1976		Polynomial and abstract subrecursive classes In: Journal of Computer and System Sciences [12], 147-178	Mehlhorn76c
	1975		A game on graphs	mehlhorn75a
	1975		Best possible bounds for the weighted path length of optimum binary search trees In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41	mehlhorn75by
	1975		Bracket-Languages are Recognizable in Logarithmic Space	mehlhorn75z
	1975		Nearly Optimal Binary Search Trees In: Acta Informatica [5], 287-295	mehlhorn75f
	1974		Polynomial and abstract subrecursive classes Cornell University	mehlhorn75b
	1974		Polynomial and abstract subrecursive classes In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14	mehlhorn74
	1974		Polynomial and Abstract Subrecursive Classes In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109 In: Informatik Spektrum, 96-109	mehlhorn74a
	1974		The 'almost all' theory of subrecursive degrees is decidable In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325	Mehlhorn74
	1973		On the Size of Sets of Computable Functions In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196	mehlhorn73a
	1973		On the Size of Sets of Computable Functions In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22	mehlhorn73b
	1973		The "almost all" theory of subrecursive degrees is decidable In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25	mehlhorn73
Mehlhorn (ed.)
Mehlhorn, Burnikel, Fleischer, Schirra
Mehlhorn, Claus, Thomas
Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad
Mehlhorn, Galil
Mehlhorn, Kavitha, Hariharan
Mehlhorn, Meiser, O'Dúnlaing
Mehlhorn, Meiser, Rasch
Mehlhorn, Meyer
Mehlhorn, Michail
Mehlhorn, Michail, Telikepalli, Irving, Paluch
Mehlhorn, Müller, Näher, Schirra, Seel, Uhrig, Ziegler
Mehlhorn, Mutzel
Mehlhorn, Näher
Mehlhorn, Näher, Alt
Mehlhorn, Näher, Nievergelt
Mehlhorn, Näher, Rauch
Mehlhorn, Näher, Schilz, Schirra, Seel, Seidel, Uhrig
Mehlhorn, Näher, Schweitzer
Mehlhorn, Näher, Seel, Seidel, Schilz, Schirra, Uhrig
Mehlhorn, Näher, Uhrig
Mehlhorn, Neumann, Schmidt
Mehlhorn, Osbild, Sagraloff
Mehlhorn, Overmars
Mehlhorn, Paul
Mehlhorn, Paul, Uhrig
Mehlhorn, Preparata
Mehlhorn, Preparata, Sarrafzadeh
Mehlhorn, Priebe
Mehlhorn, Priebe, Schäfer, Sivadasan
Mehlhorn, Ray
Mehlhorn, Rülling
Mehlhorn, Sack
Mehlhorn, Sack, Urrutia
Mehlhorn, Sagraloff
Mehlhorn, Sagraloff, Wang
Mehlhorn, Sanders
Mehlhorn, Schäfer
Mehlhorn, Schirra
Mehlhorn, Schmidt
Mehlhorn, Schweitzer
Mehlhorn, Seel
Mehlhorn, Sharir, Welzl
Mehlhorn, Shermer, Yap
Mehlhorn, Simon
Mehlhorn, Snelting (ed.)
Mehlhorn, Sundar, Uhrig
Mehlhorn, Thiel
Mehlhorn, Trajan (ed.)
Mehlhorn, Tsagarakis
Mehlhorn, Tsakalidis
Mehlhorn, Vishkin
Mehlhorn, Waldmann, Wilhelm
Mehlhorn, Yap
Mehlhorn, Ziegelmann
Mehnert
Mestre
Metzler
Meyer
Meyerhenke, Sauerwald
Meyer, Sanders
Meyer, Sanders, Sibeyn (ed.)
Meyer, Sibeyn
Meyer, Wetzel
Meyer, Zeh
Michail
Miklos, Giesen, Pauly
Miller
Miller, Zaroliagis
Milosavljevic, Morozov, Skraba
Misra, Philip, Raman, Saurabh
Misra, Philip, Raman, Saurabh, Sikdar
Mitchell, Rote, Kettner (ed.)
Mnich, Philip, Saurabh, Suchy
Moehring, Skutella, Stork
Mokbel, Aref, Elbassioni, Kamel
Molter
Moran
Mörig, Scholz, Tscheuschner, Berberich
Mortensen, Pettie
Mourrain, Pion, Schmitt, Técourt, Tsigaridas, Wolpert
Mueck
Müller
Müller, Perez-Gimenez, Wormald
Müller, Rüb, Rülling
Mustafa, Ray
Mutzel
Mutzel, Eades
Mutzel, Gutwenger, Brockenauer, Fialko, Klau, Krüger, Ziegler, Näher, Alberts, Ambras, Koch, Jünger, Buchheim, Leipert
Mutzel, Odenthal, Scharbrodt
Mutzel, Weiskircher
Mutzel, Ziegler
Mütze, Rast, Spöhel
Mütze, Spöhel
Näher, Mehlhorn
Naujoks
Nest
Neukirch
Neumann
Neumann, Haltner, Lehr, Kohlbacher, Lenhof
Neumann, Kohlbacher, Haltner, Lenhof, Lehr
Neumann, Oliveto, Witt
Neumann, Reichel
Neumann, Reichel, Skutella
Neumann, Sudholt, Witt
Neumann, Wegener
Neumann, Witt
Newo Kenmogne
Niedermeier, Reinhard, Sanders
Nissen
Nor, Hermelin, Charlat, Engelstadter, Reuter, Duron
Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot
Nutov, Penn
Oberhauser
Oliveto, Lehre, Neumann
Ossamy
Ost
Ott
Paluch
Panagiotou
Panagiotou, Coja-Oghlan
Panagiotou, Pourmiri, Sauerwald
Panagiotou, Sinha
Panagiotou, Spöhel, Steger, Thomas
Panagiotou, Steger
Panconesi, Papatriantafilou, Tsigas, Vitanyi
Papatriantafilou, Tsigas
Park, Lee, Chwa
Parreira
Pemmaraju, Raman, Varadarajan
Pettie
Pettie, Sanders
Philip
Philip, Raman, Sikdar
Philip, Raman, Villanger
Piskorski
Pohl
Polzin
Polzin, Vahdati Daneshmand
Porkolab, Khachiyan
Portz
Potikoglou
Pouchkarev
Pountourakis, Vidali
Preetham, Krithivasan, Rangan, Sibeyn
Priebe
Pruhs, van Stee, Uthaisombut
Pyrga
Pyrga, Chung
Pyrga, Ray
Pyrga, Schulz, Wagner, Zaroliagis
P. Gao
Qian, Schalekamp, Williamson, van Zuylen
Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)
Rajaraman, Richa, Vöcking, Vuppuluri
Ramos
Ramos, Amato, Goodrich
Rasch
Rathe, Sanders, Knight
Rau
Rauf
Ray
Ray, Mustafa
Ray, Smid, Lange, Wendt
Reichel
Reinert
Reinert, Lenhof, Mehlhorn, Mutzel, Kececioglu
Reinstädtler
Rieger
Rizkallah
Röhrig
Rottmann
Rüb
Ruppert
Rusinov, Schweitzer
Sabo
Sagraloff
Sagraloff, Kerber, Hemmer
Sagraloff, Yap
Saha, Saptharishi, Saxena
Sanders
Sanders, Egner, Korst
Sanders, Egner, Tolhuizen
Sanders, Pettie
Sanders, Reussner, Prechelt, Müller
Sanders, Sibeyn
Sanders, Singler, van Stee
Sanders, Sivadasan, Skutella
Sanders, Solis-Oba
Sanders, Steurer
Sanders, Takkula, Wedelin
Sanders, Träff
Sanders, Vöcking
Sanders, Vollmar, Worsch
Sauerwald, Stauffer
Sauerwald, Sun
Schäfer
Schäfer, Sivadasan
Schalekamp, Williamson, van Zuylen
Schanne
Schilz
Schirra
Schmidt
Schmidt, Valtr
Schmitt
Schmitt, Fousse
Schmitt, Zimmer
Schmitz
Schnorr, Subramanian
Schömer, Reichel, Warken, Lennerz
Schömer, Thiel
Schömer, Wolpert
Schröder
Schulte
Schultes
Schwarzenecker
Schwarz, Karrenbauer, Schehr, Rieger
Schweitzer
Schweitzer, Schweitzer
Schwerdt, Smid, Schirra
Seel
Seidel
Seidel, Wolpert
Seiden
Semeloglou
Sharma
Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt
Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt
Sibeyn
Sibeyn, Abello, Meyer
Sibeyn, Grammatikakis, Hsu, Kraetzl
Sibeyn, Guillaume, Seidel
Sibeyn, Juurlink, Rao
Sibeyn, Kaufmann
Sibeyn, Kaufmann, Chlebus
Sitters
Sitters, Stougie
Sivadasan
Sivadasan, Sanders, Skutella
Smid
Smid, Ray, Wendt, Lange
Solis-Oba
Solis-Oba, Frederickson
Solis-Oba, Jansen, Sviridenko
Son
Soranzo, Ramezani, Iacono, Altafini
Sridharan, Subramanian, Sudha
Srivastava
Stephan
Steurer
Stormer
Subramanian
Subramanian, Fürer, Veni Madhavan
Sviridenko, Wiese
Telikepalli
Telikepalli, Chandran, Subramanian
Telikepalli, Varadarajan
Teramoto, Asano, Katoh, Doerr
Thiel
Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.)
Thome
Thorup
Tiwary, Elbassioni
Träff
Träff, Zaroliagis
van Leeuwen, Mehlhorn, Reps (ed.)
van Stee
van Zuylen
van Zuylen, Schalekamp, Williamson
Vidali
Vingron, Lenhof, Mutzel
Vöcking
von Braunmühl, Cook, Mehlhorn, Verbeek
von Zülow
Wagner, Veeramachaneni, Neumann, O'Reilly
Wahl
Wahlström
Wang
Warken
Warken, Schömer
Weber
Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou
Weinand
Weiskircher
Wendt, Lange, Ray, Smid
Wendt, Lange, Smid, Ray, Tönnies
Wilhelmi
Winzen
Wissen
Wolpert
Xu, Karrenbauer, Soh, Codrea
Xu, Karrenbauer, Soh, Wahl
Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger
Yap, Sagraloff, Sharma
Zaroliagis
Ziegelmann
Ziegenbein
Ziegler
Zosin
Zotenko, Mestre, O'Leary, Przytyzka