Katalog der Deutschen Nationalbibliothek

Share-based and envy-based approaches to fair division of indivisible goods

Parallel Algorithms and Architectures : Proceedings of the International Workshop on Parallel Algorithms and Architectures held in Suhl (GDR), May 25–30, 1987

Counting patterns in strings and graphs

Algorithms and Data Structures : Foundations and Probabilistic Methods for Design and Analysis

Algorithmic Results for Clustering and Refined Physarum Analysis

On Flows, Paths, Roots, and Zeros

Computing Equilibria in Markets with Budget-Additive Utilities

Certifying 3-Edge-Connectivity

Sampling from discrete distributions and computing Fréchet distances

Algorithmen und Datenstrukturen : die Grundwerkzeuge

Multiple choice allocations with small maximum loads

Constructive Hopf´s theorem : or how to untangle closed planar curves

Four results on the complexity of VLSI computations

General analysis tool box for controlled perturbation algorithms and complexity and computation of Θ-guarded regions

Hidden line elimination for isooriented rectangles

Toward better computation models for modern machines

A Riemann-Roch theory for sublattices of the root lattice An, graph automorphisms and counting cycles in graphs

Algorithmen und Datenstrukturen

Automata, languages and programming : 39th international colloquium ; proceedings

Pt. 1

Automata, languages and programming : 39th international colloquium ; proceedings

Pt. 2

Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I

Harnessing the power of GPUs for problems in real algebraic geometry

A lower bound for the complexity of the union-split-find problem

Algorithms for routing in planar graphs

An efficient algorithm for constructing nearly optimal prefix codes

An O(n log n) lower bound for the synchronous circuit size of integer multiplication

Arbitrary weight changes in dynamic trees

Binary search trees: average and worst case behavior

Bracket-languages are recognizable in logarithmic space

Can a maximum flow be computed in o(nm) time?

Codes : unequal probabilities, unequal letter costs

Complexity arguments in algebraic language theory

Congruence, similarity and symmetries of geometric objects

Data structures

Dynamic binary search

Dynamic deferred data structuring

Dynamic fractional cascading

Effiziente Algorithmen : ein Beispiel

Faster algorithms for the shortest path problem

Granularity of parallel memories

LEDA : a library of efficient data types and algorithms

Local routing of two-terminal nets is easy : (extended abstract)

Lower bounds on the efficiency of transforming static data structures into dynamic structures (revised)

NP-hard networking problems : exact and approximate algorithms

On the average number of rebalancing operations in weight-balanced trees

On the construction of abstract Voronoi diagrams

On the construction of abstract Voronoi diagrams, II

Polynomially solvable cases of hypergraph transversal and related problems

Routing through a generalized switchbox

Routing through a rectangle

Sorting Jordan sequences in linear time

Sorting presorted files

Space sweep solves intersection of two convex polyhedra elegantly

The HILL system : a design environment for the hierarchical specification, compaction, and simulation of integrated circuit layouts

Top down parsing of macro grammars : (preliminary report)

Toward a complexity theory for randomized search heuristics : black-box models

Untere Schranken für den Platzbedarf bei der kontext-freien Analyse

VLSI complexity, efficient VLSI algorithms and the HILL design system

Algorithms and data structures : the basic toolbox

A Separation Bound for Real Algebraic Expressions

Efficient algorithms : essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday

Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday