English
Français
login
Menu
Search
Browse Collections
Help
English
Français
login
World-set decompositions: Expressiveness and efficient algorithms
Olteanu, Dan
;
Koch, Christoph
;
Antova, Lyublena
2008
Download
Formats
Format
BibTeX
View
Download
MARC
View
Download
MARCXML
View
Download
DublinCore
View
Download
EndNote
View
Download
NLM
View
Download
RefWorks
View
Download
RIS
View
Download
Files
Details
Title
World-set decompositions: Expressiveness and efficient algorithms
Author(s)
Olteanu, Dan
;
Koch, Christoph
;
Antova, Lyublena
Published in
Theor. Comput. Sci.
Volume
403
Issue
2-3
Pages
265-284
Date
2008
Note
Journal version of ICDT 2007 paper.
DOI
https://doi.org/10.1016/j.tcs.2008.05.004
Laboratories
DATA
Record Appears in
Scientific production and competences
>
I&C - School of Computer and Communication Sciences
>
IINFCOM
>
DATA - Data Analysis Theory and Applications Laboratory
Peer-reviewed publications
Work outside EPFL
Journal Articles
Published
Record creation date
2011-06-14
Actions
Preview
Select file:
26-INFOSYS-TR-2006-12_long - N/A - n/a