Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 2. Titles of all years

Login to this database


 

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

TitleAuthor(s) [non member]Editor(s) [non member]YearType
Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Sanders, Peter
Vöcking, Berthold
2003Journal Article
Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
1993Journal Article
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Frederickson, Grag
Graham, Ron
Hochbaum, Dorit S.
Johnson, Ellis
Kosaraju, S. Rao
Luby, Michae
Megiddo, Nimrod
Schieber, Baruch
Vaidya, Pravin
Yao, Frances
1992Proceedings Article
Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Mehlhorn, KurtVitter, Jeffrey S.
Zaroliagis, Christos D.
1999Proceedings Article
Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk]
Mayr, Ernst W.
[Portier, Natacha]
2014Proceedings Article
Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Mehlhorn, KurtLoeckx, Jacques1974Proceedings Article
The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
[Muthukrishnan, S.]
Träff, Jesper Larsson
[Italiano, Giuseppe]
[Orlando, S.]
1997Proceedings Article
The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Bast, Hannah
Hert, Susan
Bremner, David2000Proceedings Article
The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
Becker, Ruben2012Thesis - Bachelor thesis
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
[Lin, Ming C.]
[Manocha, Dinesh]
[Lin, Ming C.]
1996Proceedings Article
The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
[Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian
[Serna, Maria]
[Shaltiel, Ronen]
[Jansen, Klaus]
[Rolim, José]
2010Proceedings Article
The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
[Lehnert, Jörg]
Schweitzer, Pascal
2007Journal Article
The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Giesen, Joachim[A. Gustafsson]
[A. Herrmann]
[F. Huber]
2007Part of a Book
Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Bast, Holger
Weber, Ingmar
Weikum, Gerhard2007Electronic Proceedings Article
The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Jez, Artur2014Journal Article
Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
[Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.]
2003Journal Article
The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
[Mortensen, Christian Worm]
Pettie, Seth
Dehne, Frank
López-Ortiz, Alejandro
Sack, Jörg-Rüdiger
2005Proceedings Article
The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
1997Journal Article
The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Mutzel, Petra
Ziegler, Thomas
[Kratochvil, Jan]2000Proceedings Article
The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
Mutzel, Petra
Ziegler, Thomas
[Kall, Peter]
[Lüthi, Hans-Jakob]
1999Proceedings Article
The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
2001Proceedings Article
The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Jurkiewicz, Tomasz
Mehlhorn, Kurt
2013Proceedings Article
The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
[Deng, Xiaotie]
Mahajan, Sanjeev
1997Journal Article
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Friedrich, Tobias
[Sauerwald, Thomas]
[Thai, My T.]
[Sahni, Sartaj]
2010Proceedings Article
The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Friedrich, Tobias
Sauerwald, Thomas
2010Electronic Journal Article
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
[Thai, My T.]
[Sahni, Sartaj]
2010Proceedings Article
The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Panagiotou, Konstantinos2009Journal Article
Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
[Klein, Rolf]
Kutz, Martin
2006Proceedings Article
Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Schmitt, SusanneGanzha, Viktor G.
[Mayr, Ernst W.]
[Vorozhtsov, Evgenii V.]
2005Proceedings Article
The Diamond Operator for Real Algebraic NumbersSchmitt, Susanne2003Report
Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen]
2011Journal Article
The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20
[Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
[Amenta, Nina]
[Cheong, Otfried]
2006Proceedings Article
Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Lodaya, Kamal]
[Mahajan, Meena]
2010Proceedings Article
Attachment IconThe Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
[Owe, Olaf]
[Steffen, Martin]
[Telle, Jan Arne]
2011Proceedings Article
The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Mehlhorn, KurtAggarwal, Alok
Rangan, C. Pandu
1999Proceedings Article
The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Mehlhorn, KurtRangan, C. Pandu
Raman, Venkatesh
Ramanujam, R.
1999Proceedings Article
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Fountoulakis, Nikolaos
[Reed, Bruce]
2008Journal Article
The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
Sanders, Peter
[Träff, Jesper Larsson]
[Monien, Burkhard]
[Feldman, Rainer]
2002Proceedings Article
The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Giesen, Joachim2008Journal Article
The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
[Dubhashi, Devdatt]
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
Zaroliagis, Christos
1995Journal Article
The general two-server problem
In: Journal of the ACM [53], 437-458
Sitters, Rene
[Stougie, Leen]
2006Journal Article
The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
[Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene
2006Journal Article
The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Vidali, Angelina[Leonardi, Stefano]2009Proceedings Article
Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsLengauer, Thomas
Mehlhorn, Kurt
1983Report
Attachment IconThe HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149
Lengauer, Thomas
Mehlhorn, Kurt
Penfield, Paul1984Proceedings Article
The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
[Mavronicolas, Marios]
Papatriantafilou, Marina
Tsigas, Philippas
Feitelson, Dror G.
Rudolph, Larry
1997Proceedings Article
Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Mehlhorn, Kurt
Näher, Stefan
[Pehrson, Bjoern]
[Simon, Imre]
1994Proceedings Article
Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Doerr, Benjamin
[Lengler, Johannes]
[Steurer, Daniel]
[Asano, Tetsuo]2006Proceedings Article
The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
[Konwar, Kishori]
Kowalski, Dariusz
[Shvartsman, Alexander]
2004Proceedings Article
Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
Philip, Geevarghese2011Thesis - PhD thesis
The LEDA class real number -- extended versionFunke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan]
2004Report
The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Mayr, Heinrich C.1996Proceedings Article
The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Degano, Pierpaolo
Gorrieri, Roberto
Marchetti-Spaccamela, Alberto
1997Proceedings Article
The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Mehlhorn, KurtHoule, Michael E.
Eades, Peter
1996Proceedings Article
Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
[Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd]
2006Journal Article
The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian]
[Beyer, Hans- Georg]
[Langdon, William]
2011Proceedings Article
The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Elmasry, Amr2010Journal Article
The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
[Boldi, Paolo]
[Gargano, Luisa]
2010Proceedings Article
The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Kötzing, Timo
[Sutton, Andrew M.]
[Neumann, Frank]
[O'Reilly, Una-May]
[Soule, Terence]
[Moore, Jason H.]
2012Proceedings Article
The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
[Bringmann, Karl]
Friedrich, Tobias
2010Proceedings Article
The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos
[Randall, Dana]2011Proceedings Article
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
Jansen, Klaus[Morvan, Michel]
[Meinel, Christoph]
[Krob, Daniel]
1998Proceedings Article
The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj]
2011Journal Article
The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk]
2008Journal Article
The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Hagerup, Torben1995Journal Article
The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
[Jünger, Michael]
Mutzel, Petra
[Tamassia, Roberto]
[Tollis, Ioannis G.]
1995Proceedings Article
The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
2001Proceedings Article
The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Megow, Nicole
[Skutella, Martin]
[Verschae, Jose]
Wiese, Andreas
[Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger]
2012Proceedings Article
The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
[Lermen, Martin]
Reinert, Knut
2000Journal Article
Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
[Chen, Xujin]
Doerr, Benjamin
[Hu, Xiaodong]
[Ma, Weidong]
van Stee, Rob
Winzen, Carola
[Goldberg, Paul W.]2012Proceedings Article
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
[Epstein, Leah]
van Stee, Rob
[Monien, Burkhard]
[Schroeder, Ulf-Peter]
2008Proceedings Article
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
[Epstein, Leah]
van Stee, Rob
2012Journal Article
The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
[Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
[Green Larsen, Kasper]
Mehlhorn, Kurt
Winzen, Carola
2012Electronic Journal Article
The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
[Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
Doerr, Carola
[Larsen, Kasper Green]
Mehlhorn, Kurt
[Brodnik, Andrej]
[López-Ortiz, Alejandro]
[Raman, Venkatesh]
[Viola, Alfredo]
2013Part of a Book
The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Brodal, Gerth Stølting
Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
[Karlsson, Rolf]
[Lingas, Andrzej]
1996Proceedings Article
The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Brodal, Gerth Stølting
Chaudhuri, Shiva
[Radhakrishnan, R.]
1996Journal Article
The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
von Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger
1983Journal Article
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar]
1995Proceedings Article
The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
1995Proceedings Article
The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
[Dasgupta, Bhaskar]
1997Journal Article
The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Elbassioni, Khaled
[Jeli´c, Slobodan]
[Matijevi`c, Domagoj]
2012Journal Article
Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Mehlhorn, Kurt[Jansen, Klaus]
[Margraf, Marian]
[Mastrolli, Monaldo]
[Rolim, José D. P.]
2003Proceedings Article
Attachment IconThe 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
Mehlhorn, Kurt[Klein, Rolf]
[Six, Hans-Werner]
[Wegner, Lutz]
2003Part of a Book
The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Kettner, Lutz
[Rossignac, Jarek]
[Snoeyink, Jack]
2003Journal Article
Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Beier, René
[Röglin, Heiko]
[Vöcking, Berthold]
[Fischettim, Matteo]
[Williamson, David P.]
2007Proceedings Article
The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
[Eigensatz, Michael]
[Giesen, Joachim]
Manjunath, Madhusudan
[Morin, Pat]2008Proceedings Article
Attachment IconThe Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
Chang, Kevin L.
[Kannan, Ravi]
2006Proceedings Article
The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009Proceedings Article
The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Krysta, Piotr
[Pacholski, Leszek]
1999Journal Article
Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.]
[Widmayer, Peter]
[Triguero, Francisco]
[Morales, Rafael]
[Hennessy, Matthew]
[Eidenbenz, Stephan]
[Conejo, Ricardo]
2002Proceedings Article
The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
Fountoulakis, Nikolaos
[Kang, Ross]
[McDiarmid, Colin]
2010Electronic Journal Article
Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
1982Journal Article
The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
[Jünger, Michael]
Mutzel, Petra
[Odenthal, Thomas]
[Scharbrodt, M.]
1998Journal Article
The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998Journal Article
The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
[Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz
2004Proceedings Article
The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
[Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz R.
2007Journal Article
The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
Mehlhorn, Kurt1973Report
The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Chaudhuri, Shiva
Garg, Naveen
[Ravi, R.]
1998Journal Article
Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Friedrich, Tobias
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten]
[Keijzer, Maarten]2008Proceedings Article
Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Neumann, Frank
[Oliveto, Pietro Simone]
[Witt, Carsten]
[Raidl, Günther]
[Rothlauf, Franz]
2009Proceedings Article
Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
[Oliveto, Pietro Simone]
[Lehre, Per Kristian]
Neumann, Frank
2009Proceedings Article
Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Kötzing, Timo
[Neumann, Frank]
[Röglin, Heiko]
[Witt, Carsten]
2012Journal Article
Theoretical aspects of computer science (STACS-84) : [1st] symposiumFontet, M.
Mehlhorn, Kurt
1984Proceedings
Theoretical aspects of computer science (STACS-85) : 2nd annual symposiumMehlhorn, Kurt1985Proceedings
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
[Dorigo, Marco]
[Birattari, Mauro]
[Di Caro, Gianni A.]
[Doursat, René]
[Engelbrecht, Andries P.]
[Floreano, Dario]
[Gambardella, Luca Maria]
[Groß, Roderich]
[Sahin, Erol]
[Sayama, Hiroki]
[Stützle, Thomas]
2010Proceedings Article
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184
[Edelkamp, Stefan]
Meyer, Ulrich
[Baader, F.]
[Brewka, G.]
[Eiter, T.]
2001Proceedings Article
Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Doerr, Benjamin
[Jansen, Thomas]
2011Journal Article
Theory of Randomized Search Heuristics[Auger, Anne]
Doerr, Benjamin
2011Book
Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
Ott, Sebastian2012Thesis - Masters thesis
Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Doerr, Benjamin
Happ, Edda
Klein, Christian
2011Journal Article
Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos
2009Electronic Journal Article
Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Sauerwald, Thomas
Sun, He
[Roughgarden, Tim]2012Proceedings Article
Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
[Andersson, Arne]
Hagerup, Torben
[Hastad, Johan]
[Petersson, Ola]
2000Journal Article
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
[Bringmann, Karl]
Friedrich, Tobias
[Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter]
2010Proceedings Article
Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
[Elsaesser, Robert]
Sauerwald, Thomas
2011Journal Article
Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
[Czumaj, Artur]
Vöcking, Berthold
2002Proceedings Article
Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes
Steurer, David2006Thesis - Bachelor thesis
Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Kettner, Lutz
[Kirkpatrick, David]
[Mantler, Andrea]
[Snoeyink, Jack]
[Speckmann, Bettina]
[Takeuchi, Fumihiko]
2003Journal Article
Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2012Journal Article
Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Kovács, Annamária[Calamoneri, Tiziana]
[Finocchi, Irene]
[Italiano, Giuseppe F.]
2006Proceedings Article
Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
[Cole, Richard]
Hariharan, Ramesh
[Paterson, Mike]
[Zwick, Uri]
1995Journal Article
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
Barnes, Greg
[Edmonds, Jeff A.]
1998Journal Article
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Kowalski, Dariusz
[Pelc, Andrzej]
2005Journal Article
Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Kowalski, Dariusz
[Pelc, Andrzej]
2004Journal Article
Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210
Kowalski, Dariusz
[Pelc, Andrzej]
2003Proceedings Article
To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
[Khuller, Samir]
[Malekian, Azarakhsh]
Mestre, Julián
[Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo]
2007Proceedings Article
Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
Doerr, Benjamin
Kötzing, Timo
Winzen, Carola
[Krasnogor, Natalio]
[Lanzi, Pier Luca]
2011Proceedings Article
Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Heydthausen, Manfred
Mehlhorn, Kurt
Neuhold, Erich J.1976Proceedings Article
Top down parsing of macro grammars (preliminary report)Heydthausen, Manfred
Mehlhorn, Kurt
1976Report
Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53
Funke, Stefan2005Proceedings Article
Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
[de Berg, Marc]
[van Kreveld, Marc]
Schirra, Stefan
1998Journal Article
Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Schäfer, Guido
Sivadasan, Naveen
[Diekert, Volker]
[Habib, Michel]
2004Proceedings Article
Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Winzen, Carola2011Thesis - PhD thesis
Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Jurkiewicz, Tomasz2013Thesis - PhD thesis
Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Doerr, Benjamin
Winzen, Carola
[Kulikov, Alexande]
[Vereshchagin, Nikolay]
2011Proceedings Article
Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
Pettie, Seth2005Proceedings Article
Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232
Chong, Ka Wong
[Lam, Tak Wah]
1996Proceedings Article
Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
[Niedermeier, Rolf]
[Reinhard, Klaus]
Sanders, Peter
2002Journal Article
Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter]
Caires, Luis
Italiano, Giuseppe F.
Monteiro, Luís
Palamidessi, Catuscia
Yung, Moti
2005Proceedings Article
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
2007Proceedings Article
Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
1994Proceedings Article
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
[Schindelhauer, Christian]2005Proceedings Article
Traits classes for polynomial gcd computation over algebraic extensionsHemmer, Michael
[Hülse, Dominik]
2007Report
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Demetrescu, Camil]
[Goldberg, Andrew]
[Johnson, David]
2006Electronic Proceedings Article
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
[Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo]
[Möhring, Rolf]
[Raman, Rajeev]
2002Proceedings Article
Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Kagaris, Dimitrios
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
1999Journal Article
Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Althaus, Ernst
Mehlhorn, Kurt
2001Journal Article
Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Röhrig, Hein1998Thesis - Masters thesis
Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Sanders, Peter[Bode, Arndt]1998Proceedings Article
Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
[Ben-Zwi, Oren]
Hermelin, Danny
[Lokshtanov, Daniel]
[Newman, Ilan]
2011Journal Article
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai]
2007Proceedings Article
Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
[Christodoulou, George]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Saberi, Amin]2010Proceedings Article
Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Hoefer, Martin
[Kesselheim, Thomas]
[Vöcking, Berthold]
2013Proceedings Article
TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Althaus, Ernst
Mehlhorn, Kurt
2000Proceedings Article
TSP Cuts Outside the Template Paradigm
Universität des Saarlandes
Ossamy, Rodrigue2002Thesis - Masters thesis
Two-dimensional packing problems
Universität des Saarlandes
Harren, Rolf2010Thesis - PhD thesis
Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
2008Journal Article
Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Mutzel, Petra
Weiskircher, René
[Chwa, Kyung-Yong]
[Ibarra, Oscar H.]
1998Proceedings Article
Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Kettner, Lutz
[Näher, Stefan]
[Goodman, Jacob E.]
[O'Rourke, Joseph]
2004Part of a Book
Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Kratsch, Stefan
Wahlström, Magnus
[Chen, Jianer]
[Fomin, Fedor V.]
2009Proceedings Article
Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
2008Journal Article
Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Manjunath, Madhusudan2008Thesis - Masters thesis
Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Mehlhorn, Kurt
[Paul, Wolfgang J.]
Ausiello, Giorgio
Dezani-Ciancaglini, Mariangiola
Ronchi Della Rocca, Simonetta
1989Proceedings Article
Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Gawrychowski, Pawel[Dürr, Christoph]
[Wilke, Thomas]
2012Electronic Proceedings Article
Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Bast, Holger
Weber, Ingmar
[Efthimiadis, Efthimis N.]
[Dumais, Susan]
[Hawking, David]
[Järvellin, Kalervo]
2006Proceedings Article
Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Beier, Rene
Vöcking, Berthold
2004Proceedings Article
Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Beier, René
[Vöcking, Berthold]
2006Journal Article
Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89
Mehlhorn, KurtEhrich, Hans-Dieter1984Proceedings Article
Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Mehlhorn, Kurt1986Journal Article
Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
El Kahoui, M'hammed2005Journal Article
Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Sibeyn, Jop F.[Banerjee, Prith]
[Prasanna, Viktor K.]
[Sinha, Bhabani F.]
1999Proceedings Article
Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Fountoulakis, Nikolaos
[Panagiotou, Konstantinos]
[Sauerwald, Thomas]
[Rabani, Yuval]2012Proceedings Article
Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Demetrescu, Camil]
[Goldberg, Andrew V.]
[Johnson, David S.]
2009Part of a Book
Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Jez, Artur
[Okhotin, Alexander]
[Beal, Marie-Pierre]
[Carton, Olivier]
2013Proceedings Article
Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
[Arge, Lars]
[Freivalds, Rusins]
2006Proceedings Article
Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2007Journal Article
Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Doerr, Benjamin
Klein, Christian
[Arun-Kumar, S.]
Garg, Naveen
2006Proceedings Article
Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Newo Kenmogne, Regis2005Thesis - Masters thesis
Uniform generation of d-factors in dense host graphsP. Gao2012Unpublished/Draft
Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
[Eisenbrand, Friedrich]
[Shepherd, F. Bruce]
2010Proceedings Article
Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
[Epstein, Leah]
[Levin, Asaf]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Mestre, Julian
Skutella, Martin
[Stougie, Leen]
2012Journal Article
Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseAlt, Helmut
Mehlhorn, Kurt
1975Report
Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes
Blanchebarbe, Markus1996Thesis - Masters thesis
Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic CurvesBerberich, Eric
[Fogel, Efi]
Meyer, Andreas
2007Report
Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Schröder, Bianca1998Thesis - Masters thesis
Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
[Fellows, Michael R.]
[Fertin, Guillaume]
Hermelin, Danny
[Vialette, Stephane]
2011Journal Article
Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
Karlsson, Rolf
Lingas, Andrzej
1988Proceedings Article
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Elbassioni, Khaled M.
[Lotker, Zvi]
[Seidel, Raimund]
2006Journal Article
Use and Avoidance of Randomness
Universität des Saarlandes
Friedrich, Tobias2007Thesis - PhD thesis
Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Gupta, Arvind
[Mahajan, Sanjeev]
1997Journal Article
Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
[Diedrich, Florian]
Neumann, Frank
2008Proceedings Article
Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
[McGeoch, Catherine]
Sanders, Peter
[Fleischer, Rudolf]
[Cohen, Paul R.]
[Precup, Doina]
[Fleischer, Rudolf]
[Moret, Bernard]
[Meineche Schmidt, Erik]
2002Part of a Book
Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Lenhof, Hans-Peter
Smid, Michiel
1994Journal Article
Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Schweitzer, Pascal2009Journal Article
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Gawrychowski, Pawel
Jez, Artur
[Jez, Lukasz]
2014Journal Article
Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Deussen, Peter
Mehlhorn, Kurt
1977Journal Article
Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Doerr, Benjamin2001Journal Article
Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
[Fiala, Frank]
[Kranakis, Evangelos]
[Sack, Jörg-Rüdiger]
1996Proceedings Article
Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Abo-Hasna, Ziad1994Thesis - Masters thesis
Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Klär, Gerhard1994Thesis - Masters thesis
Verfahren zur Ansteuerung von Matrixanzeigen[Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph]
2005Miscellaneous
Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes
Nest, Martin1998Thesis - Masters thesis
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
[Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine
[Gopalakrishnan, Ganesh]
[Qadeer, Shaz]
2011Proceedings Article
Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Reinstädtler, Martin1998Thesis - Masters thesis
Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
[Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.]
[Karlsson, Rolf]
[Lingas, Andrzej]
1996Proceedings Article
Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Johannsen, Daniel
Panagiotou, Konstantinos
[Charikar, Moses]2010Proceedings Article
Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
Panagiotou, Konstantinos2009Proceedings Article
Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Panagiotou, Konstantinos
[Sinha, Makrand]
2012Journal Article
Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsElmasry, AmrElmasry, Amr2008Report
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468
[Park, Sang-Min]
Lee, Jae-Ha
[Chwa, Kyung-Yong]
[Orejas, Fernando]
[Spirakis, Paul G.]
[Leeuwen, Jan van]
2001Proceedings Article
Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Schanne, Thomas2001Thesis - Masters thesis
Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Emeliyanenko, Pavel2007Thesis - Masters thesis
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Emeliyanenko, Pavel
Kerber, Michael
[Teillaud, Monique]
[Welzl, Emo]
2008Proceedings Article
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationEmeliyanenko, Pavel
Kerber, Michael
2008Report
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
[Bebis, George]
[Boyle, Richard]
[Parvin, Bahram]
[Koracin, Darko]
[Kuno, Yoshinori]
[Wang, Junxian]
[Pajarola, Renato]
[Lindstrom, Peter]
[Hinkenjann, André]
[Encarnação, Miguel L.]
[Silva, Cláudio T.]
[Coming, Daniel]
2009Proceedings Article
Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenKlau, Gunnar W.1998Miscellaneous
VLSI algorithms and architectures : Aegean workshop on computingMakedon, Fillia
Mehlhorn, Kurt
Papatheodorou, Theodore S.
Spirakis, Paul G.
1986Proceedings
VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
[Fürer, Martin]
[Mehlhorn, Kurt]
Makedon, Fillia
Mehlhorn, Kurt
Papatheodorou, Theodore S.
Spirakis, Paul G.
1986Proceedings
VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
[Fürer, Martin]
[Mehlhorn, Kurt]
Makedon, Fillia
Mehlhorn, Kurt
Papatheodorou, Theodore S.
Spirakis, Paul G.
1986Proceedings
VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemLengauer, Thomas
Mehlhorn, Kurt
1983Report
Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Lengauer, Thomas
Mehlhorn, Kurt
Trullemans, C1986Part of a Book
Voronoi diagram of ellipses: CGAL-based implementation[Emiris, Ioannis]
Hemmer, Michael
[Tsigaridas, Elias]
[Tzoumas, Georg]
2008Report
Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Papatriantafilou, Marina
Tsigas, Philippas
1995Proceedings Article
Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Hermelin, Danny
[Wu, Xi]
[Rabani, Yuval]2012Proceedings Article
Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Bradford, Phillip Gnassi
Capoyleas, Vasilis
1997Journal Article
Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Kutz, Martin[Felsner, Stefan]2005Proceedings Article
Attachment IconWeak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244
[Ray, Saurabh]
Mustafa, Nabil H.
2007Proceedings Article
Web-site with benchmark instances for planar curve arrangementsBerberich, Eric
Ebert, Franziska
[Fogel, Efi]
Kettner, Lutz
2006Report
Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244
[Bansal, Nikhil]
Chan, Ho-Leung
[Mathieu, Claire]2009Proceedings Article
Weighted Matchings in General Graphs
Universität des Saarlandes
Schäfer, Guido2000Thesis - Masters thesis
Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
Friedrich, Tobias
[Kroeger, Trent]
[Neumann, Frank]
2012Electronic Journal Article
Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
[Shervashidze, Nino]
Schweitzer, Pascal
[van Leeuwen, Erik Jan]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
2011Journal Article
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
[Fellows, Michael R.]
Hermelin, Danny
[Rosamond, Fraces A.]
2012Journal Article
When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Doerr, Benjamin
[Sudholt, Dirk]
[Witt, Carsten]
2013Proceedings Article
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229
Bansal, Nikhil
[Gupta, Anupam]
[Li, Jian]
Mestre, Julián
[Nagarajan, Viswanath]
[Rudra, Atri]
[de Berg, Mark]
[Meyer, Ulrich]
2010Proceedings Article
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
Sagraloff, Michael2011Electronic Journal Article
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Sagraloff, Michael[van der Hoeven, Joris]
[van Hoeij, Mark]
2012Proceedings Article
When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Friedrich, Tobias
Neumann, Frank
2008Proceedings Article
When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Friedrich, Tobias
Neumann, Frank
2010Journal Article
When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Bast, Holger
Weber, Ingmar
[Broder, Andrei]
[Maarek, Yoelle]
2006Proceedings Article
Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
2012Journal Article
Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Bast, Holger
Majumdar, Debapriyo
[Marchionini, Gary]
[Moffat, Alistair]
[Tait, John]
[Baeza-Yates, Ricardo]
[Ziviani, Nivio]
2005Proceedings Article
Workshop über Komplexitätstheorie, Effiziente Algorithmen und DatenstrukturenMehlhorn, Kurt1987Proceedings
Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
[Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa]
[Bougé, Luc]
[Fraigniaud, Pierre]
[Mignotte, Anne]
[Robert, Yves]
1996Proceedings Article
Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Brodal, Gerth Stølting
Katajainen, Jyrki
[Arnborg, Stefan]
[Ivansson, Lars]
1998Proceedings Article
Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Schäfer, Guido2004Thesis - PhD thesis
Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Kowalski, Dariusz
[Shvartsman, Alex]
2004Proceedings Article
Zeichnen von Diagrammen - Theorie und Praxis
Universität des Saarlandes
Mutzel, Petra1999Thesis - Habilitation thesis
Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Milosavljevic, Nikola
[Morozov, Dmitriy]
[Skraba, Primoz]
2011Proceedings Article
Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Kerzmann, Andreas2000Thesis - Masters thesis
Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
Bramer, Andreas2003Thesis - Masters thesis
Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Peter]
2008Journal Article
$AT^2$-optimal VLSI for integer division and integer square rootingMehlhorn, Kurt1983Report
$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
Mehlhorn, Kurt1984Journal Article
$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Mehlhorn, Kurt
Preparata, F. P.
1983Journal Article
Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
El Kahoui, M'hammed2005Journal Article
Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Mehlhorn, Kurt
[Paul, Wolfgang J.]
Uhrig, C
1992Journal Article
$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Meyer, Ulrich
Sanders, Peter
[Bilardi, Gianfranco]
[Italiano, Giuseppe F.]
[Pietracaprina, Andrea]
[Pucci, Geppino]
1998Proceedings Article
$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Meyer, Ulrich
Sanders, Peter
2003Journal Article
Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Funke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola
[Rappaport, David]2006Proceedings Article
?
In: Conference on High-Performance Computing, 125-130
[Juurlink, Ben]
Mutzel, Petra
1995Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)