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=66
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analysis and application of adaptive sampling
James F. Lynch
Journal of Computer and System Sciences
66
(1), 2003, pp. 2-19
Query containment for data integration systems
Todd Millstein
,
Alon Halevy
,
Marc Friedman
Journal of Computer and System Sciences
66
(1), 2003, pp. 20-39
Verification of relational transducers for electronic commerce
Marc Spielmann
Journal of Computer and System Sciences
66
(1), 2003, pp. 40-65
Typechecking for XML transformers
Tova Milo
,
Dan Suciu
,
Victor Vianu
Journal of Computer and System Sciences
66
(1), 2003, pp. 66-97
Generalized substring selectivity estimation
Zhiyuan Chen
,
Flip Korn
,
Nick Koudas
,
S. Muthukrishnan
Journal of Computer and System Sciences
66
(1), 2003, pp. 98-132
On the content of materialized aggregate views
Stéphane Grumbach
,
Leonardo Tininini
Journal of Computer and System Sciences
66
(1), 2003, pp. 133-168
Reachability and connectivity queries in constraint databases
Michael Benedikt
,
Martin Grohe
,
Leonid Libkin
,
Luc Segoufin
Journal of Computer and System Sciences
66
(1), 2003, pp. 169-206
Indexing moving points
Pankaj K Agarwal
,
Lars Arge
,
Jeff Erickson
Journal of Computer and System Sciences
66
(1), 2003, pp. 207-243
Auditing Boolean attributes
Jon Kleinberg
,
Christos Papadimitriou
,
Prabhakar Raghavan
Journal of Computer and System Sciences
66
(1), 2003, pp. 244-253
Integrity constraints for XML
Wenfei Fan
,
Jérôme Siméon
Journal of Computer and System Sciences
66
(1), 2003, pp. 254-291
TTL: A modular language for hardware/software systems design
Vincenza Carchiolo
,
Michele Malgeri
,
Giuseppe Mangioni
Journal of Computer and System Sciences
66
(2), 2003, pp. 293-315
An axiomatic semantics for the synchronous language Gentzen
Simone Tini
Journal of Computer and System Sciences
66
(2), 2003, pp. 316-348
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
Hans Kellerer
,
Renata Mansini
,
Ulrich Pferschy
,
Maria Grazia Speranza
Journal of Computer and System Sciences
66
(2), 2003, pp. 349-370
Approximate testing with error relative to input size
Marcos Kiwi
,
Frèdèric Magniez
,
Miklos Santha
Journal of Computer and System Sciences
66
(2), 2003, pp. 371-392
The complexity of the temporal logic with "until" over general linear time
M. Reynolds
Journal of Computer and System Sciences
66
(2), 2003, pp. 393-426
Quantum multi-prover interactive proof systems with limited prior entanglement
Hirotada Kobayashi
,
Keiji Matsumoto
Journal of Computer and System Sciences
66
(3), 2003, pp. 429-450
Translation of binary regular expressions into nondeterministic
\varepsilon
-free automata with
O(n \log n)
transitions
Viliam Geffert
Journal of Computer and System Sciences
66
(3), 2003, pp. 451-472
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Martin Sauerhoff
Journal of Computer and System Sciences
66
(3), 2003, pp. 473-495
On the difficulty of approximately maximizing agreements
Shai Ben-David
,
Nadav Eiron
,
Philip M. Long
Journal of Computer and System Sciences
66
(3), 2003, pp. 496-514
Blocking a transition in a free choice net and what it tells about its throughput
Bruno Gaujal
,
Stefan Haar
,
Jean Mairesse
Journal of Computer and System Sciences
66
(3), 2003, pp. 515-548
Completeness results for graph isomorphism
Birgit Jenner
,
Johannes Köbler
,
Pierre McKenzie
,
Jacobo Torán
Journal of Computer and System Sciences
66
(3), 2003, pp. 549-566
Scheduling multicasts on unit-capacity trees and meshes
Monika R. Henzinger
,
Stefano Leonardi
Journal of Computer and System Sciences
66
(3), 2003, pp. 567-611
Optimal aggregation algorithms for middleware
Ronald Fagin
,
Amnon Lotem
,
Moni Naor
Journal of Computer and System Sciences
66
(4), 2003, pp. 614-656
Relaxed multi-way trees with group updates
Kim S. Larsen
Journal of Computer and System Sciences
66
(4), 2003, pp. 657-670
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Dimitris Achlioptas
Journal of Computer and System Sciences
66
(4), 2003, pp. 671-687
Seiten 1
2
>