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 Volume=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of test case generation for
NP
-hard problems
Laura A. Sanchis
Information Processing Letters
36
(Sato/97), 1990, pp. 135-140
The optimum execution order of queries in linear storage
John G. Kollias
,
Yannis Manolopoulos
,
Christos H. Papadimitriou
Information Processing Letters
36
, 1990, pp. 141-145
An optimal algorithm with unknown time complexity for convex matrix searching
Lawrence L. Larmore
Information Processing Letters
36
, 1990, pp. 147-151
A fast parallel algorithm to recognize partitionable graphs
R. Lin
,
S. Olariu
Information Processing Letters
36
, 1990, pp. 153-157
Worst-case analysis of a generalized heapsort algorithm
A. Paulik
Information Processing Letters
36
, 1990, pp. 159-165
Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing
Kim-Heng Teo
,
Tai-Ching Tuan
Information Processing Letters
36
, 1990, pp. 167-170
Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
Valmir C. Barbosa
Information Processing Letters
36
, 1990, pp. 171-175
Existence of simple propositional formulas
Hans Kleine Büning
Information Processing Letters
36
, 1990, pp. 177-182
An axiom system for database transactions
Xiaolei Qian
Information Processing Letters
36
, 1990, pp. 183-189
A simple solution to the two paths problem in planar graphs
Gerhard Woeginger
Information Processing Letters
36
, 1990, pp. 191-192
On the completeness of modular proof systems
S. Ramesh
Information Processing Letters
36
, 1990, pp. 195-201
The grammatical inference problem for the Szilard languages of linear grammars
Erkki Mäkinen
Information Processing Letters
36
, 1990, pp. 203-206
Perceptrons revisited
Bernd-Jürgen Falkowski
Information Processing Letters
36
, 1990, pp. 207-213
Remarks on sorting and one-way multihead finite automata
Mirosƚaw Kutyƚowski
Information Processing Letters
36
, 1990, pp. 215-218
Making bubblesort recursive
Jozef Vyskoc̆
Information Processing Letters
36
, 1990, pp. 219-220
Partial sum problem mapping into a hypercube
Hyoung Joong Kim
,
Jang Gyu Lee
Information Processing Letters
36
, 1990, pp. 221-224
Self and selftype
Jin Ho Hur
,
Kilnam Chon
Information Processing Letters
36
, 1990, pp. 225-230
Domination in convex and chordal bipartite graphs
Peter Damaschke
,
Haiko Müller
,
Dieter Kratsch
Information Processing Letters
36
, 1990, pp. 231-236
A note on division orderings on strings
Ursula Martin
Information Processing Letters
36
, 1990, pp. 237-240
Efficient allocation of chain-like task on chain-like network computers
Jang-Ping Sheu
,
Zen-Fu Chiang
Information Processing Letters
36
, 1990, pp. 241-245
Problems complete for
\oplus L
Carsten Damm
Information Processing Letters
36
, 1990, pp. 247-250
Efficient dynamic algorithms for some geometric intersection problems
Siu Wing Cheng
,
Ravi Janardan
Information Processing Letters
36
, 1990, pp. 251-258
On a hierarchy of classes for nested databases
Marc Gyssens
,
Jan Paredaens
,
Dirk van Gucht
Information Processing Letters
36
, 1990, pp. 259-266
On the synthesis of fast algorithms for signal processing
O.M. Makarov
Information Processing Letters
36
, 1990, pp. 267-272
Some comments on the subtree isomorphism problem for ordered trees
Pratul Dublish
Information Processing Letters
36
, 1990, pp. 273-275
Seiten
<
1
2
3
>