Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(14)
Adriano Peron
5
Salvatore La Torre
4
Ruggero Lanotte
3
Axel Legay
3
Sophie Pinchinat
3
Conferences
(8)
VMCAI
3
LPAR(RCLP)
2
CONCUR
2
FSTTCS
2
ICALP
1
Journals
(6)
TCS
5
FMSD
3
CORR
3
ACTA
1
LNCS
1
Keywords
(53)
Embed
Subscribe
Academic
Authors
Laura Bozzelli
Laura Bozzelli,Universidad Politécnica de Madrid,Algorithms & Theory,Software Engineering,Scientific Computing
Edit
Laura Bozzelli
Universidad Politécnica de Madrid
Publications:
28
|
Citations:
67
Fields:
Algorithms & Theory
,
Software Engineering
,
Scientific Computing
View FAQ about top research areas and Fields of study
Collaborated with
14 co-authors
from 2003 to 2011
|
Cited by
77 authors
Cumulative
Annual
Sort by:
Publications
(28)
BibTeX
|
RIS
|
RefWorks
Download
Hardness of preorder checking for basic formalisms
Laura Bozzelli
,
Axel Legay
,
Sophie Pinchinat
Journal:
Theoretical Computer Science - TCS
, vol. 412, no. 49, pp. 6795-6808, 2011
Pushdown module checking
(
Citations: 1
)
Laura Bozzelli
,
Aniello Murano
,
Adriano Peron
Journal:
Formal Methods in System Design - FMSD
, vol. 36, no. 1, pp. 65-95, 2010
Hardness of Preorder Checking for Basic Formalisms
Laura Bozzelli
,
Axel Legay
,
Sophie Pinchinat
Conference:
Logic Programming and Automated Reasoning/Russian Conference on Logic Programming - LPAR(RCLP)
, pp. 119-135, 2010
Complexity and succinctness issues for linear-time hybrid logics
Laura Bozzelli
,
Ruggero Lanotte
Journal:
Theoretical Computer Science - TCS
, vol. 411, no. 2, pp. 454-469, 2010
CaRet With Forgettable Past
(
Citations: 1
)
Laura Bozzelli
Journal:
Electronic Notes in Theoretical Computer Science - ENTCS
, vol. 231, pp. 343-361, 2009
Sort by:
Citations
(67 times by 51 publications)
Alternation Elimination for Automata over Nested Words
(
Citations: 1
)
Christian Dax
,
Felix Klaedtke
Conference:
Foundations of Software Science and Computation Structure - FoSSaCS
, pp. 168-183, 2011
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Marcelo Arenas
,
Pablo Barceló
,
Leonid Libkin
Journal:
Theory of Computing Systems / Mathematical Systems Theory - MST
, vol. 49, no. 3, pp. 639-670, 2011
Realizability of Dynamic MSC Languages
(
Citations: 2
)
Benedikt Bollig
,
Loïc Hélouët
Conference:
Computer Science Symposium in Russia - CSR
, pp. 48-59, 2010
Parametric Metric Interval Temporal Logic
(
Citations: 1
)
Barbara Di Giampaolo
,
Salvatore La Torre
,
Margherita Napoli
Published in 2010.
An Automata-Theoretic Approach to Infinite-State Systems
(
Citations: 1
)
Orna Kupferman
,
Nir Piterman
,
Moshe Y. Vardi
Conference:
Birthday ...
, pp. 202-259, 2010
Comments