Sciweavers

Share
FSTTCS
2008
Springer
9 years 7 days ago
Some Sieving Algorithms for Lattice Problems
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
Vikraman Arvind, Pushkar S. Joglekar
FSTTCS
2008
Springer
9 years 7 days ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
FSTTCS
2008
Springer
9 years 7 days ago
A new upper bound for 3-SAT
Josep Díaz, Lefteris M. Kirousis, Dieter Mi...
FSTTCS
2008
Springer
9 years 7 days ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
FSTTCS
2008
Springer
9 years 7 days ago
Leaf languages and string compression
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
Markus Lohrey
FSTTCS
2008
Springer
9 years 7 days ago
Analyzing Asynchronous Programs with Preemption
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Toui...
FSTTCS
2008
Springer
9 years 7 days ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
FSTTCS
2008
Springer
9 years 7 days ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
FSTTCS
2008
Springer
9 years 7 days ago
Average-Time Games
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
Marcin Jurdzinski, Ashutosh Trivedi
FSTTCS
2008
Springer
9 years 7 days ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
books