Skip to search formSkip to main contentSkip to account menu

Algorithmica

Algorithmica is a monthly peer reviewed, scientific journal, published by Springer Science+Business Media focused on research and application of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

43 relations
ACM Transactions on AlgorithmsAlgorithmsAnna KarlinApex graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Algorithms for some metrical service systems
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences… 
2016
2016
Challenges in random graph models with degree heterogeneity: existence, enumeration and asymptotics of the spectral radius
In order to understand how the network structure impacts the underlying dynamics, we seek an assortment of methods for… 
2014
2014
WSPC / Guidelines main Improved Pointer Machine and I / O Lower Bounds for Simplex Range Reporting and Related Problems
We investigate one of the fundamental areas in computational geometry: lower bounds for range reporting problems in the pointer… 
2004
2004
Understanding search trees via statistical physics
We study the randomm-ary search tree model (wherem stands for the number of branches of the search tree), an important problem… 
2001
2001
Low Power Design Techniques for Embedded Systems Dynamic power management
Dynamic power management (DPM) is a power reduction technique based on dynamically reconfiguring the systems to provide the… 
1997
1997
Experimental on Results on String Matching over Innnite Alphabets
Various string matching algorithms have been designed and some experimental works on string matching over nite alphabets have… 
1996
1996
Some algebraic considerations for efficient computations in timed Petri nets
We show how structural properties of some classes of timed Petri nets can be used to derive efficient algorithms to compute… 
1996
1996
Polygon reconstruction from visibility information
Reconstruction results at tempt, to rebuild polygons from visibility information. R m m s t r u c t i o n of a general polygon… 
1995
1995
Output-sensitive construction of convex hulls
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in… 
1991
1991
Visibility in Simple Polygons
We present a new method of decomposing a simple polygon which allows the preprocessing of the polygon to e ciently answer queries… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)