Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAlgorithmica, Volume 49, 2007
Volume 49, Number 1, September 2007
- Alexander Grigoriev
, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings per Edge. 1-11 - Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp:
The Complexity of the Single Individual SNP Haplotyping Problem. 13-36 - Nir Halman:
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems. 37-50 - Leah Epstein, Asaf Levin:
SONET ADMs Minimization with Divisible Paths. 51-68 - Daniil Ryabko:
Sample Complexity for Computational Classification Problems. 69-77
Volume 49, Number 2, October 2007
- Andrej Taranenko, Aleksander Vesel:
Fast Recognition of Fibonacci Cubes. 81-93 - Yakov Nekrich:
Space Efficient Dynamic Orthogonal Range Reporting. 94-108 - Gopal Pandurangan, GaHyun Park:
Analysis of Randomized Protocols for Conflict-Free Distributed Access. 109-126 - Frédéric Magniez, Michel de Rougemont:
Property Testing of Regular Tree Languages. 127-146 - Valerie King, Scott Lewis, Jared Saia, Maxwell Young:
Choosing a Random Peer in Chord. 147-169
Volume 49, Number 3, November 2007
- Luciano Gualà, Guido Proietti:
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. 171-191 - Shang-Hua Teng, Frances F. Yao:
k-Nearest-Neighbor Clustering and Percolation Theory. 192-211 - Eitan Bachmat:
Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry. 212-231 - Bernhard Fuchs, Walter Kern, Xinhui Wang:
The Number of Tree Stars Is O *(1.357 k ). 232-244 - Hervé Fournier, Antoine Vigneron:
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. 245-257
Volume 49, Number 4, December 2007
- Stefano Basagni, Cynthia A. Phillips:
Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing. 259-263 - Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder:
OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks. 264-285 - Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad:
A Class of Algorithms for Collision Resolution with Multiplicity Estimation. 286-317 - Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes:
Improved Approximation Results for the Minimum Energy Broadcasting Problem. 318-336 - András Faragó:
On the Fundamental Limits of Topology Control in Ad Hoc Networks. 337-356 - Vasundhara Puttagunta, Konstantinos Kalpakis:
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks. 357-385 - Daniela Tulone:
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks. 386-411 - Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti:
Localized Techniques for Broadcasting in Wireless Sensor Networks. 412-446
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2021-08-02 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
