default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 70
Volume 70, Number 1, 16 April 1999
- Robert Harper, John C. Mitchell:
Parametricity and Variants of Girard's J Operator. 1-5 - James F. Korsh, Paul LaFollette:
Loopless Generation of Gray Codes for k-Ary Trees. 7-11 - Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams:
On Edge-Disjoint Spanning Trees in Hypercubes. 13-16 - Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing. 17-22 - Antonín Kucera
:
On Finite Representations of Infinite-State Behaviours. 23-30 - Jyrki Katajainen, Tomi Pasanen:
In-Place Sorting with Fewer Moves. 31-37 - Samir Khuller, Anna Moss, Joseph Naor:
The Budgeted Maximum Coverage Problem. 39-45 - Hadas Shachnai, John Turek:
Multiresource Malleable Task Scheduling to Minimize Response Time. 47
Volume 70, Number 2, 30 April 1999
- Wenceslas Fernandez de la Vega, Marek Karpinski:
On the Approximation Hardness of Dense TSP and Other Path Problems. 53-55 - Florian Roussel, Irena Rusu:
A Linear Algorithm to Color i-Triangulated Graphs. 57-62 - M. D. Atkinson, Jörg-Rüdiger Sack:
Pop-Stacks in Parallel. 63-67 - Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, Gigliola Vaglini:
Abstract Interpretation of Trace Semantics for Concurrent Calculi. 69-78 - Narn-Yih Lee, Tzonelih Hwang, Chih-Hung Wang:
The Security of Two ID-Based Multisignature Protocols for Sequential and Broadcasting Architectures. 79-81 - Eli Biham, Dan Boneh, Omer Reingold:
Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. 83-87 - Leonie Simpson, Jovan Dj. Golic, Mahmoud Salmasizadeh, Ed Dawson:
A Fast Correlation Attack on Multiplexer Generators. 89-93 - Arnold Rosenbloom:
On the Sets of Perfect Matchings for Two Bipartite Graphs. 95-97 - K. Rustan M. Leino, Raymie Stata:
Virginity: A Contribution to the Specification of Object-Oriented Software. 99-105
Volume 70, Number 3, 14 May 1999
- William E. Wright:
A Refinement of Replacement Selection. 107-111 - Sanjay Jain:
On a Question of Nearly Minimal Identification of Functions. 113-117 - Francesco Quaglia, Roberto Baldoni:
Exploiting Intra-Object Dependencies in Parallel Simulation. 119-125 - David R. Powell, Lloyd Allison, Trevor I. Dix:
A Versatile Divide and Conquer Technique for Optimal String Alignment. 127-139 - Yefim Dinitz, Alon Itai, Michael Rodeh:
On an Algorithm of Zemlyachenko for Subtree Isomorphism. 141-146 - Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. 147-152 - Wen-Guey Tzeng:
Common Modulus and Chosen-Message Attacks on Public-Key Schemes with Linear Recurrence Relations. 153-156
Volume 70, Number 4, 28 May 1999
- Anna Bernasconi:
On the Complexity of Balanced Boolean Functions. 157-163 - Elisa Bertino, Barbara Catania, Limsoon Wong:
Finitely Representable Nested Relations. 165-173 - Yangjun Chen:
Arc Consistency Revisited. 175-184 - Amihood Amir, Ayelet Butman, Moshe Lewenstein:
Real Scaled Matching. 185-190 - Yen-Chun Lin, Chun-Keng Liu:
Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time. 191-195 - Kuo-Chan Huang, Feng-Jian Wang, Jyun-Hwei Tsai:
Two Design Patterns for Data-Parallel Computation Based on Master-Slave Model. 197-204
Volume 70, Number 5, 21 June 1999
- Harry Buhrman, Ronald de Wolf:
A Lower Bound for Quantum Search of an Ordered List. 205-209 - Paz Morillo, Carles Padró, Germán Sáez, Jorge Luis Villar:
Weighted Threshold Secret Sharing Schemes. 211-216 - J. D. Emerald, K. G. Subramanian, D. Gnanaraj Thomas:
A Note on Inferring Uniquely Terminating Code Languages. 217-222 - Matthew Young-Lai:
Adding State Merging to the DMC Data Compression Algorithm. 223-228 - Öjvind Johansson:
Simple Distributed Delta+1-coloring of Graphs. 229-232 - David Guijarro, Víctor Lavín, Vijay Raghavan:
Exact Learning when Irrelevant Variables Abound. 233-239 - Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad:
On Average Edge Length of Minimum Spanning Trees. 241-243 - Deborah S. Franzblau:
Ear Decomposition with Bounds on Ear Length. 245-249 - Srinivasa Rao Arikati, Kurt Mehlhorn:
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. 251-254
Volume 70, Number 6, 30 June 1999
- Wen-Ping Hwang, Ching-Lin Wang:
In-Place Random List Permutations. 255-257 - Chun-yen Chou, D. J. Guan, Kuei-lin Wang:
A Dynamic Fault-Tolerant Message Routing Algorithm for Double-Loop Networks. 259-264 - Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik:
A Note on Equations for Commutative Regular Languages. 265-267 - Ekkart Kindler, Wil M. P. van der Aalst:
Liveness, Fairness, and Recurrence in Petri Nets. 269-27
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 2025-12-05 22:37 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:
