default search action
Information Processing Letters, Volume 36
Volume 36, Number 1, 1 October 1990
- Zhen Liu:
A Note on Graham's Bound. 1-5 - Wen-Huei Chen, Ching-Sung Lu, Elben R. Brozovsky, Jin-Tuu Wang:
An Optimization Technique for Protocol Conformance Testing Using Multiple Uio Sequences. 7-11 - Joanna Jedrzejowicz
:
Infinite Hierarchy of Shuffle Expressions Over a Finite Alphabet. 13-17 - Haklin Kim:
Finding a Maximum Independent Set in a Permutation Graph. 19-23 - Frank Dederichs, Rainer Weber:
Safety and Liveness From a Methodological Point of View. 25-30 - Biing-Feng Wang, Gen-Huey Chen:
Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. 31-36 - Stanley Burris, John Lawrence:
Unification in Commutative Rings is Not Finitary. 37-38 - Malcolm C. Fields, Greg N. Frederickson:
A Faster Algorithm for the Maximum Weighted Tardiness Problem. 39-44 - Oded Goldreich
The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. 45-49 - Ke Qiu, Henk Meijer:
A Note on Diameter of Acyclic Directed Hypercubes. 51-52 - Hans L. Bodlaender
Bit-Optimal Election in Synchronous Rings. 53-56
Volume 36, Number 2, 15 October 1990
- Torben Hagerup, Hong Shen:
Improved Nonconservative Sequential and Parallel Integer Sorting. 57-63 - Miklós Biró
Object-Oriented Interaction in Resource Constrained Scheduling. 65-67 - Anna Slobodová:
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages. 69-72 - Stephen A. Vavasis:
Quadratic Programming is in NP. 73-77 - Jin-yi Cai:
Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits. 79-83 - Jae Moon Lee, Jong Soo Park, Myunghwan Kim:
An Upper Bound on Buffer Size for Join Operation Using Nonclusterd Indexes. 85-90 - Richard J. Lipton, Arvin Park:
The Processor Identity Problem. 91-94 - Chandan Haldar, Lalit M. Patnaik:
Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams. 95-102 - Graham M. Megson, F. M. F. Gaston:
Improved Matrix Triangularisation Using a Double Pipeline Systolic Array. 103-109
Volume 36, Number 3, 1 November 1990
- De-Lei Lee:
Efficient Address Generation in a Parallel Processor. 111-116 - Jingde Cheng:
An Algebraic Semantics of Notional Entailment Logic Cn. 117-121 - Aphrodite Tsalgatidou:
Modelling and Animating Information Systems Dynamics. 123-127 - Shuo-Yen Robert Li:
On Full Utilization of Multi-Channel Capacity with Priority Protocol. 129-133 - Laura A. Sanchis:
On the Complexity of Test Case Generation for NP-Hard Problems. 135-140 - John G. Kollias, Yannis Manolopoulos, Christos H. Papadimitriou:
The Optimum Execution Order of Queries in Linear Storage. 141-145 - Lawrence L. Larmore:
An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. 147-151 - Rong Lin, Stephan Olariu:
A Fast Parallel, Algorithm to Recognize, Partitionable Graphs. 153-157 - A. Paulik:
Worst-Case Analysis of a Generalized Heapsort Algorithm. 159-165 - Kim-Heng Teo, Tai-Ching Tuan:
Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing. 167-170
Volume 36, Number 4, 15 November 1990
- Valmir Carneiro Barbosa
Blocking Versus Nonblocking Interprocess Communication: A Note on the Effect on Concurrency. 171-175 - Hans Kleine Büning:
Existence of Simple Propositional Formulas. 177-182 - Xiaolei Qian:
An Axiom System for Database Transactions. 183-189 - Gerhard J. Woeginger:
A Simple Solution to the Two Paths Problem in Planar Graphs. 191-192 - Edsger W. Dijkstra:
Making a Fair Roulette From a Possibly Biased Coin. 193 - S. Ramesh:
On the Completeness of Modular Proof Systems. 195-201 - Erkki Mäkinen
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars. 203-206 - Bernd-Jürgen Falkowski:
Perceptrons Revisited. 207-213 - Miroslaw Kutylowski:
Remarks on Sorting and One-Way Multihead Finite Automata. 215-218 - Jozef Vyskoc:
Making Bubblesort Recursive. 219-220
Volume 36, Number 5, 1 December 1990
- Hyoung Joong Kim, Jang Gyu Lee:
Partial Sum Problem Mapping Into a Hypercube. 221-224 - Jin Ho Hur, Kilnam Chon:
Self and Selftype. 225-230 - Peter Damaschke, Haiko Müller
Domination in Convex and Chordal Bipartite Graphs. 231-236 - Ursula Martin
A Note on Division Orderings on Strings. 237-240 - Jang-Ping Sheu, Zen-Fu Chiang:
Efficient Allocation of Chain-Like Task on Chain-Like Network Computers. 241-245 - Carsten Damm
Problems Complete for \oplus L. 247-250 - Siu-Wing Cheng
Efficient Dynamic Algorithms for Some Geometric Intersection Problems. 251-258 - Marc Gyssens
On a Hierarchy of Classes for Nested Databases. 259-266 - O. M. Makarov:
On the Synthesis of Fast Algorithms for Signal Processing. 267-272 - Pratul Dublish:
Some Comments on the Subtree Isomorphism Problem for Ordered Trees. 273-275
Volume 36, Number 6, 15 December 1990
- Subir Kumar Ghosh, Anil Maheshwari:
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. 277-280 - Ferenc Kocsis, Johann F. Böhme:
Rotation-Based Computations for Ray-Tracing Second-Order Surfaces and Curves. 281-283 - Antonio Brogi
Hypothetical Reasoning in Logic Programming: A Semantic Approach. 285-291 - Zoltán Fülöp, Sándor Vágvölgyi:
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. 293-296 - Rob R. Hoogerwoord:
A Calculational Derivation of the Casop Algorithm. 297-299 - Gabriel Matsliach:
Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves. 301-310 - Kai Salomaa, Sheng Yu:
The Immortality Problem for LAG Systems. 311-315 - Giuseppe Di Battista
Bipartite Graphs, Upward Drawings, and Planarity. 317-322 - Sung Kwon Kim:
Parallel Algorithms for the Segment Dragging Problem. 323-327
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-12-22 19:01 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: