Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
36
search results - page 2 / 8
»
fsttcs 2009
Sort
relevance
views
votes
recent
update
View
thumb
title
12
click to vote
FSTTCS
2009
Springer
118
views
Software Engineering
»
more
FSTTCS 2009
»
Continuous-Time Stochastic Games with Time-Bounded Reachability
13 years 9 months ago
Download
www.fi.muni.cz
Tomás Brázdil, Vojtech Forejt, Jan K...
claim paper
Read More »
9
click to vote
FSTTCS
2009
Springer
106
views
Software Engineering
»
more
FSTTCS 2009
»
Mediating for Reduction (on Minimizing Alternating Büchi Automata)
13 years 11 months ago
Download
www.fit.vutbr.cz
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Ho...
claim paper
Read More »
8
click to vote
FSTTCS
2009
Springer
99
views
Software Engineering
»
more
FSTTCS 2009
»
A Fine-grained Analysis of a Simple Independent Set Algorithm
13 years 11 months ago
Download
drops.dagstuhl.de
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
Joachim Kneis, Alexander Langer, Peter Rossmanith
claim paper
Read More »
8
click to vote
FSTTCS
2009
Springer
137
views
Software Engineering
»
more
FSTTCS 2009
»
The Covering and Boundedness Problems for Branching Vector Addition Systems
13 years 11 months ago
Download
www.lsv.ens-cachan.fr
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
Stéphane Demri, Marcin Jurdzinski, Oded Lac...
claim paper
Read More »
9
click to vote
FSTTCS
2009
Springer
100
views
Software Engineering
»
more
FSTTCS 2009
»
Using Elimination Theory to construct Rigid Matrices
13 years 11 months ago
Download
itcs.tsinghua.edu.cn
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Pa...
claim paper
Read More »
« Prev
« First
page 2 / 8
Last »
Next »