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
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic program slicing
Bogdan Korel
,
Janusz Laski
Information Processing Letters
29
, 1988, pp. 155-163
Fixed-sized blocks optimization
Jerzy R. Nawrocki
,
Andrzej Urbánski
Information Processing Letters
29
, 1988, pp. 165-169
Varieties of formal series on trees and Eilenberg's theorem
Symeon Bozapalidis
,
Stavros Ioulidis
Information Processing Letters
29
, 1988, pp. 171-175
On a complexity hierarchy between L and NL
Sang Cho
,
Dung T. Huynh
Information Processing Letters
29
, 1988, pp. 177-182
Implicit data structures for linear hashing schemes
Mohamed Ouksel
,
Peter Scheuermann
Information Processing Letters
29
, 1988, pp. 183-189
Efficient backward execution in AND/OR process model
Chan-Ik Park
,
Kyu Ho Park
,
Myunghwan Kim
Information Processing Letters
29
, 1988, pp. 191-198
On the degree of dominator trees
Ernst L. Leiss
Information Processing Letters
29
, 1988, pp. 199-200
On a recursive ascent parser
F.E.J. Kruseman Aretz
Information Processing Letters
29
, 1988, pp. 201-206
An algebraic description of some state-dependent failure mechanisms
Fabio A. Schreiber
,
G. Rosolini
Information Processing Letters
29
, 1988, pp. 207-211
HCB-tree: A height compressed B-tree for parallel processing
Sakti Pramanik
,
Myoung Ho Kim
Information Processing Letters
29
, 1988, pp. 213-220
Polynomially solvable satisfiability problems
Giorgio Gallo
,
Maria Grazia Scuttellà
Information Processing Letters
29
, 1988, pp. 221-227
Lazy variable-renumbering makes substitution cheap
H.J. Boom
Information Processing Letters
29
, 1988, pp. 229-232
Optimal search algorithm for a minimum of a discrete periodic bimodal function
Boris S. Veroy
Information Processing Letters
29
, 1988, pp. 233-239
A canonical simplifier for trigonometric expressions in the kinematic equation
Peter Schorn
Information Processing Letters
29
, 1988, pp. 241-246
A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
Füsun özgüner
,
C. Aykanat
Information Processing Letters
29
, 1988, pp. 247-254
A note on random sampling
Marek Chrobak
,
Richard Harter
Information Processing Letters
29
, 1988, pp. 255-256
Un-skolemizing clause sets
William W. McCune
Information Processing Letters
29
, 1988, pp. 257-263
The shortest watchtower and related problems for polyhedral terrains
Micha Sharir
Information Processing Letters
29
, 1988, pp. 265-270
On hypergraph acyclicity and graph chordality
Alessandro d'Atri
,
Marina Moscarini
Information Processing Letters
29
, 1988, pp. 271-274
An
O(n^3)
algorithm for finding the minimal opaque forest of a convex polygon
Pratul Dublish
Information Processing Letters
29
, 1988, pp. 275-276
On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
Mila E. Majster-Cederbaum
Information Processing Letters
29
, 1988, pp. 277-281
Worst-case performance of Rayward-Smith's Steiner tree heuristic
Bernard M. Waxman
,
Makoto Imase
Information Processing Letters
29
, 1988, pp. 283-287
On the unimodality of convex polygons
Stephan Olariu
Information Processing Letters
29
, 1988, pp. 289-292
Auxiliary variables in data refinement
Carroll Morgan
Information Processing Letters
29
, 1988, pp. 293-296
On the minimal number of
\times
operators to model regularity in fair SCCS
Irène Guessarian
,
Lutz Priese
Information Processing Letters
29
, 1988, pp. 297-300
Seiten
<
1
2
3
>