default search action
Information Processing Letters, Volume 49
Volume 49, Number 1, 14 January 1994
- Vittoria Gianuzzi:
Distributed Termination Detection in Reducible Communication Graphs. 1-8 - Esko Nuutila, Eljas Soisalon-Soininen:
On Finding the Strongly Connected Components in a Directed Graph. 9-14 - Mikael Goldmann, Per Grape, Johan Håstad
:
On Average Time Hierarchies. 15-20 - Kanchana Kanchanasut:
A Shortest-Path Algorithm for Manhattan Graphs. 21-25 - Mounir Belbaraka, Ivan Stojmenovic:
On Generating B-Trees with Constant Average Delay and in Lexicographic Order. 27-32 - D. Veljan:
Computing Values of a Polynomial with Only few Multiplications. 33-37 - Hing-Fung Ting, Andrew Chi-Chih Yao:
A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. 39-43 - Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. 45-50 - Haim Kaplan, Ron Shamir
The Domatic Number Problem on Some Perfect Graph Families. 51-56
Volume 49, Number 2, 28 January 1994
- Gurdip Singh:
Real-Time Leader Election. 57-61 - Min-Soo Jung, Kwang-Moo Choe, Taisook Han:
An Efficient Computation of Right Context for LR-Based Error Repair. 63-71 - Sanjeev Saxena:
Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. 73-76 - Peter Gemmell, Mor Harchol-Balter:
Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly. 77-83 - Joachim Steinbach:
Generating Polynomial Orderings. 85-93 - Harry G. Mairson:
Generating Words in a Context-Free Language Uniformly at Random. 95-99 - Jan Willem Klop, Aart Middeldorp
Modularity of Confluence: A Simplified Proof. 101-109
Volume 49, Number 3, 11 February 1994
- Amihood Amir, Martin Farach
Alphabet Dependence in Parameterized Matching. 111-115 - Sung Kwon Kim:
The Range Co-Minima Problem. 117-121 - M. Ladermann, Holger Petersen:
Notes on Looping Deterministic Two-Way Pushdown Automata. 123-127 - Tze Fen Li, Sung Wu Chang:
An Algorithm to Estimate the Fraction Defective and The Exponential Mean Life Using Unlabeled Samples. 129-133 - Yukio Shibata, Miyuki Shirahata, Shingo Osawa:
Counting Closed Walks in Generalized de Bruijn Graphs. 135-138 - B. S. Panda, Shreedhara Prasada Mohanty:
Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. 139-143 - Zoran Jovanovic, Jelena V. Misic:
Fault Tolerance of the Star Graph Interconnection Network. 145-150 - Maria Luisa Bonet
Size-Depth Tradeoffs for Boolean Fomulae. 151-155 - S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan:
A Processor Efficient MIS Algorithm on Random Graphs. 157-163
Volume 49, Number 4, 25 February 1994
- Chien-Min Wang
A New Routing Algorithm for Cyclic Shifts on BRGC Hypercubes. 165-169 - Nen-Fu Huang, Ching-Ho Huang, Yue-Li Wang:
A Sweepline Algorithm to Solve the Two-Center Problem. 171-177 - Aldo de Luca, Licia Mione:
On Bispecial Factors of the Thue-Morse Word. 179-183 - John H. Leuchner, Les Miller, Giora Slutzki:
A Note on the Equivalence of a Set of Egds to a Set of FDs. 185-188 - Kenneth L. Calvert:
Eliminating Disjunctions of Leads-to Properties. 189-194 - Gil Neiger:
Distributed Consensus Revisited. 195-201 - Dongseung Kim, Joonyoung Park:
Two-Way Dominant Sequence Clustering for Processor Scheduling. 203-208 - Eddie Cheng
A Faster Algorithm for Computing the Strength of a Network. 209-212 - Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:
A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. 213-218
Volume 49, Number 5, 11 March 1994
- Roni Khardon:
On Using the Fourier Transform to Learn Disjoint DNF. 219-222 - Wolfgang J. Paul:
A Note on Bitonic Sorting. 223-225 - Michiel C. van Wezel, Gerard Tel:
An Assertional Proof of Rana's Algorithm. 227-233 - Dany Breslauer:
Testing String Superprimitivity in Parallel. 235-241 - Prasoon Tiwari, Martin Tompa:
A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. 243-248 - Kaizhong Zhang, Tao Jiang
Some MAX SNP-Hard Results Concerning Unordered Labeled Trees. 249-254 - Mihail N. Kolountzakis:
Selection of a Large Sum-Free Subset in Polynomial Time. 255-256 - Lih-Chyau Wuu, Shing-Tsaan Huang:
Identity Assignment in Uniform Synchronous Rings. 257-262 - Sriram V. Pemmaraju, Clifford A. Shaffer:
Analysis of the Worst Case Space Complexity of a PR Quadtree. 263-267 - Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza:
Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors. Inf. Process. Lett. 49(5): 269-270 (1994)
Volume 49, Number 6, 22 March 1994
- Gerard Tel:
Maximal Matching Stabilizes in Quadratic Time. 271-272 - Leonid Libkin, Limsoon Wong
Conservativity of Nested Relational Calculi with Internal Generic Functions. 273-280 - Victor Chepoi, Feodor F. Dragan:
Computing a Median Point of a Simple Rectilinear Polygon. 281-285 - Al Borchers, Prosenjit Gupta:
Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. 287-290 - Sergio Rajsbaum:
Upper and Lower Bounds for Stochastic Marked Graphs. 291-295 - Zeev Collin, Shlomi Dolev
Self-Stabilizing Depth-First Search. 297-301 - G. Sajith, Sanjeev Saxena:
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. 303-308 - Viggo Kann:
Maximum Bounded H-Matching is MAX SNP-Complete. 309-318 - Hari N. Reddy, Ernst L. Leiss:
An O(log N) Algorithm to Solve Linear Recurrences on Hypercubes. 319-325 - Helmut Prodinger:
An Asymptotic Comment on a Paper by Analyti and Pramanik. 327-328
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-27 20: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: