default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 52
Volume 52, Number 1, October 1994
- Nakagawa Akinari, Hiroshi Hagiwara:
On the Real-Number Representation with Variable-Length Exponent Field. 1-6 - Charles U. Martel:
Maximum Finding on a Multiple Access Broadcast Network. 7-15 - Torben Æ. Mogensen:
WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time. 15-22 - Md. Mozammel Huq Azad Khan:
An Algorithm for Hazard-Free Minimization of Incompletely Specified Switching Function. 23-29 - Lawrence L. Larmore, Wojciech Rytter:
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. 31-34 - Shao Dong Chen, Hong Shen, Rodney W. Topor:
An Efficient Permutation-Based Parallel Range-Join Algorithm on N-Dimensional Torus Computers. 35-38 - Jon M. Kleinberg:
A Lower Bound for Two-Server Balancing Algorithms. 39-43 - Giulia Galbiati, Francesco Maffioli, Angelo Morzenti:
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. 45-49 - Aohan Mei, Yoshihide Igarashi:
An Efficient Strategy for Robot Navigation in Unknown Environment. 51-56
Volume 52, Number 2, 28 October 1994
- Helmut Seidl:
Haskell Overloading is DEXPTIME-Complete. 57-60 - Mikael Rittri:
Semi-Unification of Two Terms in Abelian Groups. 61-68 - Bern-Cherng Liaw, Richard C. T. Lee:
An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons. 69-75 - Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee:
Recognizing Shortest-Path Trees in Linear Time. 77-85 - Refael Hassin, Shlomo Lahav:
Maximizing the Number of Unused Colors in the Vertex Coloring Problem. 87-90 - Takehiro Tokuda, Yoshimichi Watanabe:
An Attribute Evaluation of Context-Free Languages. 91-98 - Mohamed G. Gouda:
Stabilizing Observers. 99-103 - Jean Mayo, Phil Kearns:
Distributed Termination Detection with Roughly Synchronized Clocks. 105-108 - Thomas Roos, Peter Widmayer:
k-Violation Linear Programming. 109-114
Volume 52, Number 3, 11 November 1994
- Alberto Pedrotti:
Analysis of a List-Update Strategy. 115-121 - Y. Daniel Liang:
On the Feedback Vertex Set Problem in Permutation Graphs. 123-129 - Kirk Pruhs:
Average-Case Scalable On-Line Algorithms for Fault Replacement. 131-136 - Irène Durand, Bruno Salinier:
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof. 137-145 - Paul F. Dietz, Rajeev Raman
:
A Constant Update Time Finger Search Tree. 147-154 - Luc Devroye, Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Trees. 155-159 - Frank Wagner:
Approximate Map Labeling is in Omega (n log n). 161-165 - Michele Flammini:
On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions. 167-173
Volume 52, Number 4, November 1994
- Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe:
Upward Separation for FewP and Related Classes. 175-180 - Ernie Cohen:
The Convergence Span of Greedy Load Balancing. 181-182 - Chuzo Iwamoto, Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. 183-189 - Su-Hyun Lee, Do-Hyung Kim, Kwang-Moo Choe:
Path for AND-Parallel Execution of Logic Programs. 191-199 - Hung-Min Sun, Shiuh-Pyng Shieh:
On Dynamic Threshold Schemes. 201-206 - Esko Nuutila:
An Efficient Transitive Closure Algorithm for Cyclic Digraphs. 207-213 - Mark de Berg, Marc J. van Kreveld:
Rectilinear Decompositions with Low Stabbing Number. 215-221 - Pierre Kelsen:
An Optimal Parallel Algorithm for Maximal Matching. 223-228
Volume 52, Number 5, 9 December 1994
- Holger Petersen:
Refined Simulation of Multihead Automata. 229-233 - Ronald V. Book:
On Collapsing the Polynomial-Time Hierarchy. 235-237 - Samir Khuller, Uzi Vishkin:
On the Parallel Complexity of Digraph Reachability. 239-241 - James F. Korsh:
Loopless Generation of k-Ary Tree Sequences. 243-247 - Eric T. Bax:
Algorithms to Count Paths and Cycles. 249-252 - Mark Allen Weiss:
Linear-Time Construction of Treaps and Cartesian Trees. 253-257 - Jin-Tai Yan, Pei-Yung Hsiao:
A Fuzzy Clustering Algorithm for Graph Bisection. 259-263 - Zhi-Zhong Chen:
A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. 265-271 - Zbigniew Duszak, Waldemar W. Koczkodaj:
Generalization of a New Definition of Consistency for Pairwise Comparisons. 273-276 - Fabrizio Luccio, Alberto Pedrotti:
A Parallel List Update Problem. 277-284
Volume 52, Number 6, 23 December 1994
- Jan A. Bergstra, Gheorghe Stefanescu:
Bisimulation is Two-Way Simulation. 285-287 - Arturo Carpi:
On Repeated Factors in C^\infty-Words. 289-294 - Subir Bhattacharya, Amitava Bagchi:
A General Framework for Minimax Search in Game Trees. 295-301 - Philip N. Klein:
A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm. 303-307 - Y. Daniel Liang:
Dominations in Trapezoid Graphs. 309-315 - Jing-Ho Yan, Gerard J. Chang:
The Path-Partition Problem in Block Graphs. 317-322 - Holger Petersen:
On the Determinacy Problem for Two-Way Pushdown Automata. 323-324 - Luke O'Connor:
An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion. 325-327 - Ravi B. Boppana:
The Decision-Tree Complexity of Element Distinctness. 329-331 - Wan J. Fokkink:
A Complete Equational Axiomatization for Prefix Iteration. 333-337 - Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
Corrigendum: An Optimal Lower Bound for Nonregular Languages. 339 - Erl-Huei Lu, Yi-Chang Cheng, Hsiao-Peng Wuu:
Corrigendum: A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m. 341
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-11 21:17 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:
