default search action
Information Processing Letters, Volume 93
Volume 93, Number 1, January 2005
- Tee Connie
, Andrew Teoh Beng Jin
PalmHashing: a novel approach for cancelable biometrics. 1-5 - Daiji Fukagawa, Tatsuya Akutsu
Performance analysis of a greedy algorithm for inferring Boolean functions. 7-12 - Haim Kaplan, Nira Shafrir:
The greedy algorithm for shortest superstrings. 13-17 - Fengfeng Zhou
No-wait scheduling in single-hop multi-channel LANs. 19-24 - Michaël Quisquater, Bart Preneel, Joos Vandewalle:
Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree l and order k. 25-28 - Jun Zheng
Diagnosability of star graphs under the comparison diagnosis model. 29-36 - Sheng Zhou, Christopher B. Jones:
HCPO: an efficient insertion order for incremental Delaunay triangulation. 37-42 - Daewan Han, Moonsik Lee:
An algebraic attack on the improved summation generator with 2-bit memory. 43-46 - Raúl Durán Díaz, Jaime Muñoz Masqué:
Optimal strong primes. 47-52
Volume 93, Number 2, January 2005
- Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subfamilies of limited size. 53-56 - Afzel Noore, Patrick L. Cross:
Modeling the reliability of large dynamic distributed non-homogeneous networks. 57-61 - Haejae Jung:
The d-deap ast: a fast and simple cache-aligned d-ary deap. 63-67 - Steffen Heber
Common intervals of trees. 69-74 - Celina M. H. de Figueiredo
Note on the Homogeneous Set Sandwich Problem. 75-81 - Gill Barequet, Gershon Elber:
Optimal bounding cones of vectors in three dimensions. 83-89 - Angeline Wong, Leejay Wu, Phillip B. Gibbons, Christos Faloutsos
Fast estimation of fractal dimension and correlation integral on stream data. 91-97 - Jun-Jie Pan, Gerard J. Chang
Isometric-path numbers of block graphs. 99-102
Volume 93, Number 3, February 2005
- Akio Fujiyoshi:
Linearity and nondeletion on monadic context-free tree grammars. 103-107 - Andrzej Pelc, David Peleg:
Broadcasting with locally bounded Byzantine faults. 109-115 - Mirtha-Lina Fernández:
Relaxing monotonicity for innermost termination. 117-123 - L. Sunil Chandran, Fabrizio Grandoni
Refined memorization for vertex cover. 123-131 - Jianxi Fan, Xiaola Lin
Node-pancyclicity and edge-pancyclicity of crossed cubes. 133-138 - Jouni K. Seppänen:
Upper bound for the approximation ratio of a class of hypercube segmentation algorithms. 139-141 - Sudip Seal, Srikanth Komarina, Srinivas Aluru:
An optimal hierarchical clustering algorithm for gene expression data. 143-147 - Ludwig Staiger
Constructive dimension equals Kolmogorov complexity. 149-153
Volume 93, Number 4, February 2005
- Mirtha-Lina Fernández:
On proving CE-termination of rewriting by size-change termination. 155-162 - Alexander Thomasian:
Reconstruct versus read-modify writes in RAID. 163-168 - Andrzej Lingas, Martin Wahlen:
A note on maximum independent set and related problems on box graphs. 169-171 - Minghui Jiang:
UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. 173-175 - Jun-Ho Her, R. S. Ramakrishna:
External-memory depth-first search algorithm for solid grid graphs. 177-183 - Nathan Segerlind:
Exponential separation between Res(k) and Res(k+1) for k leq varepsilonlogn. 185-190 - Mingyan Li, Radha Poovendran
Minimizing center key storage in hybrid one-way function based group key management with communication constraints. 191-198 - Stelvio Cimato
Ideal contrast visual cryptography schemes with reversing. 199-206
Volume 93, Number 5, March 2005
- Sandeep S. Kulkarni, Chase Bolen, John Oleszkiewicz, Andrew Robinson:
Alternators in read/write atomicity. 207-215 - Mohammad Reza Mousavi
A syntactic commutativity format for SOS. 217-223 - Franck Leprévost
Generating anomalous elliptic curves. 225-230 - Hiroshi Nagamochi:
On computing minimum (s, t)-cuts in digraphs. 231-237 - Frédéric Chataigner:
Approximating the Maximum Agreement Forest on k trees. 239-244 - Min Xu, Junming Xu, Xinmin Hou
Fault diameter of Cartesian product graphs. 245-248 - I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao
A fast algorithm for computing a longest common increasing subsequence. 249-253 - Xiaohu Shi, Yanchun Liang, H. P. Lee, Chun Lu
An improved GA and a novel PSO-GA-based hybrid algorithm. 255-261
Volume 93, Number 6, March 2005
- Frank Nielsen
A fast deterministic smallest enclosing disk approximation algorithm. 263-268 - Ryoichi Kato, Osamu Watanabe:
Substring search and repeat search using factor oracles. 269-274 - Sung Kwon Kim:
Finding a longest nonnegative path in a constant degree tree. 275-279 - K. Rustan M. Leino:
Efficient weakest preconditions. 281-288 - Sibylle B. Fröschle:
The decidability border of hereditary history preserving bisimilarity. 289-293 - Ruy Fabila Monroy, Jorge Urrutia:
Graham triangulations and triangulations with a center are hamiltonean. 295-299 - Mikio Kano, Criel Merino
On plane spanning trees and cycles of multicolored point sets with few intersections. 301-306 - Thierry Garcia
A Coarse-Grained Multicomputer algorithm for the detection of repetitions. 307-313
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-12-19 22:13 CET 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: