Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decomposing a star graph into disjoint cycles
K. Qiu
,
H. Meijer
,
S. Akl
Information Processing Letters
39
, 1991, pp. 125-129
Stable set and multiset operations in optimal time and space
Bing-Chao Huang
,
Michael A. Langston
Information Processing Letters
39
, 1991, pp. 131-136
The Vapnik-Chervonenkis dimension of decision trees with bounded rank
Hans Ulrich Simon
Information Processing Letters
39
, 1991, pp. 137-141
Linear-size constant-depth polylog-threshold circuits
Prabhakar Ragde
,
Avi Wigderson
Information Processing Letters
39
, 1991, pp. 143-146
A self-stabilizing algorithm for constructing spanning trees
Nian-Shing Chen
,
Hwey-Pyng Yu
,
Shing-Tsaan Huang
Information Processing Letters
39
, 1991, pp. 147-151
The translation square map and approximate congruence
Paul J. Heffernan
Information Processing Letters
39
, 1991, pp. 153-159
Order independent NCE grammars recognized in polynomial time
Janice Jeffs
Information Processing Letters
39
, 1991, pp. 161-164
A fuzzy Petri net for knowledge representation and reasoning
M.L. Garg
,
S.I. Ahson
,
P.V. Gupta
Information Processing Letters
39
, 1991, pp. 165-171
Some observations on skip-lists
Sandeep Sen
Information Processing Letters
39
, 1991, pp. 173-176
Inductive inference from all positive and some negative data
Tatsuya Motoki
Information Processing Letters
39
, 1991, pp. 177-182
Randomized optimal algorithm for slope selection
Jiȓí Matous̑ek
Information Processing Letters
39
, 1991, pp. 183-187
A loopless algorithm for generating binary tree sequences
D. Roelants van Baronaigien
Information Processing Letters
39
, 1991, pp. 189-194
An optimal parallel adaptive sorting algorithm
Svante Carlsson
,
Jingsen Chen
Information Processing Letters
39
, 1991, pp. 195-200
Fixed-radius near neighbors search
Volker Turau
Information Processing Letters
39
, 1991, pp. 201-203
Splitsort - An adaptive sorting algorithm
Christos Levcopoulos
,
Ola Petersson
Information Processing Letters
39
, 1991, pp. 205-211
Systematic choice of initial points in local search: Extensions and application to neural networks
Robert J.T. Morris
,
Wing Shing Wong
Information Processing Letters
39
, 1991, pp. 213-217
Some notes on threshold circuits, and multiplication in depth 4
Thomas Hofmeister
,
Walter Hohberg
,
Susanne Köhling
Information Processing Letters
39
, 1991, pp. 219-225
Finding large holes
Jeremy P. Spinrad
Information Processing Letters
39
, 1991, pp. 227-229
Trigonometric polynomials with simple roots
Achim Schweilard
Information Processing Letters
39
, 1991, pp. 231-236
Analysis of a greedy heuristic for finding small dominating sets in graphs
Abhay K. Parekh
Information Processing Letters
39
, 1991, pp. 237-240
A remark on
NP
-completeness of picture matching
Maurizio Tucci
,
Gennaro Costagliola
,
Shi-Kuo Chang
Information Processing Letters
39
, 1991, pp. 241-243
The complexity of the reliable connectivity problem
Dimitris Kavadias
,
Lefteris M. Kirousis
,
Paul Spirakis
Information Processing Letters
39
, 1991, pp. 245-252
Analysis of an asynchronous PRAM algorithm
Prabhakar Ragde
Information Processing Letters
39
, 1991, pp. 253-256
An integrated approach to routing and via minimization
D. Sreenivasa Rao
,
John D. Provence
Information Processing Letters
39
, 1991, pp. 257-263
Inversion of a recursive tree traversal
Jan L.A. van de Snepscheut
Information Processing Letters
39
, 1991, pp. 265-267
Seiten
<
1
2
3
4
5
6
7
8
9
10
>