default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 59
Volume 59, Number 1, 8 July 1996
- Gurmeet Singh Manku:
A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. 1-7 - Stephen Alstrup, Jens Clausen, Kristian Jørgensen:
An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. 9-11 - Dietmar Wätjen, Heike Spilker:
Decidability Results Concerning k-limited ED0L Systems. 13-17 - Thomas Natschläger, Michael Schmitt:
Exact VC-Dimension of Boolean Monomials. 19-20 - Ricardo A. Baeza-Yates
, Chris H. Perleberg:
Fast and Practical Approximate String Matching. 21-27 - Uri Zwick:
On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. 29-30 - Yu-Chen Kuo, Shing-Tsaan Huang:
A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes. 31-36 - Nader H. Bshouty:
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. 37-39 - Monika Henzinger, David P. Williamson:
On the Number of Small Cuts in a Graph. 41-44 - Xiadong Wang, Qingxiang Fu:
A Frame for General Divide-and-Conquer Recurrences. 45-51 - Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert:
Maintaining a Topological Order Under Edge Insertions. 53-58
Volume 59, Number 2, 22 July 1996
- Toshihiro Fujito:
A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach. 59-63 - Paul G. Howard, Jeffrey Scott Vitter:
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding. 65-73 - Ian Glaister, Jeffrey O. Shallit:
A Lower Bound Technique for the Size of Nondeterministic Finite Automata. 75-77 - Brian Dunten, Julie Jones, Jonathan Sorenson:
A Space-Efficient Fast Prime Number Sieve. 79-84 - Dominique Barth:
Optimal Broadcasting in the Back to Back d-ary Trees. 85-89 - Hideo Nagumo, Mi Lu, Karan L. Watson:
On-Line Longest Fragment First Parsing Algorithm. 91-96 - M. S. Madanlal, G. Venkatesan, C. Pandu Rangan:
Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs. 97-102 - Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan:
A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph. 103-107 - Soon Myoung Chung, Pyeong S. Mah:
Semantics-Based Transaction Management for Multidatabase Systems. 109-115
Volume 59, Number 3, 12 August 1996
- Hong Shen, Sarnath Ramnath:
Optimal Parallel Selection in Sorted Matrices. 117-122 - Noga Alon, Phillip G. Bradford, Rudolf Fleischer:
Matching Nuts and Bolts Faster. 123-127 - Gheorghe Paun:
Splicing Systems with Targets are Computationally Universal. 129-133 - Christel Baier, Mila E. Majster-Cederbaum:
Denotational Linear Time Semantics and Sequential Composition. 135-143 - Rohan F. M. Aranha, C. Pandu Rangan:
An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph. 145-150 - Anna Bernasconi:
Sensitivity vs. Block Sensitivity (an Average-Case Study). 151-157 - Carroll Morgan, Annabelle McIver:
Unifying wp and wlp. 159-163 - Tetsuo Moriya, Hideki Yamasaki:
Literal Shuffle on omega-Languages. 165-168 - Sergio De Agostino, James A. Storer:
On-Line Versus Off-Line Computation in Dynamic Text Compression. 169-174
Volume 59, Number 4, 26 August 1996
- Francisco Santos:
Inscribing a Symmetric Body in an Ellipse. 175-178 - Ursula Goltz, Heike Wehrheim:
Modelling Causality via Action Dependencies in Branching Time Semantics. 179-184 - Petrisor Panaite:
Hypercube Permutations Routable Under all Dimension Orderings. 185-189 - Christopher H. Young, Philip A. Wilsey:
A Distributed Method to Bound Rollback Lengths for Fossil Collection in Time Warp Simulators. 191-196 - Wlodzimierz Holsztynski, Waldemar W. Koczkodaj:
Convergence of Inconsistency Algorithms for the Pairwise Comparisons. 197-202 - Andrzej Szepietowski:
The Element Distinctness Problem on One-Tape Turing Machines. 203-206 - Muhammad H. Alsuwaiyel:
Finding a Shortest Hamiltonian Path Inside a Simple Polygon. 207-210 - Bernd Borchert, Antoni Lozano:
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. 211-215 - Yu-Chee Tseng:
Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes. 217-222 - G. Athithan, T. Sony Roy:
Hyperspherical Neighbourhoods and Pattern Recognition Using Neural Networks. 223-228 - Zoran Ivkovic, Errol L. Lloyd:
A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing. 229-232
Volume 59, Number 5, 9 September 1996
- Beate Bollig, Martin Löbbing, Ingo Wegener:
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. 233-239 - Ricardo A. Baeza-Yates, Luis O. Fuentes:
A Framework to Animate String Algorithms. 241-244 - Judi Romijn, Frits W. Vaandrager:
A Note on Fairness in I/O Automata. 245-250 - György Turán, Farrokh Vatan:
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. 251-254 - Frank Nielsen:
Output-Sensitive Peeling of Convex and Maximal Layers. 255-259 - Antonio Hernández-Barrera:
Algorithms for Deciding the Containment of Polygons. 261-265 - Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Parallel Tree-Contraction and Fibonacci Numbers. 267-271 - Keisuke Tanaka, Tetsuro Nishino, Robert Beals:
Negation-Limited Circuit Complexity of Symmetric Functions. 273-279 - Sukumar Ghosh, Arobinda Gupta:
An Exercise in Fault-Containment: Self-Stabilizing Leader Election. 281-288
Volume 59, Number 6, 23 September 1996
- Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka:
Parallel Maximum Independent Set in Convex Bipartite Graphs. 289-294 - Vladimir G. Deineko, Gerhard J. Woeginger:
The Convex-Hull-and-k-Line Travelling Salesman Problem. 295-301 - Helmut Seidl:
Fast and Simple Nested Fixpoints. 303-308 - Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano:
A Note on the Expected Path Length of Trees with Known Fringe. 309-315 - Adele A. Rescigno:
On the Communication Complexity of Polling. 317-323 - A. P. Ustimenko:
Algebra of Two-Level Cause-Effect Structures. 325-330 - Shin-ichi Tokunaga:
Intersection Number of Two Connected Geometric Graphs. 331-333 - Avraham A. Melkman, Solomon Eyal Shimony:
Algorithms for Parsimonious Complete Sets in Directed Graphs. 335-339
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-11-09 23:10 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:
