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… 
2010
2010
Occluded human body segmentation and its application to behavior analysis
This paper addresses the problem of occluded human segmentation and then uses its results for human behavior recognition. To… 
2008
2008
Elementary approximation algorithms for prize collecting Steiner tree problems
2007
2007
An efficient bandwidth guaranteed routing for ad hoc networks using ieee 802.11 with interference consideration
In multi-hop wireless networks, flows that traverse the same geographical vicinity contend for the same wireless channel capacity… 
2005
2005
Shortest monotone descent path problem in polyhedral terrain
2005
2005
FFT-based algorithms for the string matching with mismatches 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… 
Highly Cited
1994
Highly Cited
1994
Sensor based planning and nonsmooth analysis
  • H. ChosetJ. Burdick
  • Proceedings of the IEEE International Conference…
  • 1994
  • Corpus ID: 18761845
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1989
1989
A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon
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)