Information Processing Letters, Volume 62
Volume 62, Number 1, 14 April 1997
- Anna Gál: A Simple Function that Requires Exponential Size Read-Once Branching Programs. 13-16
- H. V. Jagadish: Analysis of the Hilbert Curve for Representing Two-Dimensional Space. 17-22
- Manolis Gergatsoulis: Unfold/fold Transformations for Disjunctive Logic Programs. 23-29
- Javier Orozco, Ricardo Cayssials, Jorge Santos, Edgardo Ferro: 802.4 Rate Monotonic Scheduling in Hard Real-Time Environments: Setting the Medium Access Control Parameters. 47-55
Volume 62, Number 2, 28 April 1997
- Erkki Mäkinen: Inferring Uniquely Terminating Regular Languages from Positive Data. 57-60
- Assef Chmeiss, Philippe Jégou: A Generalization of Chordal Graphs and the Maximum Clique Problem. 61-66
- Hee-Joong Kang, Kawon Kim, Jin H. Kim: Approximating Optimally Discrete Probability Distribution with kth-Order Dependency for Combining Multiple Decisions. 67-75
- Sung-Ming Yen, Kuo-Hong Liao: Shared Authentication Token Secure Against Replay and Weak Key Attacks. 77-80
- Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. 81-88
- Amihood Amir, Emanuel Dar: An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. 95-101
- Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide: Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. 103-110
Volume 62, Number 3, 14 May 1997
- David Eppstein: Dynamic Connectivity in Digital Images. 121-126
- Ching-Nung Yang, Chi-Sung Laih: A Note on Error-Correcting Codes for Authentication and Subliminal Channels. 141-143
- Eric Bach: The Complexity of Number-Theoretic Constants. 145-152
- Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha: An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. 153-159
- Marius Zimand: Large Sets in AC0 have Many Strings with Low Kolmogorov Complexity. 165-170
Volume 62, Number 4, 28 May 1997
- Gabriel Istrate: The Strong Equivalence of ET0L Grammars. 171-176
- Rimli Sengupta: Cancellation is Exponentially Powerful for Computing the Determinant. 177-181
- Wan Fokkink: Unification for Infinite Sets of Equations Between Finite Terms. 183-188
- Shoichi Hirose, Katsuo Ikeda: A Conference Key Distribution System for the Star Configuration Based on the Discrete Logarithm Problem. 189-192
- Guozhu Dong, Chaoyi Pang: Maintaining Transitive Closure in First Order After Node-Set and Edge-Set Deletions. 193-199
- Feng Bao, Aohan Mei, Yoshihide Igarashi: Average Competitive Ratios of On-Line Spanning Trees. 213-216
- Wim F. J. Verhaegh, Emile H. L. Aarts: A Polynomial-Time Algorithm for Knapsack with Divisible Item Sizes. 217-221
Volume 62, Number 5, 13 June 1997
- Md. Mozammel Huq Azad Khan, Md. Shamsul Alam: Algorithms for Conversion of Minterms to Positive Polarity Reed-Muller Coefficients and Vice Versa. 223-230
- Timothy Lambert: An Optimal Algorithm for Realizing a Delaunay Triangulation. 245-250
- James W. Gray III: On the Clark-Jacob Version of SPLICE/AS. 251-254
- Wai Yin Mok: On Keys and Normal Forms. 255-258
- Montserrat Hermo: Compressibility and Uniform Complexity. 259-264
- V. A. Vassiliev: On Decision Trees for Orthants. 265-268
- Anna Formica, Michele Missikoff: A Verification Algorithm for Inheritance Hierarchies in Object-Oriented Databases. 269-279
Volume 62, Number 6, 27 June 1997
- Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier: An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs. 281-287
- Jacques Justin, Giuseppe Pirillo: On Some Factorizations of Infinite Words by Elements of Codes. 289-294
- Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram: A Note on Optical Routing on Trees. 295-300
- Yuan Ma, Serge A. Plotkin: An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. 301-303
- Masataka Sassa, Takuya Ookubo: Systematic Debugging Method for Attribute Grammar Description. 305-313
- Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki: A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. 315-322
- Shin-ichi Nakayama, Shigeru Masuyama: A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. 323-327
- Paul Pritchard: An Old Sub-Quadratic Algorithm for Finding Extremal Sets. 329-334
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team