default search action
Information Processing Letters, Volume 58
Volume 58, Number 1, 8 April 1996
- Thierry Lacoste:
Finitistic Proofs of 0-1 Laws for Fragments of Second-Order Logic. 1-4 - Stewart W. Neufeld:
A Pursuit-Evasion Problem on a Grid. 5-9 - S. Harikumar, Shashi Kumar:
Iterative Deepening Multiobjective A. 11-15 - Bagirath R. Krishnamachari, Ravi Mittal:
Design and Analysis of a Generalized Multi-Ring Architecture. 17-21 - Madhav V. Marathe, S. S. Ravi:
On Approximation Algorithms for the Minimum Satisfiability Problem. 23-29 - Hervé Caussinus:
A Note on a Theorem of Barrington, Straubing and Thérien. 31-33 - Mitsunori Ogihara
:
Functions Computable with Limited Access to NP. 35-38 - Richard J. Lipton:
On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory. 39-42 - Wen-Guey Tzeng:
On Path Equivalence of Nondeterministic Finite Automata. 43-46 - Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. 47-53
Volume 58, Number 2, 22 April 1996
- Oscar Garrido, Pierre Kelsen, Andrzej Lingas:
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. 55-58 - R. Balasubramanian, S. V. Nagaraj
Perfect Power Testing. 59-63 - Chia-Chiang Chao, Wen-Tsuen Chen, Gen-Huey Chen:
Multiple Search Problen on Reconfigurable Meshes. 65-69 - Horst A. Eiselt, Michel Gendreau, Gilbert Laporte:
Optimal Location of Facilities on a Network with an Unreliable Node or Link. 71-74 - Changwook Kim:
Unambiguous Description of Chain Code Picture Languages. 75-79 - Marcelo M. de Azevedo, Nader Bagherzadeh, Martin Dowd, Shahram Latifi:
Some Topological Properties of Star Connected Cycles. 81-85 - Dong-Yul Ra, Jong-Hyun Kim:
A Parallel Parsing Algorithm for Arbitrary Context-Free Grammars. 87-96 - Shigetomo Kimura
Extension of Synthesis Algorithm of Recursive Processes to \mu-Calculus. 97-104
Volume 58, Number 3, 13 May 1996
- Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. 105-110 - B. S. Panda:
New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. 111-115 - Koji Obokata, Yasuaki Nishitani, Yoshihide Igarashi:
A Probably Optimal Embedding of Hyper-Rings in Hypercubes. 117-122 - Sang-Koo Seo, Yoon-Joon Lee:
Applicability of Genetic Algorithms to Optimal Evaluation of Path Predicates in Object-Oriented Queries. 123-128 - Tomio Hirata:
A Unified Linear-Time Algorithm for Computing Distance Maps. 129-133 - Amnon Ta-Shma
A Note on PCP vs. MIP. 135-140 - Twan Basten
Branching Bisimilarity is an Equivalence Indeed! 141-147 - Weifa Liang
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems. 149-155
Volume 58, Number 4, 27 May 1996
- Jakob Rehof:
Strong Normalization for Non-Structural Subtyping via Saturated Sets. 157-162 - Anna Ciampolini, Evelina Lamma, Paola Mello:
An Abstract Interpretation Framework for Optimizing Dynamic Modular Logic Languages. 163-170 - Leizhen Cai:
Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. 171-176 - Piercarlo Grandi:
Implementing (Nondeterministic) Parallel Assignments. 177-179 - V. Balachandran, P. Nagavamsi, C. Pandu Rangan:
Clique Transversal and Clique Independence on Comparability Graphs. 181-184 - Jean-Camille Birget:
The State Complexity of \Sigma * L and its Connection with Temporal Logic. 185-188 - Shin-Jia Hwang, Chin-Chen Chang, Wei-Pang Yang:
Autenticated Encryption Schemes with Message Linkage. 189-195 - Kai Salomaa:
Yield-Languages of Two-Way Pushdown Tree Automata. 195-199 - Vishv M. Malhotra
Storage-Efficient Data Structure for Large Lookup Dictionaries. 201-206
Volume 58, Number 5, 10 June 1996
- Thomas Hofmeister, Hanno Lefmann:
Independent Sets in Graphs with Triangles. 207-210 - Boris Shidlovsky, Elisa Bertino:
On the Number of Descendants in an Object DAG. 211-216 - Livio Colussi, Alessia De Col:
A Time and Space Efficient Data Structure for String Searching on Large Texts. 217-222 - Alan Burns, Robert I. Davis:
Choosing Task Periods to Minimise System Utilisation in Time Triggered Systems. 223-229 - Lucas Chi Kwong Hui, Charles U. Martel:
Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches. 231-236 - Rutger M. Dijkstra:
"Everywhere" in Predicate Algebra and Modal Logic. 237-243 - Micha Sharir:
Excess in Arrangements of Segments. 245-247 - Domenico Saccà
Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems. 249-254 - Jacek Blazewicz
Scheduling Complete Intrees on Two Uniform Processors with Communication Delays. 255-263
Volume 58, Number 6, 24 June 1996
- Andrew Lim
Minimum Area Joining of k Compacted Cells. 265-269 - Aaron B. Binkley, Stephen R. Schach:
A Comparison of Sixteen Quality Metrics for Object-Oriented Design. 271-275 - Siu-Wing Cheng
Widest Empty L-Shaped Corridor. 277-283 - Wakaha Ogata
Multisymbol Majority Vote and Hard Core. 285-292 - Satoshi Obana, Kaoru Kurosawa:
Veto is Impossible in Secret Sharing Schemes. 293-295 - Ludwig Staiger
Codes, Simplifying Words, and Open Set Condition. 297-301 - Ben H. H. Juurlink, Harry A. G. Wijshoff:
Communication Primitives for BSP Computers. 303-310 - Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs. 311-318 - Lisa Higham, Teresa M. Przytycka:
A Simple, Efficient Algorithm for Maximum Finding on Rings. 319-324 - Mohan Ahuja:
Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time (Erratum). 325
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-11-15 19:21 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: