Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarInformation Processing Letters, Volume 64
Volume 64, Number 1, 14 October 1997
Elisa Bertino, Barbara Catania, Boris Shidlovsky:
Towards Optimal Two-Dimensional Indexing for Constraint Databases. 1-8- E. Belogay, Carlos Cabrelli, Ursula Molter, Ron Shonkwiler:
Calculating the Hausdorff Distance Between Curves. 17-22 - Jovan Dj. Golic, Mahmoud Salmasizadeh, Leonie Simpson, Ed Dawson:
Fast Correlation Attacks on Nonlinear Filter Generators. 37-42 - Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton, Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay:
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource. 43-51
Volume 64, Number 2, 28 October 1997
- Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg:
An Approximate Model of Processor Communication Rings Under Heavy Load. 61-67 - Mikhail Y. Kovalyov, Yakov M. Shafransky:
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. 69-74 - Laurent Coupry:
A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem in Undirected Planar Graphs. 83-86 - Injong Rhee, Jennifer L. Welch:
Time Bounds on Synchronization in a Periodic Distributed System. 87-93
Volume 64, Number 3, 14 November 1997
- Frank K. H. A. Dehne, Katia S. Guimarães:
Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. 107-114 - Min-Sheng Lin, Deng-Jyi Chen:
The Computational Complexity of the Reliability Problem on Distributed Systems. 143-147 - Enrico Nardelli, Vincenzo Mastrobuoni, Alesiano Santomo:
Computing a Poset from its Realizer. 149-154
Volume 64, Number 4, 28 November 1997
- Stephen Alstrup, Jens P. Secher, Maz Spork:
Optimal On-Line Decremental Connectivity in Trees. 161-164 - Santosh N. Kabadi, Yash P. Aneja:
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. 173-177 - Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe:
Partial Occam's Razor and its Applications. 179-185 - Jerzy Tyszkiewicz:
A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions. 187-195 - Silvano Di Zenzo, Paolo Bottoni, Piero Mussio:
A Notion of Information Related to Computation. 207-215
Volume 64, Number 5, 15 December 1997
- Muhammad Rabi, Alan T. Sherman:
An Observation on Associative One-Way Functions in Complexity Theory. 239-244 - Yang Dai, Kazuo Iwano, Naoki Katoh:
A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. 255-261 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
A Technique for Adding Range Restrictions to Generalized Searching Problems. 263-269
Volume 64, Number 6, 29 December 1997
- Vikram Iyengar, Krishnendu Chakrabarty:
An Efficient Finite-State Machine Implementation of Huffman Decoders. 271-275 - Thomas Graf, V. Kamakoti:
Sparse Dominance Queries for Many Points in Optimal Time and Space. 287-291 - Paolo Boldi, Sebastiano Vigna:
Minimal Sense of Direction and Decision Problems for Cayley Graphs. 299-303
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-23 05:14 CEST by the dblp team