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
120
search results - page 6 / 24
»
siamcomp 2008
Sort
relevance
views
votes
recent
update
View
thumb
title
57
click to vote
SIAMCOMP
2000
62
views
more
SIAMCOMP 2000
»
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
14 years 9 months ago
Download
www.cse.buffalo.edu
Harry Buhrman, Dieter van Melkebeek, Kenneth W. Re...
claim paper
Read More »
78
click to vote
SIAMCOMP
2008
130
views
more
SIAMCOMP 2008
»
Short PCPs with Polylog Query Complexity
14 years 9 months ago
Download
www.cs.technion.ac.il
We give constructions of probabilistically checkable proofs (PCPs) of length n
Eli Ben-Sasson, Madhu Sudan
claim paper
Read More »
61
click to vote
SIAMCOMP
2000
69
views
more
SIAMCOMP 2000
»
A Finite State Version of the Kraft--McMillan Theorem
14 years 9 months ago
Download
www.cs.ust.hk
The main result is a finite-state version of the Kraft
Frédérique Bassino, Marie-Pierre B&e...
claim paper
Read More »
74
click to vote
SIAMCOMP
2000
74
views
more
SIAMCOMP 2000
»
Robust Plane Sweep for Intersecting Segments
14 years 9 months ago
Download
www.cs.brown.edu
In this paper, we reexamine in the framework of robust computation the Bentley
Jean-Daniel Boissonnat, Franco P. Preparata
claim paper
Read More »
68
click to vote
SIAMCOMP
2008
65
views
more
SIAMCOMP 2008
»
Exact Algorithms for Treewidth and Minimum Fill-In
14 years 9 months ago
Download
lita.sciences.univ-metz.fr
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngv...
claim paper
Read More »
« Prev
« First
page 6 / 24
Last »
Next »