Searching algorithms

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

ISBN: 9783322004338
3322004333

Dimensions: 21 cm

Extent: 123 S.

Edition: 1. Aufl.

Language: Deutsch

Notes: Literaturverz. S. 115 - 123

Bibliographic citation: Teubner-Texte zur Mathematik ; Bd. 99

Keyword: Suchverfahren
Suchtheorie (Mathematik)
Suchtheorie

Event: Veröffentlichung

(where): Leipzig

(who): Teubner

(when): 1987

Creator: Wiedermann, Jiří

Table of contents: https://d-nb.info/871281546/04

Rights: Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.

Last update: 11.06.2025, 2:11 PM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

Wiedermann, Jiří
Teubner

Time of origin

1987

Other Objects (12)

Labyrinth problems : labyrinth searching abilities of automata

Combinatorial algorithms for integrated circuit layout

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

Data structures and algorithms, 1.. Sorting and searching

Fundamentals of the average case analysis of particular algorithms

VLSI-implemented algorithms for fundamental searching and sorting problems

Algorithms of intrinsic complexity for point searching in real singular hypersurfaces

mehrbändiges Werk

Schaffen und Schauen : ein Führer ins Leben

mehrbändiges Werk

Reußisches Lesebuch

mehrbändiges Werk

Teubners Lesebuch für die baltischen Lande

Band

Teil 4, [Schülerbd.]: [Teil 4, [Schülerbd.]]

Band

Teil 1: [Teil 1]

Labyrinth problems : labyrinth searching abilities of automata

Combinatorial algorithms for integrated circuit layout

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

Data structures and algorithms, 1.. Sorting and searching

Fundamentals of the average case analysis of particular algorithms

VLSI-implemented algorithms for fundamental searching and sorting problems

Algorithms of intrinsic complexity for point searching in real singular hypersurfaces

mehrbändiges Werk

Schaffen und Schauen : ein Führer ins Leben

mehrbändiges Werk

Reußisches Lesebuch

mehrbändiges Werk

Teubners Lesebuch für die baltischen Lande

Band

Teil 4, [Schülerbd.]: [Teil 4, [Schülerbd.]]

Band

Teil 1: [Teil 1]

Labyrinth problems : labyrinth searching abilities of automata

Combinatorial algorithms for integrated circuit layout

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

Data structures and algorithms, 1.. Sorting and searching

Fundamentals of the average case analysis of particular algorithms

VLSI-implemented algorithms for fundamental searching and sorting problems

Algorithms of intrinsic complexity for point searching in real singular hypersurfaces

mehrbändiges Werk

Schaffen und Schauen : ein Führer ins Leben

mehrbändiges Werk

Reußisches Lesebuch

mehrbändiges Werk

Teubners Lesebuch für die baltischen Lande

Band

Teil 4, [Schülerbd.]: [Teil 4, [Schülerbd.]]

Band

Teil 1: [Teil 1]

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Searching algorithms

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Labyrinth problems : labyrinth searching abilities of automata

Combinatorial algorithms for integrated circuit layout

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

Data structures and algorithms, 1.. Sorting and searching

Fundamentals of the average case analysis of particular algorithms

VLSI-implemented algorithms for fundamental searching and sorting problems

Algorithms of intrinsic complexity for point searching in real singular hypersurfaces

Schaffen und Schauen : ein Führer ins Leben

Reußisches Lesebuch

Teubners Lesebuch für die baltischen Lande

Teil 4, [Schülerbd.]: [Teil 4, [Schülerbd.]]

Teil 1: [Teil 1]

Labyrinth problems : labyrinth searching abilities of automata

Combinatorial algorithms for integrated circuit layout

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

Data structures and algorithms, 1.. Sorting and searching

Fundamentals of the average case analysis of particular algorithms

VLSI-implemented algorithms for fundamental searching and sorting problems

Algorithms of intrinsic complexity for point searching in real singular hypersurfaces

Schaffen und Schauen : ein Führer ins Leben

Reußisches Lesebuch

Teubners Lesebuch für die baltischen Lande

Teil 4, [Schülerbd.]: [Teil 4, [Schülerbd.]]

Teil 1: [Teil 1]

Labyrinth problems : labyrinth searching abilities of automata

Combinatorial algorithms for integrated circuit layout

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

Data structures and algorithms, 1.. Sorting and searching

Fundamentals of the average case analysis of particular algorithms

VLSI-implemented algorithms for fundamental searching and sorting problems

Algorithms of intrinsic complexity for point searching in real singular hypersurfaces

Schaffen und Schauen : ein Führer ins Leben

Reußisches Lesebuch

Teubners Lesebuch für die baltischen Lande

Teil 4, [Schülerbd.]: [Teil 4, [Schülerbd.]]

Teil 1: [Teil 1]

Related objects

Reset password