Detail page

Media

Rheinische Friedrich-Wilhelms-Universität Bonn. Institut für Informatik

Research report / Institut für Informatik der Universität Bonn

Bonn: Inst. für Informatik, 1985-

Title	Research report / Institut für Informatik der Universität Bonn
Involved	Rheinische Friedrich-Wilhelms-Universität Bonn. Institut für Informatik (Verfasser)
Published	Bonn: Inst. für Informatik 1985-
Publication history	Nachgewiesen 851.1985 -
ISSN	0177-3623
Language	Englisch
Country	Deutschland
Topic	Informatik Mathematik
Other editions	Erscheint auch als Online-Ausgabe: CS-Reports / Institut für Informatik der Universität Bonn, Institut für Informatik, Abteilung V : publications of the Department
Further information	Einzelne Bände zugleich Bände von: Annual progress report / ESPRIT BR Working Group - 7097 (RAND) Einzelne Bände zugleich Bände von: Proceedings of the Bonn Workshop on Foundations of Computing Einzelne Bände zugleich Bände von: ESPRIT BR project RAND REC : (EC US - exploratory collaborative activity - EC US 030) ; annual progress report Einzelne Bände zugleich Bände von: Annual progress report / ESPRIT BR Working Group - 21726 (RAND 2)
Record ID	017392888
In this series show all 1.25 approximation algorithm for the Steiner tree problem with distances one and two 1.375-approximation algorithm for sorting by reversals 1.757 and 1.267 - approximation algorithms for the network and rectilinear Steiner tree problems 1.0957-approximation algorithm for random MAX-3SAT 8/7-approximation algorithm for (1,2)-TSP 8/7-approximation algorithm for (1,2)-TSP 9/8-approximation algorithm for random MAX-3SAT A compendium on Steiner Tree Problems A conjecture about homogeneous and antisymmetric m-schemes A deterministic algorithm for rational function interpolation A fast algorithm for adaptive prefix coding A fast parallel algorithm for computing all maximal cliques in a graph and the related problems A fast randomized parallel algorithm for findig simple cycles in planar graphs A generalization of Wilkie's theorem of the complement, and an application to Pfaffian closure A lower bound for integer multiplication on randomized read once branching programs A lower bound for randomized algebraic decision trees A lower bound on the size of algebraic decision trees for the MAX problem A new algorithm for the ordered tree inclusion problem A new approach to approximation of Steiner trees A new approach to maximum matching in general graphs A new approach to maximum matching in general graphs A new measure of the distance between ordered trees and its applications A note on approximating max bisection on regular graphs A note on improving the running time of a class of parallel algorithms using randomization A note on Las Vegas OBDDs A note on on-line load balancing for related machines A note on the prize collecting bottleneck TSP and related problems A note on traversing skew Merkle trees A parallel algorithm for maximum matching in planar graphs A polynomial time approximation scheme for MAX BISECTION on planar graphs A polynomial time approximation scheme for metric MIN-BISECTION A polynomial time approximation scheme for subdense MAX-CUT A polynomial time subpolynom approximation scheme for the acyclic directed Steiner tree problem A QPTAS for the base of the number of crossing-free structures of a planar point set A QPTAS for the base of the number of triangulations of a planar point set A resolution method for quantified Boolean formulas A silicon retina for face recognition A simple linear time algorithm to find the contour in a coloured triangular graph A simplified realization of the Hopcroft Karp approach to maximum matching in general graphs A survey of efficient parallel algorithms for sparse interpolation over arbitrary field A work efficient algorithm for constructing Huffman codes A zero-test and an interpolation algorithm for the shifted sparse polynomials Algorithmic perspectives of network transitive reduction problems and their applications to synthesis and analysis of biological networks Algorithms for construction of optimal and almost optimal length restricted codes Algorithms for interpolation of sparse rational functions using polynomial number of evaluations Algorithms for sparse rational interpolation Almost optimal sublinear time parallel recognition algorithms for three subclasses of Cfl's Alphabet independent optimal parallel search for three-dimensional patterns Alphabet independent optimal parallel search for three-dimensional patterns : (revised version) Alternation for two-way machines with sublogarithmic space An (ε,δ) [epsilon, delta] approximation algorithm of the number of zeros of a multilinear polynomial over GF[q] An algorithm for multiplication in F256/F4 with 8 essential multiplications An algorithm to learn read once threshold formulas, and some generic transformations between learning models An approximation algorithm for the Bandwidth problem of dense graphs An approximation algorithm for the number of zeros of arbitrary polynomials over GF [q] An efficient data structure for searching strings An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph An exponential lower bound for depth 3 arithmetic circuits An improved pattern matching algorithm for strings with short descriptions

Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

Katalog der Deutschen Nationalbibliothek

Research report / Institut für Informatik der Universität Bonn

1.25 approximation algorithm for the Steiner tree problem with distances one and two

1.375-approximation algorithm for sorting by reversals

1.757 and 1.267 - approximation algorithms for the network and rectilinear Steiner tree problems

1.0957-approximation algorithm for random MAX-3SAT

8/7-approximation algorithm for (1,2)-TSP

8/7-approximation algorithm for (1,2)-TSP

9/8-approximation algorithm for random MAX-3SAT

A compendium on Steiner Tree Problems

A conjecture about homogeneous and antisymmetric m-schemes

A deterministic algorithm for rational function interpolation

A fast algorithm for adaptive prefix coding

A fast parallel algorithm for computing all maximal cliques in a graph and the related problems

A fast randomized parallel algorithm for findig simple cycles in planar graphs

A generalization of Wilkie's theorem of the complement, and an application to Pfaffian closure

A lower bound for integer multiplication on randomized read once branching programs

A lower bound for randomized algebraic decision trees

A lower bound on the size of algebraic decision trees for the MAX problem

A new algorithm for the ordered tree inclusion problem

A new approach to approximation of Steiner trees

A new approach to maximum matching in general graphs

A new approach to maximum matching in general graphs

A new measure of the distance between ordered trees and its applications

A note on approximating max bisection on regular graphs

A note on improving the running time of a class of parallel algorithms using randomization

A note on Las Vegas OBDDs

A note on on-line load balancing for related machines

A note on the prize collecting bottleneck TSP and related problems

A note on traversing skew Merkle trees

A parallel algorithm for maximum matching in planar graphs

A polynomial time approximation scheme for MAX BISECTION on planar graphs

A polynomial time approximation scheme for metric MIN-BISECTION

A polynomial time approximation scheme for subdense MAX-CUT

A polynomial time subpolynom approximation scheme for the acyclic directed Steiner tree problem

A QPTAS for the base of the number of crossing-free structures of a planar point set

A QPTAS for the base of the number of triangulations of a planar point set

A resolution method for quantified Boolean formulas

A silicon retina for face recognition

A simple linear time algorithm to find the contour in a coloured triangular graph

A simplified realization of the Hopcroft Karp approach to maximum matching in general graphs

A survey of efficient parallel algorithms for sparse interpolation over arbitrary field

A work efficient algorithm for constructing Huffman codes

A zero-test and an interpolation algorithm for the shifted sparse polynomials

Algorithmic perspectives of network transitive reduction problems and their applications to synthesis and analysis of biological networks

Algorithms for construction of optimal and almost optimal length restricted codes

Algorithms for interpolation of sparse rational functions using polynomial number of evaluations

Algorithms for sparse rational interpolation

Almost optimal sublinear time parallel recognition algorithms for three subclasses of Cfl's

Alphabet independent optimal parallel search for three-dimensional patterns

Alphabet independent optimal parallel search for three-dimensional patterns : (revised version)

Alternation for two-way machines with sublogarithmic space

An (ε,δ) [epsilon, delta] approximation algorithm of the number of zeros of a multilinear polynomial over GF[q]

An algorithm for multiplication in F256/F4 with 8 essential multiplications

An algorithm to learn read once threshold formulas, and some generic transformations between learning models

An approximation algorithm for the Bandwidth problem of dense graphs

An approximation algorithm for the number of zeros of arbitrary polynomials over GF [q]

An efficient data structure for searching strings

An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph

An exponential lower bound for depth 3 arithmetic circuits

An improved pattern matching algorithm for strings with short descriptions