Kurt Mehlhorn - PDFSEARCH.IO - Document Search Engine

Kurt Mehlhorn
Results: 49

#	Item
1	List of Publications a. Survey N. Garg, “Minimizing Average Flow-Time”, Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Lecture Notes in Computer Science: 187-1 Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2013-04-30 00:27:30
2	Kapitel 1 Multiplication of Long Integers (Faster than Long Multiplication) Arno Eigenwillig und Kurt Mehlhorn Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2009-06-09 03:00:18
3	Kurt Mehlhorn Michael Sagraloff Isolating Real Roots of Real Polynomials Add to Reading List Source URL: issac2009.kias.re.kr - Date: 2009-07-31 09:27:46
4	Data Structures and Algorithms The Basic Toolbox Corrections and Remarks Kurt Mehlhorn and Peter Sanders September 2, 2013 In this document, we collect corrections and remarks. Negative line numbers Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-09-02 09:12:49
5	Algorithmen 1970 – 2010 Kurt Mehlhorn Max-Planck-Institut f¨ur Informatik und Universit¨at des Saarlandes Add to Reading List Source URL: people.mpi-inf.mpg.de Language: German - Date: 2009-11-28 05:53:28
6	Network Flow and Equilibrium Computation in the Linear Exchange Economy Kurt Mehlhorn Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-07-07 04:59:59
7	Reliable and Efficient Geometric Computation Kurt Mehlhorn Max-Planck-Institut f¨ur Informatik slides and papers are available at my home page Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2006-06-28 15:12:50
8	Basic Facts about Electrical Networks Kurt Mehlhorn Max Planck Institute for Informatics and Saarland University September 27, 2011 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2011-09-30 08:01:26
9	Seidel’s Randomized Linear Programming Algorithm Kurt Mehlhorn July 7, 2010 I describe Raimund Seidel’s randomized linear programming algorithm [Sei91]. It runs in time O(d!m), where m is the number of constraints an Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2010-07-08 15:06:53
10	Curve and Surface Reconstruction Kurt Mehlhorn MPI f¨ur Informatik Kurt Mehlhorn, MPI f¨ur Informatik Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2005-12-28 11:52:10