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
21
search results - page 1 / 5
»
stoc 1995
Sort
relevance
views
votes
recent
update
View
thumb
title
15
click to vote
STOC
1995
ACM
89
views
Algorithms
»
more
STOC 1995
»
What do we know about the Metropolis algorithm?
13 years 8 months ago
Download
www-stat.stanford.edu
Persi Diaconis, Laurent Saloff-Coste
claim paper
Read More »
10
click to vote
STOC
1995
ACM
86
views
Algorithms
»
more
STOC 1995
»
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract)
13 years 8 months ago
Download
www.cs.brown.edu
William E. Hart, Sorin Istrail
claim paper
Read More »
10
click to vote
STOC
1995
ACM
98
views
Algorithms
»
more
STOC 1995
»
Symmetric logspace is closed under complement
13 years 8 months ago
Download
www.brics.dk
Noam Nisan, Amnon Ta-Shma
claim paper
Read More »
9
click to vote
STOC
1995
ACM
118
views
Algorithms
»
more
STOC 1995
»
On randomized one-round communication complexity
13 years 8 months ago
Download
faculty-gsb.stanford.edu
Ilan Kremer, Noam Nisan, Dana Ron
claim paper
Read More »
9
click to vote
STOC
1995
ACM
103
views
Algorithms
»
more
STOC 1995
»
Log-space polynomial end-to-end communication
13 years 8 months ago
Download
www.cs.ucla.edu
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
claim paper
Read More »
« Prev
« First
page 1 / 5
Last »
Next »