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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate parametric searching
Sivan Toledo
Information Processing Letters
47
(1), 1993, pp. 1-4
A lower bound for randomized list update algorithms
Boris Teia
Information Processing Letters
47
(1), 1993, pp. 5-9
A note on the descriptive complexity of maximization problem
Pierluigi Crescenzi
,
Riccardo Silvestri
Information Processing Letters
47
(1), 1993, pp. 11-15
Efficient pattern searching over large dictionaries
Olumide Owolabi
Information Processing Letters
47
(1), 1993, pp. 17-21
A faster algorithm for the two-center decision problem
John Hershberger
Information Processing Letters
47
(1), 1993, pp. 23-29
The generalized supplementary magic-sets transformation for stratified Datalog
Michael Meskes
,
Jörg Noack
Information Processing Letters
47
(1), 1993, pp. 31-41
A
2\cdot|E|
-bit distributed algorithm for the directed Euler trail problem
Wen-Huei Chen
,
Chuan Yi Tang
Information Processing Letters
47
(1), 1993, pp. 43-49
Tight comparison bounds for the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Information Processing Letters
47
(1), 1993, pp. 51-57
On the union of 0L languages
Jürgen Dassow
,
Gheorghe Păun
,
Arto Salomaa
Information Processing Letters
47
(1), 1993, pp. 59-63
Simple LPO constraint solving methods
Robert Nieuwenhuis
Information Processing Letters
47
(2), 1993, pp. 65-69
Shortest path computations in source-deplanarized graphs
Greg N. Frederickson
,
Susanne E. Hambrusch
,
Hung-Yi Tu
Information Processing Letters
47
(2), 1993, pp. 71-75
Improved bounds for the max-flow min-multicut ratio for planar and
K_{r,r}
-free graphs
éva Tardos
,
Vijay V. Vazirani
Information Processing Letters
47
(2), 1993, pp. 77-80
On the non-existence of maximal inference degrees for language identification
Sanjay Jain
,
Arun Sharma
Information Processing Letters
47
(2), 1993, pp. 81-88
An
O(n)
time algorithm for maximum matching on cographs
Ming-Shing Yu
,
Chen-Hsing Yang
Information Processing Letters
47
(2), 1993, pp. 89-93
On Simon's string searching algorithm
Christophe Hancart
Information Processing Letters
47
(1), 1993, pp. 95-99
Semantics and properties of existential quantifiers in deductive databases
Sang Ho Lee
,
Lawrence J. Henschen
Information Processing Letters
47
(2), 1993, pp. 101-108
An
O(1)
time optimal algorithm for multiplying matrices on reconfigurable mesh
Heonchul Park
,
Hyoung Joong Kim
,
Viktor K. Prasanna
Information Processing Letters
47
(2), 1993, pp. 109-113
Optimal slope selection via expanders
Matthew J. Katz
,
Micha Sharir
Information Processing Letters
47
(3), 1993, pp. 115-122
An improved LALR
(k)
parser generation for regular right part grammars
Heung-Chul Shin
,
Kwang-Moo Choe
Information Processing Letters
47
(3), 1993, pp. 123-129
Constructor equivalent term rewriting systems
Iréne Durand
,
Bruno Salinier
Information Processing Letters
47
(3), 1993, pp. 131-137
A note on a conjecture concerning symmetric resilient functions
K. Gopalakrishnan
,
D.G. Hoffman
,
D.R. Stinson
Information Processing Letters
47
(3), 1993, pp. 139-143
Some comments on building heaps in parallel
Carlo Luchetti
,
M. Cristina Pinotti
Information Processing Letters
47
(3), 1993, pp. 145-148
Efficient bottom-up execution of logic programs using abstract interpretation
Byeong-Mo Chang
,
Kwang-Moo Choe
,
Taisook Han
Information Processing Letters
47
(3), 1993, pp. 149-157
Range-restricted mergeable priority queues
Jonathan D. Bright
Information Processing Letters
47
(3), 1993, pp. 159-164
A note on ``Scheduling unit-time tasks with integer release times and deadlines''
George Steiner
,
Scott Yeomans
Information Processing Letters
47
(3), 1993, pp. 165-166
Seiten 1
2
>