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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal parallel construction of heaps
C.M. Khoong
Information Processing Letters
48
(4), 1993, pp. 159-161
A description of dynamic behavior for compilers based on object oriented modeling
DongGill Lee
,
Kwang-Moo Choe
,
Taisook Han
Information Processing Letters
48
(4), 1993, pp. 163-170
Models for the substitution axiom of UNITY logic
Georg Reichwein
,
José Luiz Fiadeiro
Information Processing Letters
48
(4), 1993, pp. 171-176
The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems
Ying Teh Tsai
,
Chuan Yi Tang
Information Processing Letters
48
(4), 1993, pp. 177-182
On injectivity of deterministic top-down tree transducers
Z. Fülöp
,
P. Gyenizse
Information Processing Letters
48
(4), 1993, pp. 183-188
On resource scheduling of multi-join queries in parallel database systems
Kian-Lee Tan
,
Hongjun Lu
Information Processing Letters
48
(4), 1993, pp. 189-195
A short proof of the dilation of a toroidal mesh in a path
Michael S. Paterson
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
Information Processing Letters
48
(4), 1993, pp. 197-199
Twenty questions to a p-selector
Harry Buhrman
,
Leen Torenvliet
,
Peter van Emde Boas
Information Processing Letters
48
(4), 1993, pp. 201-204
Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
Maw-Shang Chang
,
Yi-Chang Liu
Information Processing Letters
48
(4), 1993, pp. 205-210
Efficient algorithms for finding the most vital edge of a minimum spanning tree
Kazuo Iwano
,
Naoki Katoh
Information Processing Letters
48
(5), 1993, pp. 211-213
A simple correctness proof of the MCS contention-free lock
Theodore Johnson
,
Krishna Harathi
Information Processing Letters
48
(5), 1993, pp. 215-220
Efficient edge domination problems in graphs
Dana L. Grinstead
,
Peter J. Slater
,
Naveed A. Sherwani
,
Nancy D. Holmes
Information Processing Letters
48
(5), 1993, pp. 221-228
On the complexity of assembly partitioning
Lydia Kavraki
,
Jean-Claude Latombe
,
Randall H. Wilson
Information Processing Letters
48
(5), 1993, pp. 229-235
A broadcasting algorithm in star graph interconnection networks
Jang-Ping Sheu
,
Wen-Hwa Liaw
,
Tzung-Shi Chen
Information Processing Letters
48
(5), 1993, pp. 237-241
Fault diameter of star graphs
Yordan Rouskov
,
Pradip K. Srimani
Information Processing Letters
48
(5), 1993, pp. 243-251
Queue-mergesort
Mordecai J. Golin
,
Robert Sedgewick
Information Processing Letters
48
(5), 1993, pp. 253-259
Partitioning multiple-chain-like task across a host-satellite system
Alain Billionnet
Information Processing Letters
48
(5), 1993, pp. 261-266
Parametrized recurrent systems for image generation
Karel Culik II
,
Jarkko Kari
Information Processing Letters
48
(6), 1993, pp. 267-274
Exact solutions for the construction of optimal length text sequences
Marion Rodrigues
,
Hasan Ural
Information Processing Letters
48
(6), 1993, pp. 275-280
A note on relation schemes which are in 3NF but not in BCNF
Millist W. Vincent
,
Bala Srinivasan
Information Processing Letters
48
(6), 1993, pp. 281-283
A note on multi-inkdot nondeterministic Turing machines with small space
Katsushi Inoue
,
Akira Ito
,
Itsuo Takanami
,
Tsunehiro Yoshinaga
Information Processing Letters
48
(6), 1993, pp. 285-288
A linear time equivalence test for read-twice DNF formulas
Krishnan Pillaipakkamnatt
,
Vijay Raghavan
Information Processing Letters
48
(6), 1993, pp. 289-295
Finding a target subnetwork in sparse networks with random faults
Pierre Fraigniaud
,
Claire Kenyon
,
Andrzej Pelc
Information Processing Letters
48
(6), 1993, pp. 297-303
A modified greedy heuristic for the set covering problem with improved worst case bound
Olivier Goldschmidt
,
Dorit S. Hochbaum
,
Gang Yu
Information Processing Letters
48
(6), 1993, pp. 305-310
Computing the average distance of an interval graph
Peter Dankelmann
Information Processing Letters
48
(6), 1993, pp. 311-314
Seiten
<
1
2
3
>