- Patricio V. Poblete. A Note on the Height of The ::::k::::the Element in a Heap. BIT, 33(3):411-412, 1993.
- Francesca Cesarini, Giovanni Soda. Single Access Hashing with Overflow Separators for Dynamic Files. BIT, 33(1):15-28, 1993.
- Hong Chich Chou, Chung-Ping Chung. Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic Scheduling Algorithm. BIT, 33(3):354-371, 1993.
- Roland Olsson. Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search. BIT, 33(2):214-231, 1993.
- Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang. Selection on Rectangular Meshes with Multiple Broadcasting. BIT, 33(1):7-14, 1993.
- Ondrej Sýkora, Imrich Vrto. On Crossing Numbers of Hypercubes and Cube Connected Cycles. BIT, 33(2):232-237, 1993.
- Klaus Jansen, Gerhard J. Woeginger. The Complexity of Detecting Crossingfree Configurations in the Plane. BIT, 33(4):580-595, 1993.
- Celina Imielinska, Bahman Kalantari. A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. BIT, 33(2):178-189, 1993.
- Giorgio Gambosi, Marco Protasi, Maurizio Talamo. An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets. BIT, 33(1):29-45, 1993.
- Chiou-Kuo Liang. An ::::O(n:::::::2:::) Algorithm for Finding the Compact Sets of a Graph. BIT, 33(3):390-395, 1993.