Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarInformation Processing Letters, Volume 54
Volume 54, Number 1, 14 April 1995
- Hamed Nassar:
A Markov Model for Multibus Multiprocessor Systems Under Asynchronous Operation. 11-16 - Paul E. Dunne, Chris J. Gittings, Paul H. Leng:
Multiprocessor Simulation Strategies with Optimal Speed-up. 23-33 - David Maxwell Chickering, Dan Geiger, David Heckerman:
On Finding a Cycle Basis with a Shortest Maximal Cycle. 55-58 - Ming-Yang Kao:
Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs. 59-63
Volume 54, Number 2, 28 April 1995
- Giorgio Ausiello, Marco Protasi:
Local Search, Reducibility and Approximability of NP-Optimization Problems. 73-79 - Horst Bunke, János Csirik:
An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. 93-96 - Dennis W. G. Moore, William F. Smyth:
A Correction to "An Optimal Algorithm to Compute all the Covers of a String". 101-103 - Israel Cidon, Yuval Shavitt:
Message Terminating Algorithms for Anonymous Rings of Unknown Size. 111-119 - George Varghese, Roger D. Chamberlain, William E. Weihl:
Deriving Global Virtual Time Algorithms from Conservative Simulation Protocols. 121-126
Volume 54, Number 3, 12 May 1995
- Teofilo F. Gonzalez:
A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. 129-131 - John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan:
On Finding Solutions for Extended Horn Formulas. 133-137 - Guillermo A. Alvarez, Marcelo O. Fernández:
Efficient Management of Multiple Outstanding Timeouts. 139-145 - Robert Snelick, Joseph JáJá, Raghu Kacker, Gordon Lyon:
Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs. 147-153 - Ravi Jain, John Werth:
Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs. 163-168
Volume 54, Number 4, 26 May 1995
- Massimiliano Goldwurm:
Random Generation of Words in an Algebraic Language in Linear Binary Space. 229-233 - Ashok Subramanian:
Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph. 247
Volume 54, Number 5, 9 June 1995
- Derek G. Corneil, Stephan Olariu, Lorna Stewart:
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. 253-257 - Eddy Fromentin, Claude Jard, Guy-Vincent Jourdan, Michel Raynal:
On-The-Fly Analysis of Distributed Computations. 267-274 - Kokichi Sugihara, Hiroshi Inagaki:
Why is the 3D Delaunay Triangulation Difficult to Construct. 275-280 - Akihiro Fujiwara, Toshimitsu Masuzawa, Hideo Fujiwara:
An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images. 295-300 - G. Sajith, Sanjeev Saxena:
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. 305
Volume 54, Number 6, 23 June 1995
- Vassilis Zissimopoulos:
On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems. 317-322 - James P. Schmeiser, David T. Barnard:
Producing a Top-Down Parse Order with Bottom-up Parsing. 323-326 - Jörg Desel, Ekkart Kindler, Tobias Vesper, Rolf Walter:
A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards. 327-328 - Premkumar Vadapalli, Pradip K. Srimani:
Trivalent Cayley Graphs for Interconnection Networks. 329-335 - Noga Alon, Yishay Mansour:
epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. 337-342 - Yen-Jen Oyang:
A Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy. 355-358 - Ralph P. Boland, Jorge Urrutia:
Corrigendum: Separating Collections of Points in Euclidean Spaces. 359
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-20 19:18 CEST by the dblp team