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
6
search results - page 1 / 2
»
sigal 1990
Sort
relevance
views
votes
recent
update
View
thumb
title
39
click to vote
SIGAL
1990
253
views
Algorithms
»
more
SIGAL 1990
»
Searching in Higher Dimension
14 years 2 months ago
Download
www.cs.princeton.edu
Bernard Chazelle
claim paper
Read More »
38
click to vote
SIGAL
1990
233
views
Algorithms
»
more
SIGAL 1990
»
Optimal Linear Broadcast
14 years 2 months ago
Download
libserver2.nhu.edu.tw
Sara Bitan, Shmuel Zaks
claim paper
Read More »
39
click to vote
SIGAL
1990
248
views
Algorithms
»
more
SIGAL 1990
»
Topological Sweeping in Three Dimensions
14 years 2 months ago
Download
agsm.ucr.edu
Efthymios Anagnostou, Vassilios G. Polimenis, Leon...
claim paper
Read More »
41
click to vote
SIGAL
1990
216
views
Algorithms
»
more
SIGAL 1990
»
Planar Separators and the Euclidean Norm
14 years 2 months ago
Download
www.cs.cmu.edu
In this paper we show that every 2-connected embedded planar graph with faces of sizes
Hillel Gazit, Gary L. Miller
claim paper
Read More »
34
click to vote
SIGAL
1990
221
views
Algorithms
»
more
SIGAL 1990
»
Complexity Cores and Hard Problem Instances
14 years 2 months ago
Download
www.uni-ulm.de
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
Uwe Schöning
claim paper
Read More »
« Prev
« First
page 1 / 2
Last »
Next »