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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
10271
search results - page 215 / 2055
»
Computer Science
Sort
relevance
views
votes
recent
update
View
thumb
title
67
click to vote
FOCS
1998
IEEE
72
views
Theoretical Computer Science
»
more
FOCS 1998
»
Which Problems Have Strongly Exponential Complexity?
15 years 7 months ago
Download
cseweb.ucsd.edu
Russell Impagliazzo, Ramamohan Paturi, Francis Zan...
claim paper
Read More »
79
click to vote
MFCS
1999
Springer
82
views
Theoretical Computer Science
»
more
MFCS 1999
»
On Plain and Hereditary History-Preserving Bisimulation
15 years 7 months ago
Download
www.brics.dk
Sibylle B. Fröschle, Thomas T. Hildebrandt
claim paper
Read More »
100
click to vote
MFCS
1999
Springer
99
views
Theoretical Computer Science
»
more
MFCS 1999
»
The Complexity of the Extended GCD Problem
15 years 7 months ago
Download
dimacs.rutgers.edu
George Havas, Jean-Pierre Seifert
claim paper
Read More »
101
click to vote
RANDOM
1999
Springer
105
views
Theoretical Computer Science
»
more
RANDOM 1999
»
Approximating Minimum Manhattan Networks
15 years 7 months ago
Download
alexandria.tue.nl
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
claim paper
Read More »
115
click to vote
RANDOM
1999
Springer
89
views
Theoretical Computer Science
»
more
RANDOM 1999
»
Completeness and Robustness Properties of Min-Wise Independent Permutations
15 years 7 months ago
Download
www.eecs.harvard.edu
Andrei Z. Broder, Michael Mitzenmacher
claim paper
Read More »
« Prev
« First
page 215 / 2055
Last »
Next »