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
256
search results - page 5 / 52
»
Short trees in polygons
Sort
relevance
views
votes
recent
update
View
thumb
title
86
click to vote
ISPD
2006
ACM
84
views
Hardware
»
more
ISPD 2006
»
Efficient generation of short and fast repeater tree topologies
15 years 10 months ago
Download
www.sigda.org
Christoph Bartoschek, Stephan Held, Dieter Rautenb...
claim paper
Read More »
85
click to vote
ICALP
1997
Springer
58
views
Programming Languages
»
more
ICALP 1997
»
Constructing Big Trees from Short Sequences
15 years 8 months ago
Download
www.renyi.hu
Péter L. Erdös, Mike A. Steel, L&aacut...
claim paper
Read More »
105
click to vote
SODA
1994
ACM
81
views
Algorithms
»
more
SODA 1994
»
Spanning Trees Short or Small
15 years 5 months ago
Download
www.ccs.neu.edu
R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel ...
claim paper
Read More »
73
click to vote
CPC
2002
64
views
more
CPC 2002
»
Two Short Proofs Concerning Tree-Decompositions
15 years 4 months ago
Download
www.math.uni-hamburg.de
Patrick Bellenbaum, Reinhard Diestel
claim paper
Read More »
144
click to vote
COMPGEOM
1993
ACM
122
views
Discrete Geometry
»
more
COMPGEOM 1993
»
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
15 years 8 months ago
Download
www.pi6.fernuni-hagen.de
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
claim paper
Read More »
« Prev
« First
page 5 / 52
Last »
Next »