Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 11
Volume 11, Number 1, 29 August 1980
- Edsger W. Dijkstra, Carel S. Scholten:
Termination Detection for Diffusing Computations. 1-4 - Wlodzimierz Dobosiewicz:
An Efficient Variation of Bubble Sort. 5-6 - Donald C. S. Allison, M. T. Noga:
Selection by Distributive Partitioning. 7-8 - Tomasz Krawczyk:
Error Correction by Mutational Grammars. 9-15 - Kabekode V. S. Bhat:
On the Complexity of Testing a Graph for N-Cube. 16-19 - Jan Grabowski:
The Decidability of Persistence for Vector Addition Systems. 20-23 - Michael C. Loui:
A Note on the Pebble Game. 24-26 - J. D. Day:
On the Internal S-Stability of Rosenbrock Methods. 27-30 - J. D. Day:
Comments on: T. D. Bui "On an L-Stable Method for Stiff Differential Equations". 31-32 - George Loizou:
On a Cycle Finding Algorithm. 33-36 - Donna J. Brown:
An Improved BL Lower Bound. 37-39 - James L. Peterson:
A Note on Colored Petri Nets. 40-43 - Leslie G. Valiant:
Computing Multivariate Polynomials in Parallel. 44-45 - Richard P. Brent, H. T. Kung:
On the Area of Binary Tree Layouts. 46-48 - Charles R. Dyer:
A Fast Parallel Algorithm for the Closest Pair Problem. 49-52 - Luc Devroye:
A Note on Finding Convex Hulls Via Maximal Vectors. 53-56
Volume 11, Number 2, 20 October 1980
- Lech Banachowski
:
A Complement to Tarjan's Result about the Lower Bound on the Complexity of the Set Union Problem. 59-65 - Friedrich J. Urbanek:
An O(log n) Algorithm for Computing the nth Element of the Solution of a Difference Equation. 66-67 - David Gries, Gary Levin:
Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time. 68-69 - Jürgen Ebert:
A Note on Odd and Even Factors of Undirected Graphs. 70-72 - Lishing Liu, Alan J. Demers:
An Algorithm for Testing Lossless Join Property in Relational Databases. 73-76 - Franco P. Preparata, Jean Vuillemin:
Area-Time Optimal VLSI Networks for Multiplying Matrices. 77-80 - Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
Minimum Number of Steps for Permutation in a Bubble Memory. 81-83 - Andrew Chi-Chih Yao:
A Note on the Analysis of Extendible Hashing. 84-86 - Manfred Broy:
Transformational Semantics for Concurrent Programs. 87-91 - Robert B. Johnson Jr.:
The Complexity of a VLSI Adder. 92-93 - Jacques Calmet, Rüdiger Loos:
An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p). 94-95 - Charles J. Colbourn, Brendan D. McKay:
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. 96-97 - Paris C. Kanellakis:
On the Computational Complexity of Cardinality Constraints in Relational Databases. 98-101 - Emilio Luque, Ana Ripoll:
Tuning Architecture via Microprogramming. 102-109 - Ernst L. Leiss:
A Note on a Signature System Based on Probabilistic Logic. 110-113
Volume 11, Number 3, 18 November 1980
- Joseph Y.-T. Leung, M. L. Merrill:
A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. 115-118 - J. M. Robson:
Storage Allocation is NP-Hard. 119-125 - David Avis:
Comments on a Lower Bound for Convex Hull Determination. 126 - Arnaldo Moura:
A Note on Grammatical Covers. 127-129 - Thomas A. Bailey, R. Geoff Dromey:
Fast String Searching by Finding Subkeys in Subtext. 130-133 - Francesco Romani:
Shortest-Path Problem is not Harder Than Matrix Multiplication. 134-136 - Hannu Erkiö:
Internal Merge Sorting with Delayed Selection. 137-140 - Nachum Dershowitz:
The Schorr-Waite Marking Algorithm Revisited. 141-143 - Efim B. Kinber:
On Inclusion Problem for Deterministic Multitape Automata. 144-146
Volume 11, Number 4/5, 12 December 1980
- Alfred Laut:
Safe Procedural Implementations of Algebraic Types. 147-151 - Jan Paredaens, F. Ponsaert:
Grant Levels in an Authorization Mechanism. 152-155 - Greg N. Frederickson:
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. 156-161 - Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. 162 - David R. Hanson:
Code Improvement Via Lazy Evaluation. 163-167 - J. H. ter Bekke:
Convertibility in Databases. 168-171 - Alberto Pettorossi:
Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication Method. 172-179 - M. Howard Williams:
Cubic Map Configurations. 180-185 - M. Howard Williams:
Batch Sizes for the Batching Method of Colouring Planar Maps. 186-189 - Mila E. Majster-Cederbaum:
A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs. 190-192 - Rossella Petreschi, Bruno Simeone:
A Switching Algorithm for the Solution of Quadratic Boolean Equations. 193-198 - R. K. Arora, S. P. Rana:
Heuristic Algorithms for Process Assignment in Distributed Computing Systems. 199-203 - Hiroya Kawai:
A Formal System for Parallel Programs in Discrete Time and Space. 204-210 - J. ten Hoopen:
Consecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and Their Storage Space Requirements. 211-217 - Peter Kandzia, Margret Mangelmann:
On Covering Boyce-Codd Normal Forms. 218-223 - Seppo Pajunen:
On Two Theorems of Lenstra. 224-228 - Alfons J. Jammel, Helmut G. Stiegler:
On Expected Costs of Deadlock Detection. 229-231
a service of 
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-04-25 04:40 CEST 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:
