Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarInformation Processing Letters, Volume 101
Volume 101, Number 1, January 2007
- Houman Alborzi, Hanan Samet:
Execution time analysis of a top-down R-tree construction algorithm. 6-12 - Eric McDermid, Christine T. Cheng, Ichiro Suzuki:
Hardness results on the man-exchange stable marriage problem with short preference lists. 13-19 - Uriel Feige, James R. Lee:
An improved approximation ratio for the minimum linear arrangement problem. 26-29 - Faisal N. Abu-Khzam, Michael A. Langston:
Linear-time algorithms for problems on planar graphs with fixed disk dimension. 36-40 - Yoshinobu Kawabe, Ken Mano, Hideki Sakurada, Yasuyuki Tsukada:
Theorem-proving anonymity of infinite-state systems. 46-51
Volume 101, Number 2, January 2007
- Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
On the longest increasing subsequence of a circular list. 55-59 - Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi:
Wait-free regular storage from Byzantine components. 60-65 - Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata:
Isomorphic factorization, the Kronecker product and the line digraph. 72-77 - MoonBae Song, KwangJin Park, Ki-Sik Kong, SangKeun Lee:
Bottom-up nearest neighbor search for R-trees. 78-85
Volume 101, Number 3, February 2007
- Lev Reyzin, Nikhil Srivastava:
On the longest path algorithm for reconstructing trees from distance matrices. 98-100 - Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto:
An improved exact algorithm for the domatic number problem. 101-106 - Ulrich Ultes-Nitsche:
A power-set construction for reducing Büchi automata to non-determinism degree two. 107-111 - Dana Ron, Amir Rosenfeld, Salil P. Vadhan:
The hardness of the Expected Decision Depth problem. 112-118 - Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter:
On transitive orientations with restricted covering graphs. 119-125 - Michael J. Collins, David Kempe, Jared Saia, Maxwell Young:
Nonnegative integral subset representations of integer sets. 129-133
Volume 101, Number 4, February 2007
- Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
A global parallel algorithm for the hypergraph transversal problem. 148-155 - Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang:
A self-stabilizing (Delta+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems. 168-173 - Wenbin Chen, Jiangtao Meng:
An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity). 174-179
Volume 101, Number 5, March 2007
- Emmanuelle Anceaume, Roy Friedman, Maria Gradinariu:
Managed Agreement: Generalizing two fundamental distributed agreement problems. 190-198 - J. Guadalupe Ramos, Josep Silva, Germán Vidal:
Ensuring the quasi-termination of needed narrowing computations. 220-226
Volume 101, Number 6, March 2007
- Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai:
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes. 227-232 - Shuang Luan, Jared Saia, Maxwell Young:
Approximation algorithms for minimizing segments in radiation therapy. 239-244 - Martin Dietzfelbinger, Henning Wunderlich:
A characterization of average case communication complexity. 245-249 - Paulo Sérgio Almeida, Carlos Baquero, Nuno M. Preguiça, David Hutchison:
Scalable Bloom Filters. 255-261 - Rami A. AL-Na'mneh, W. David Pan:
Five-step FFT algorithm with reduced computational complexity. 262-267
maintained by 
, founded at 
, founded at 
last updated on 2019-02-14 22:18 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
