Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,469,607 papers from all fields of science
Search
Sign In
Create Free Account
Algorithmica
Algorithmica is a monthly peer reviewed, scientific journal, published by Springer Science+Business Media focused on research and application of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
43 relations
ACM Transactions on Algorithms
Algorithms
Anna Karlin
Apex graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Algorithms for some metrical service systems
M. Elías
2018
Corpus ID: 53588650
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences…
Expand
2016
2016
Challenges in random graph models with degree heterogeneity: existence, enumeration and asymptotics of the spectral radius
D. Burstein
2016
Corpus ID: 125167849
In order to understand how the network structure impacts the underlying dynamics, we seek an assortment of methods for…
Expand
2014
2014
WSPC / Guidelines main Improved Pointer Machine and I / O Lower Bounds for Simplex Range Reporting and Related Problems
P. Afshani
2014
Corpus ID: 16547058
We investigate one of the fundamental areas in computational geometry: lower bounds for range reporting problems in the pointer…
Expand
2001
2001
Low Power Design Techniques for Embedded Systems Dynamic power management
Angel González
2001
Corpus ID: 15100489
Dynamic power management (DPM) is a power reduction technique based on dynamically reconfiguring the systems to provide the…
Expand
1999
1999
Risk Analysis Using Perceptions and Quadratic Programming
B. Falkowski
Fuzzy Days
1999
Corpus ID: 37628792
A heuristic method (computation of weighted averages) is considered for risk analysis. It is improved upon by utilizing the…
Expand
Review
1999
Review
1999
Extending the Computational Horizon: Effective Distributed Resource-Bounded Computation for Intractable Problems
Harry J. Paarsch
,
Alberto Maria Segre
1999
Corpus ID: 14139777
A number of combinatorial problems of interest to computational economists, such as some two-sided matching problems, belong to…
Expand
1996
1996
Some algebraic considerations for efficient computations in timed Petri nets
B. Gaujal
Hawaii International Conference on System…
1996
Corpus ID: 1400641
We show how structural properties of some classes of timed Petri nets can be used to derive efficient algorithms to compute…
Expand
1995
1995
Architecture-Dependent Loop Scheduling via Communication-Sensitive Remapping
S. Tongsima
,
N. Passos
,
E. Sha
International Conference on Parallel Processing
1995
Corpus ID: 123360
In this paper, we propose a novel efficient technique called cyclo-compaction scheduling, taking into account the data…
Expand
1995
1995
Output-sensitive construction of convex hulls
Timothy M. Chan
1995
Corpus ID: 120475045
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in…
Expand
1994
1994
ASPEN: High-performance hardware support for distributed shared-memory
Kenneth Mark Maxham
1994
Corpus ID: 60830258
ASPEN: High-Performance Hardware Support for Distributed Shared-Memory Kenneth Mark Maxham This thesis describes and evaluates an…
Expand