


default search action
BIT, Volume 33, 1993
Volume 33, Number 1, 1993
- M. D. Atkinson, Murali Thiyagarajah:

The Permutational Power of a Priority Queue. 1-6 - Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang:

Selection on Rectangular Meshes with Multiple Broadcasting. 7-14 - Francesca Cesarini, Giovanni Soda:

Single Access Hashing with Overflow Separators for Dynamic Files. 15-28 - Giorgio Gambosi, Marco Protasi, Maurizio Talamo

:
An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets. 29-45 - Horng-Twu Liaw, Chin-Laung Lei:

An Optimal Algorithm to Assign Cryptographic Keys in a Tree Structure for Access Control. 46-56 - Iain A. Stewart

:
An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets. 57-62
Volume 33, Number 2, 1993
- Celina Imielinska, Bahman Kalantari:

A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. 177-189 - Lars Lundberg:

Performance Bounds on Multiprocessor Scheduling Strategies for Statically Allocated Programs. 190-213 - Roland Olsson:

Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search. 214-231 - Ondrej Sýkora, Imrich Vrto:

On Crossing Numbers of Hypercubes and Cube Connected Cycles. 232-237 - Cao An Wang:

Efficiently Updating Constrained Delaunay Triangulations. 238-252
Volume 33, Number 3, 1993
- Hong Chich Chou, Chung-Ping Chung:

Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic Scheduling Algorithm. 354-371 - Ronald D. Dutton:

Weak-Heap Sort. 372-381 - Jinn-Ke Jan, Chin-Chen Chang:

A Key-Lock-Pair Oriented Access Control Scheme for the Growth of Users and Files. 382-389 - Chiou-Kuo Liang:

An O(n2) Algorithm for Finding the Compact Sets of a Graph. 390-395 - Stephan Olariu, James L. Schwing, Jingyuan Zhang:

Optimal Convex Hull Algorithms on Enhanced Meshes. 396-410 - Patricio V. Poblete:

A Note on the Height of The kthe Element in a Heap. 411-412 - Chang-Wu Yu

, Gen-Huey Chen:
Parallel Algorithms for Permutation Graphs. 413-419 - Ming-Shing Yu, Cheng-Hsing Yang:

A Linear Time Algorithm for the Maximum Matching Problem on Cographs. 420-432
Volume 33, Number 4, 1993
- Chin-Chen Chang, Huey-Cheue Kowng, Tzong-Chen Wu:

A Refinement of a Compression-Oriented Addressing Scheme. 529-535 - Jong-Jeng Chen, Chiau-Shin Wang, Ching-Roung Chou:

A General Performance Analysis Method for Uniform Memory Architectures. 536-560 - Evan P. Harris, Kotagiri Ramamohanarao:

Optimal Dynamic Multi-Attribute Hashing for Range Queries. 561-579 - Klaus Jansen, Gerhard J. Woeginger:

The Complexity of Detecting Crossingfree Configurations in the Plane. 580-595 - Olav Lysne:

The Equational Part of Proofs by Structural Induction. 596-618

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














