Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 3
Volume 3, Number 1, February 2007
- David Eppstein:
Foreword to special issue on SODA 2002. 1 - Graham Cormode
, S. Muthukrishnan:
The string edit distance matching problem with moves. 2:1-2:19 - Aaron Archer, Éva Tardos:
Frugal path mechanisms. 3:1-3:22 - Artur Czumaj, Berthold Vöcking:
Tight bounds for worst-case equilibria. 4:1-4:17
- John Hershberger, Subhash Suri, Amit M. Bhosle:
On the difficulty of some shortest path problems. 5:1-5:15 - Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan:
A data structure for a sequence of string accesses in external memory. 6:1-6:23 - Gopal Pandurangan, Eli Upfal:
Entropy-based bounds for online algorithms. 7:1-7:19 - Michael Elkin, Guy Kortsarz:
An improved algorithm for radio broadcast. 8:1-8:21 - Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas:
Querying priced information in databases: The conjunctive case. 9:1-9:22 - Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic aspects of bandwidth trading. 10:1-10:19
Volume 3, Number 2, May 2007
- Yevgen Voronenko, Markus Püschel:
Multiplierless multiple constant multiplication. 11 - Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang:
Phase changes in random point quadtrees. 12 - Erik D. Demaine, John Iacono, Stefan Langerman:
Retroactive data structures. 13 - Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan:
Improved algorithms for weakly chordal graphs. 14 - Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. 15 - Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. 16 - Sunil Arya, Theocharis Malamatos, David M. Mount:
A simple entropy-based algorithm for planar point location. 17 - Manuel Kauers:
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences. 18 - Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic text and static pattern matching. 19 - Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro:
Compressed representations of sequences and full-text indexes. 20 - Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane:
Compressed indexes for dynamic text collections. 21 - Joan Boyar, Lene M. Favrholdt:
The relative worst order ratio for online algorithms. 22 - Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. 23 - David S. Johnson:
The NP-completeness column: Finding needles in haystacks. 24
Volume 3, Number 3, August 2007
- Jianxing Feng, Daming Zhu:
Faster algorithms for sorting by transpositions and sorting by block interchanges. 25 - Himanshu Gupta, Rephael Wenger:
Constructing pairwise disjoint paths with few links. 26 - Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd:
Multicommodity demand flow in a tree and packing integer programs. 27 - Amotz Bar-Noy, Richard E. Ladner, Tami Tamir:
Windows scheduling as a restricted version of bin packing. 28 - Carmit Hazay, Moshe Lewenstein, Dina Sokol:
Approximate parameterized matching. 29 - Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation results for the stable marriage problem. 30 - Piotr Indyk, Assaf Naor:
Nearest-neighbor-preserving embeddings. 31 - Eyal Even-Dar, Alexander Kesselman, Yishay Mansour:
Convergence time to Nash equilibrium in load balancing. 32 - Matthew Andrews, Lisa Zhang:
Routing and scheduling in multihop wireless networks with time-varying channels. 33 - Moni Naor, Udi Wieder:
Novel architectures for P2P applications: The continuous-discrete approach. 34 - Samir Khuller:
Problems column. 35
Volume 3, Number 4, November 2007
- Harold N. Gabow, Michael A. Bender, Martin Farach-Colton:
Introduction to SODA 2002 and 2003 special issue. 36 - James Aspnes, Gauri Shah:
Skip graphs. 37:1--37:25 - Yijie Han:
Optimal parallel selection. 38 - Nikhil Bansal, Kedar Dhamdhere:
Minimizing weighted flow time. 39 - Jittat Fakcharoenphol, Chris Harrelson, Satish Rao:
The k-traveling repairmen problem. 40 - Sandy Irani, Sandeep K. Shukla, Rajesh Gupta:
Algorithms for power savings. 41 - Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan:
Guessing secrets efficiently via list decoding. 42 - Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. 43 - Svante Janson, Wojciech Szpankowski:
Partial fillup and search time in LC tries. 44 - John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k shortest simple paths: A new algorithm and its implementation. 45 - Chandra Chekuri, Sanjeev Khanna:
Edge-disjoint paths revisited. 46 - Joseph Cheriyan, Mohammad R. Salavatipour:
Packing element-disjoint steiner trees. 47 - Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems. 48 - Susanne Albers, Hiroshi Fujiwara:
Energy-efficient algorithms for flow time minimization. 49 - Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý:
Improved online algorithms for buffer management in QoS switches. 50 - Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton:
Oblivious routing on node-capacitated and directed graphs. 51 - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
Routing selfish unsplittable traffic. 52
a service of 
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 2024-05-08 01:03 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 was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
