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 YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph-based specification of access control policies
Manuel Koch
,
L.V. Mancini
,
Francesco Parisi-Presicce
Journal of Computer and System Sciences
71
(1), 2005, pp. 1-33
Monotonic hybrid systems
Ruggero Lanotte
,
Andrea Maggiolo-Schettini
Journal of Computer and System Sciences
71
(1), 2005, pp. 34-69
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
Tetz C. Huang
Journal of Computer and System Sciences
71
(1), 2005, pp. 70-85
Efficient parallel factorization and solution of structured and unstructured linear systems
John H. Reif
Journal of Computer and System Sciences
71
(1), 2005, pp. 86-143
Tight approximability results for test set problems in bioinformatics
Piotr Berman
,
Bhaskar DasGupta
,
Ming-Yang Kao
Journal of Computer and System Sciences
71
(2), 2005, pp. 145-162
An improved accuracy measure for rough sets
Baowen Xu
,
Yuming Zhou
,
Hongmin Lu
Journal of Computer and System Sciences
71
(2), 2005, pp. 163-173
Kernels in planar digraphs
Gregory Gutin
,
Ton Kloks
,
Chuan Min Lee
,
Anders Yeo
Journal of Computer and System Sciences
71
(2), 2005, pp. 174-184
Threshold circuit lower bounds on cryptographic functions
Eike Kiltz
,
Hans Ulrich Simon
Journal of Computer and System Sciences
71
(2), 2005, pp. 185-212
General constructions for information-theoretic private information retrieval
Amos Beimel
,
Yuval Ishai
,
Eyal Kushilevitz
Journal of Computer and System Sciences
71
(2), 2005, pp. 213-247
Learning DNF from random walks
Nader H. Bshouty
,
Elchanan Mossel
,
Ryan O'Donnell
,
Rocco A. Servedio
Journal of Computer and System Sciences
71
(3), 2005, pp. 250-265
Boosting in the presence of noise
Adam Tauman Kalai
,
Rocco A. Servedio
Journal of Computer and System Sciences
71
(3), 2005, pp. 266-290
Efficient algorithms for online decision problems
Adam Kalai
,
Santosh Vempala
Journal of Computer and System Sciences
71
(3), 2005, pp. 291-307
On learning to coordinate: Random bits help, insightful normal forms, and competency isomorphisms
John Case
,
Sanjay Jain
,
Franco Montagna
,
Giulia Simi
,
Andrea Sorbi
Journal of Computer and System Sciences
71
(3), 2005, pp. 308-332
Maximal margin classification for metric spaces
Matthias Hein
,
Olivier Bousquet
,
Bernhard Schölkopf
Journal of Computer and System Sciences
71
(3), 2005, pp. 333-359
Clustering with qualitative information
Moses Charikar
,
Venkatesan Guruswami
,
Anthony Wirth
Journal of Computer and System Sciences
71
(3), 2005, pp. 360-383
A refined search tree technique for dominating set on planar graphs
Jochen Alber
,
Hongbing Fan
,
Michael R. Fellows
,
Henning Fernau
,
Rolf Niedermeier
,
Fran Rosamond
,
Ulrike Stege
Journal of Computer and System Sciences
71
(4), 2005, pp. 385-405
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
Narayan Vikas
Journal of Computer and System Sciences
71
(4), 2005, pp. 406-439
Measuring nondeterminism in pushdown automata
Jonathan Goldstine
,
Hing Leung
,
Detlef Wotschke
Journal of Computer and System Sciences
71
(4), 2005, pp. 440-466
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Devdatt Dubhashi
,
Alessandro Mei
,
Alessandro Panconesi
,
Jaikumar Radhakrishnan
,
Aravind Srinivasan
Journal of Computer and System Sciences
71
(4), 2005, pp. 467-479
An optimal self-stabilizing starvation-free alternator
Mehmet Hakan Karaata
Journal of Computer and System Sciences
71
(4), 2005, pp. 480-494
Approximation algorithms for covering/packing integer programs
Stavros G. Kolliopoulos
,
Neal E. Young
Journal of Computer and System Sciences
71
(4), 2005, pp. 495-505
An
n^2
-bound for the ultimate equivalence problem of certain DOL systems over an
n
-letter alphabet
Juha Honkala
Journal of Computer and System Sciences
71
(4), 2005, pp. 506-519
Bounds on the OBDD-size of integer multiplication via universal hashing
Philipp Woelfel
Journal of Computer and System Sciences
71
(4), 2005, pp. 520-534
On the verification of finite failure
Roberta Gori
,
Giorgio Levi
Journal of Computer and System Sciences
71
(4), 2005, pp. 535-575
Partially ordered regular languages for graph queries
Sergio Flesca
,
Sergio Greco
Journal of Computer and System Sciences
70
(1), 2005, pp. 1-25
Seiten 1
2
3
>