1994 |
14 | | Howard P. Katseff,
Bethany S. Robinson:
Predictive Prefetch in the Nemesis Multimedia Information Service.
ACM Multimedia 1994: 201-209 |
1993 |
13 | | Howard P. Katseff,
T. B. London:
The Ferret Document Browser.
USENIX Summer 1993: 101-110 |
1990 |
12 | | Howard P. Katseff,
Robert D. Gaglianello,
Bethany S. Robinson:
The Evolution of HPC/VORX.
PPOPP 1990: 60-69 |
1988 |
11 | | Howard P. Katseff:
Using Data Partitioning to Implement a Parallel Assembler.
PPOPP/PPEALS 1988: 66-76 |
10 | | Howard P. Katseff:
Incomplete Hypercubes.
IEEE Trans. Computers 37(5): 604-608 (1988) |
1986 |
9 | | Robert D. Gaglianello,
Howard P. Katseff:
The Meglos User Interface.
FJCC 1986: 169-177 |
8 | | Robert D. Gaglianello,
Howard P. Katseff:
Communications in Meglos.
Softw., Pract. Exper. 16(10): 945-963 (1986) |
1985 |
7 | | Robert D. Gaglianello,
Howard P. Katseff:
Meglos: An Operating System for a Multiprocessor Environment.
ICDCS 1985: 35-42 |
1982 |
6 | | Donna J. Brown,
Brenda S. Baker,
Howard P. Katseff:
Lower Bounds for On-Line Two-Dimensional Packing Algorithms.
Acta Inf. 18: 207-225 (1982) |
1981 |
5 | | Brenda S. Baker,
Donna J. Brown,
Howard P. Katseff:
A 5/4 Algorithm for Two-Dimensional Packing.
J. Algorithms 2(4): 348-368 (1981) |
4 | | Howard P. Katseff,
Michael Sipser:
Several Results in Program Size Complexity.
Theor. Comput. Sci. 15: 291-309 (1981) |
1978 |
3 | | Howard P. Katseff:
A New Solution to the Critical Section Problem
STOC 1978: 86-88 |
2 | | Howard P. Katseff:
Complexity Dips in Random Infinite Binary Sequences
Information and Control 38(3): 258-263 (1978) |
1977 |
1 | | Howard P. Katseff,
Michael Sipser:
Several Results in Program Size Complexity
FOCS 1977: 82-89 |