default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 56
Volume 56, Number 1, 13 October 1995
- Stephen Thomas:
Garbage Collection in shared-environment Closure Reducers: Space-Efficient Depth First Copying Using a Tailored Approach. 1-7 - Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu:
Illumination of Polygons with Vertex Lights. 9-13 - Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino:
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. 15-17 - Garrison W. Greenwood:
On the Equity of Mutual Exclusion Algorithms in Distributed Systems. 19-22 - Ian Parberry:
A Real-Time Algorithm for the (n²-1)-Puzzle. 23-28 - Qian-Ping Gu, Shietung Peng:
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. 29-35 - Sanjeev Saxena, N. Malahal Rao:
Parallel Algorithms for Connectivity Problems on Interval Graphs. 37-44 - Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram
, Gerhard J. Woeginger:
Counting Convex Polygons in Planar Point Sets. 45-49 - Joseph Y.-T. Leung, W.-D. Wei:
Tighter Bounds on a Heuristic for a Partition Problem. 51-57 - Torben Hagerup:
The Parallel Complexity of Integer Prefix Summation. 59-64 - Rossella Petreschi, Andrea Sterbini:
Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. 65
Volume 56, Number 2, 27 October 1995
- Sven Oliver Krumke:
On a Generalization of the p-Center Problem. 67-71 - Thomas W. Cusick:
Cryptanalysis of a Public Key System Based on Diophantine Equations. 73-75 - Uday Kumar Chakraborty:
A Simpler Derivation of Schema Hazard in Genetic Algorithms. 77-78 - Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal:
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. 79-81 - Yue-Li Wang, Hon-Chan Chen, Chen-Yu Lee:
An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs. 83-87 - Eugene L. Lawler, Sergei Sarkissian:
An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes. 89-93 - Luc Devroye, Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Trees. 95-99 - Y. Daniel Liang:
Steiner Set and Connected Domination in Trapezoid Graphs. 101-108 - Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Reductions to Sets that Avoid EXPSPACE. 109-114 - Bengt Aspvall:
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly. 115-120 - Ferruccio Barsi, Maria Cristina Pinotti:
Addendum to "A Fully Parallel Algorithm for Residue to Binary Conversion". 121
Volume 56, Number 3, 10 November 1995
- Helmut Prodinger:
Multiple Quickselect - Hoare's Find Algorithm for Several Elements. 123-129 - Gavin Lowe:
An Attack on the Needham-Schroeder Public-Key Authentication Protocol. 131-133 - Susanne Albers, Bernhard von Stengel, Ralph Werchner:
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. 135-139 - Dennis M. Volpano, Geoffrey Smith:
A Type Soundness Proof for Variables in LCF ML. 141-146 - Stasys Jukna:
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates. 147-150 - John A. Clark, Jeremy Jacob:
On the Security of Recent Protocols. 151-155 - Olivier Devillers, Mordecai J. Golin:
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. 157-164 - Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang:
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs. 165-171 - Andrew Tomkins:
Lower Bounds for Two Call Control Problems. 173-178 - Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
A Linear-Time Algorithm for Proper Interval Graph Recognition. 179-184
Volume 56, Number 4, 24 November 1995
- Roy S. Rubinstein, John N. Shutt:
Self-Modifying Finite Automata: An Introduction. 185-190 - Bruno Codenotti, Giovanni Manzini, Luciano Margara:
Algebraic Techniques in Communication Complexity. 191-195 - Jean-Eric Pin:
A Negative Answer to a Question of Wilke on Varieties of \omega-Languages. 197-200 - José M. Sempere, Damián López:
A McCulloch-Pitts Neural Net to Characterize Even Linear Languages. 201-208 - Leonid Libkin, Limsoon Wong:
On Representation and Querying Incomplete Information in Databases with Bags. 209-214 - Y. Daniel Liang, Norbert Blum:
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. 215-219 - Gil Utard, Gaétan Hains:
Deadlock-Free Absorption of Barrier Synchronisations. 221-227 - Carlo Mereghetti, Giovanni Pighizzini:
A Remark on Middle Space Bounded Alternating Turing Machines. 229-232 - Peter Damaschke:
A Parallel Algorithm for Nearly Optimal Edge Search. 233-236
Volume 56, Number 5, 5 December 1995
- Hsu-Chun Yen:
A Note on Fine Covers and Iterable Factors of VAS Languages. 237-243 - Ryuhei Uehara:
Efficient Simulations by a Biased Coin. 245-248 - Amr M. Youssef, Stafford E. Tavares:
Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis. 249-252 - Xin Yao:
A Note on Neural Sorting Networks with O(1) Time Complexity. 253-254 - Bo-Ting Yang:
A Better Subgraph of the Minimum Weight Triangulation. 255-258 - Wei-Kuo Chiang, Rong-Jaye Chen:
The (n, k)-Star Graph: A Generalized Star Graph. 259-264 - Juan Miguel Vilar:
Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm. 265-271 - Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting. 273-280 - Uday Kumar Chakraborty:
A Branching Process Model for Genetic Algorithms. 281-292
Volume 56, Number 6, 22 December 1995
- Werner Kuich:
Representations and Complete Semiring Morphisms. 293-298 - Arundhati Raychaudhuri:
The Total Interval Number of a Tree and the Hamiltonian Completion Number of its Line Graph. 299-306 - Sebastian Danicic, Mark Harman, Yoga Sivagurunathan:
A Parallel Algorithm for Static Program Slicing. 307-313 - Stefano Mazzanti:
Succinct Iterative Characterizations of Primitive Computable Unary Functions. 315-319 - Xiao Zhou, Nobuaki Nagai, Takao Nishizeki:
Generalized Vertex-Rankings of Trees. 321-328 - Nader H. Bshouty:
On the Additive Complexity of 2 x 2 Matrix Multiplication. 329-335 - Paul Pritchard:
A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order. 337-341 - Yijie Han:
An Improvement on Parallel Computation of a Maximal Matching. 343-348
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 2026-01-28 00:00 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:
