Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 42
Volume 42, Number 1, 27 April 1992
- Erkki Mäkinen
:
On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. 1-5 - Ambuj K. Singh:
Towards an Understanding of Unbounded Variables in Asynchronous Systems. 7-17 - Lane H. Clark, Farhad Shahrokhi, László A. Székely:
A Linear Time Algorithm for Graph Partition Problems. 19-24 - Helmut Alt, Viliam Geffert, Kurt Mehlhorn:
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. 25-27 - Herbert Fleischner, Gerhard J. Woeginger:
Detecting Cycles Through Three Fixed Vertices in a Graph. 29-33 - Henk Meijer, David Rappaport:
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. 35-38 - Arunabha Sen, Abhijit Sengupta, Subir Bandyopadhyay:
On the Routing Problem in Faulty Supercubes. 39-46 - U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Effective Use of Memory in Iterative Deepening Search. 47-52 - Nimrod Megiddo:
A Note on Approximate Linear Programming. 53 - Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari:
Optimal Time Bounds for Some Proximity Problems in the Plane. 55-60
Volume 42, Number 2, 11 May 1992
- Ching-Chih Han, Kwei-Jay Lin:
Scheduling Real-Time Computations with Separation Constraints. 61-66 - Uwe Trier:
Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees. 67-76 - Ronitt Rubinfeld:
Batch Checking with Applications to Linear Functions. 77-80 - Mike Burmester:
An Almost-Constant Round Interactive Zero-Knowledge Proof. 81-87 - Sang Cho, Dung T. Huynh:
The Parallel Complexity of Coarsest Set Partition Problems. 89-94 - Brigitte Plateau, Denis Trystram:
Optimal Total Exchange for a 3-D Torus of Processors. 95-102 - Jan L. A. van de Snepscheut:
A LISP Programming Exercise. 103-108 - V. Chandru, John N. Hooker:
Detecting Embedded Horn Structure in Propositional Logic. 109-111 - V. Kamakoti, C. Pandu Rangan:
An Optimal Algorithm for Reconstructing a Binary Tree. 113-115 - Naveen Gabrani, Priti Shankar:
A Note on the Reconstruction of a Binary Tree from its Traversals. 117-119
Volume 42, Number 3, 25 May 1992
- Boleslaw K. Szymanski, Balaram Sinharoy:
Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix. 121-126 - Phan Trung Huy, Igor Livotsky, Do Long Van:
Which Finite Monoids are Syntactic Monoids of Rational omega-Languages. 127-132 - Kaizhong Zhang, Richard Statman, Dennis E. Shasha:
On the Editing Distance Between Unordered Labeled Trees. 133-139 - A. Parker, James O. Hamblen:
Optimal Value for the Newton-Raphson Division Algorithm. 141-144 - Ming Li, Paul M. B. Vitányi:
Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. 145-149 - Jeffrey S. Salowe:
A Note on Lower Bounds for Rectilinear Steiner Trees. 151-152 - Thang Nguyen Bui, Curt Jones:
Finding Good Approximate Vertex and Edge Partitions is NP-Hard. 153-159 - Miranda Mowbray:
Finitary Logics for Some CCS Observational Bisimulations. 161-165 - Jan Friso Groote:
A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes. 167-171 - U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. 173-177
Volume 42, Number 4, 19 June 1992
- Tzonelih Hwang:
Protocols for Group Oriented Secret Sharing. 179-182 - Avrim Blum:
Rank-r Decision Trees are a Subclass of r-Decision Lists. 183-185 - Cevdet Aykanat, Füsun Özgüner:
A Fault-Tolerant Hexagonal Systolic Array. 187-196 - Lin Chen:
Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals. 197-201 - Ramachandran Vaidyanathan:
Sorting on PRAMs with Reconfigurable Buses. 203-208 - Zhiyong Liu, Jia-Huai You:
An Implementation of a Nonlinear Skewing Scheme. 209-215 - Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
PRAMs with Variable Word-Size. 217-222 - Charles J. Colbourn, Douglas R. Stinson, Luc Teirlinck:
A Parallelization of Miller's n^log n Isomorphism Technique. 223-228 - Alan P. Sprague, K. H. Kulkarni:
Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs. 229-234
Volume 42, Number 5, 3 July 1992
- Khaled Day, Anand R. Tripathi:
Arrangement Graphs: A Class of Generalized Star Graphs. 235-241 - Zhi-Zhong Chen:
A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application. 243-248 - Andrew V. Goldberg:
A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. 249-256 - Stephen K. Wismath:
Computing the Full Visibility Graph of a Set of Line Segments. 257-261 - Jiawei Han:
Binding Propagation Beyond the Reach of Rule/Goal Graphs. 263-268 - Bruce E. Litow:
On Iterated Integer Product. 269-272 - Graham Wrightson, Jo Coldwell:
A Truncation Technique for Clausal Analytic Tableaux. 271-281 - Suresh Singh:
Expected Connectivity and Leader Election in Unreliable Networks. 283-285 - Helen Cameron, Derick Wood:
A Note on the Path Length of Red-Black Trees. 287-292
Volume 42, Number 6, 24 July 1992
- Glenn K. Manacher, Terrance A. Mankus:
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. 293-294 - Peter Bro Miltersen:
Circuit Depth Relative to a Random Oracle. 295-298 - Gerhard J. Woeginger, Zhongliang Yu:
On the Equal-Subset-Sum Problem. 299-302 - Binhai Zhu:
Computing the Shortest Diagonal of a Monotone Polygon in Linear Time. 303-307 - Elias Dahlhaus, Marek Karpinski, Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. 309-313 - Clifford Stein, Joel Wein:
Approximating the Minimum-Cost Maximum Flow is P-Complete. 315-319 - Samir Khuller, Baruch Schieber:
On Independent Spanning Trees. 321-323 - Kenichi Morita:
Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. 325-329 - Antonio Brogi, Anna Ciampolini, Evelina Lamma, Paola Mello:
The Implementation of a Distributed Model for Logic Programming Based on Multiple-Headed Clauses. 331-338 - Eric Goles Ch., Servet Martínez A.:
Automata Networks and Optimization. 339-343 - Nancy G. Kinnersley:
The Vertex Separation Number of a Graph equals its Path-Width. 345-350
a service of 
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-04-19 19:19 CEST 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:
