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=J. Comput.~Syst.~Sci. AND Volume=65
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determinism verus nondeterminism for linear time RAMs with memory restrictions
Miklós Ajtai
Journal of Computer and System Sciences
65
(1), 2002, pp. 2-37
Optimal bounds for the predecessor problem and related problems
Paul Beame
,
Faith E. Fich
Journal of Computer and System Sciences
65
(1), 2002, pp. 38-72
Finding similar regions in many sequences
Ming Li
,
Bin Ma
,
Lusheng Wang
Journal of Computer and System Sciences
65
(1), 2002, pp. 73-96
Extracting all the randomness and reducing the error in Trevisan's extractors
Ran Raz
,
Omer Reingold
,
Salil Vadhan
Journal of Computer and System Sciences
65
(1), 2002, pp. 97-128
A constant-factor approximation algorithm for the
k
-median problem
Moses Charikar
,
Sudipto Guha
,
Éva Tardos
,
David B. Shmoys
Journal of Computer and System Sciences
65
(1), 2002, pp. 129-149
A fully dynamic algorithm for maintaining the transitive closure
Valerie King
,
Garry Sagert
Journal of Computer and System Sciences
65
(1), 2002, pp. 150-167
Reducibility between classes of port graph grammar
Charles Stewart
Journal of Computer and System Sciences
65
(2), 2002, pp. 169-223
Online learning of binary and
n
-ary relations over clustered domains
Atsuyoshi Nakamura
,
Naoki Abe
Journal of Computer and System Sciences
65
(2), 2002, pp. 224-256
New lowness results for
ZPP^{NP}
and other complexity classes
V. Arvind
,
Johannes Köbler
Journal of Computer and System Sciences
65
(2), 2002, pp. 257-277
Some decision problems concerning semilinearity and commutation
Tero Harju
,
Oscar Ibarra
,
Juhani Karhumäki
,
Arto Salomaa
Journal of Computer and System Sciences
65
(2), 2002, pp. 278-294
An algorithm for handling many relational calculus queries efficiently
Dan E. Willard
Journal of Computer and System Sciences
65
(2), 2002, pp. 295-331
On the complexity of pattern matching for highly compressed two-dimensional texts
Piotr Berman
,
Marek Karpinski
,
Lawrence L. Larmore
,
Wojciech Plandowski
,
Wojciech Rytter
Journal of Computer and System Sciences
65
(2), 2002, pp. 332-350
Node replacements in embedding normal form
K. Skodinis
,
E. Wanke
Journal of Computer and System Sciences
65
(2), 2002, pp. 351-376
The equivalence problem for DF0L languages and power series
Juha Honkala
Journal of Computer and System Sciences
65
(2), 2002, pp. 377-392
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds
Giovanni Pighizzini
,
Jeffrey Shallit
,
Ming-wei Wang
Journal of Computer and System Sciences
65
(2), 2002, pp. 393-414
Generalization error of combined classifiers
Llew Mason
,
Peter L. Bartlett
,
Mostefa Golea
Journal of Computer and System Sciences
65
(2), 2002, pp. 415-438
Reconstructing an ancestral genome using minimum segments duplications and reversals
Nadia El-Mabrouk
Journal of Computer and System Sciences
65
(3), 2002, pp. 442-464
The longest common subsequence problem for sequences with nested arc annotations
Guohui Lin
,
Zhi-Zhong Chen
,
Tao Jiang
,
Jianjun Wen
Journal of Computer and System Sciences
65
(3), 2002, pp. 465-480
Combining polynomial running time and fast convergence for the disk-covering method
J. Lagergren
Journal of Computer and System Sciences
65
(3), 2002, pp. 481-493
Methods for reconstructing the history of tandem repeats and their application to the human genome
Deep Jaitly
,
Paul Kearney
,
Guohui Lin
,
Bin Ma
Journal of Computer and System Sciences
65
(3), 2002, pp. 494-507
Steps toward accurate reconstructions of phylogenies from gene-order data
Bernard M.E. Moret
,
Jijun Tang
,
Li-San Wang
,
Tandy Warnow
Journal of Computer and System Sciences
65
(3), 2002, pp. 508-525
The restriction mapping problem revisited
Gopal Pandurangan
,
H. Ramesh
Journal of Computer and System Sciences
65
(3), 2002, pp. 526-544
The consensus string problem and the complexity of comparing hidden Markov models
Rune B. Lyngs
,
Christian N.S. Pedersen
Journal of Computer and System Sciences
65
(3), 2002, pp. 545-569
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
Yaw-Ling Lin
,
Tao Jiang
,
Kun-Mao Chao
Journal of Computer and System Sciences
65
(3), 2002, pp. 570-586
Efficient algorithms for multichromosomal genome rearrangements
Glenn Tesler
Journal of Computer and System Sciences
65
(3), 2002, pp. 587-609
Seiten 1
2
>