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
99
click to vote
COCOON
1995
Springer
111
views
Combinatorics
»
more
COCOON 1995
»
Extending the Hong-Kung Model to Memory Hierarchies
15 years 7 months ago
Download
www.cs.brown.edu
John E. Savage
claim paper
Read More »
113
click to vote
STACS
2000
Springer
101
views
Theoretical Computer Science
»
more
STACS 2000
»
Hereditary History Preserving Bisimilarity Is Undecidable
15 years 7 months ago
Download
www.brics.dk
Marcin Jurdzinski, Mogens Nielsen
claim paper
Read More »
117
click to vote
COCOON
1995
Springer
136
views
Combinatorics
»
more
COCOON 1995
»
Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5
15 years 7 months ago
Download
www.math.ucsd.edu
Boris D. Lubachevsky, Ronald L. Graham
claim paper
Read More »
138
click to vote
STACS
2000
Springer
79
views
Theoretical Computer Science
»
more
STACS 2000
»
Simulation and Bisimulation over One-Counter Processes
15 years 7 months ago
Download
www.fi.muni.cz
Petr Jancar, Antonín Kucera, Faron Moller
claim paper
Read More »
113
click to vote
STACS
2000
Springer
94
views
Theoretical Computer Science
»
more
STACS 2000
»
The Complexity of Poor Man's Logic
15 years 7 months ago
Download
www.illc.uva.nl
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra
claim paper
Read More »
« first
‹ previous
…
29552
29553
29554
29555
29556
29557
29558
29559
29560
…
next ›
last »