STACK SORTABLE PERMUTATIONSROTEM D.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 2; PP. 185-196; BIBL. 9 REF.Article

CIRCULAR PERMUTATION GRAPHSROTEM D; URRUTIA J.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 4; PP. 429-437; BIBL. 14 REF.Article

FINDING MAXIMUM CLIQUES IN CIRCLE GRAPHSROTEM D; URRUTIA J.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 3; PP. 269-278; BIBL. 10 REF.Article

SOME EXPERIENCES WITH THE JOHNSON-TROTTER PERMUTATION GENERATION ALGORITHMVAROL YL; ROTEM D.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 2; PP. 173-176; BIBL. 6 REF.Article

GENERATION OF BINARY TREES FROM BALLOT SEQUENCESROTEM D; VAROL YL.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 3; PP. 396-404; BIBL. 6 REF.Article

COMPARABILITY GRAPHS AND INTERACTION GRAPHSGOLUMBIC MC; ROTEM D; URRUTIA J et al.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 37-46; BIBL. 17 REF.Article

ORIENTATIONS OF CIRCLE GRAPHSREAD RC; ROTEM D; URRUTIA J et al.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 3; PP. 325-341; BIBL. 10 REF.Article

SELF-ORGANIZING DOUBLY LINKED LISTSMATTHEWS D; ROTEM D; BRETHOLZ E et al.1980; INTERNATION. J. COMPUTER MATH.; USA; DA. 1980; VOL. 8; NO 2; PP. 99-106; BIBL. 8 REF.Article

The two headed disk : Stochastic dominance of the greedy policySESHADRI, S; ROTEM, D.Information processing letters. 1996, Vol 57, Num 5, pp 273-277, issn 0020-0190Article

Data base design with the constrained multiple attribute treeBRETHOLZ, E; ROTEM, D.Information systems (Oxford). 1985, Vol 10, Num 1, pp 47-56, issn 0306-4379Article

Multiprocessor join schedulingMURPHY, M. C; ROTEM, D.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 2, pp 322-338, issn 1041-4347Article

Distributed algorithms for finding centers and medians in networksKORACH, E; ROTEM, D; SANTORO, N et al.ACM transactions on programming languages and systems. 1984, Vol 6, Num 3, pp 380-401, issn 0164-0925Article

Lower bounds for distributed maximum-finding algorithmsPACHL, J; KORACH, E; ROTEM, D et al.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 4, pp 905-918, issn 0004-5411Article

Data allocation for multidisk databasesROTEM, D; SCHLOSS, G. A; SEGEV, A et al.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 5, pp 882-887, issn 1041-4347Article

Distributed electron in a circle without a global sense of orientationKORACH, E; ROTEM, D; SANTORO, N et al.International journal of computer mathematics. 1984, Vol 16, Num 2, pp 115-124, issn 0020-7160Article

Distributed sortingROTEM, D; SANTORO, N; SIDNEY, J. B et al.IEEE transactions on computers. 1985, Vol 34, Num 4, pp 372-376, issn 0018-9340Article

Shout echo selection in distributed filesROTEM, D; SANTORO, N; SIDNEY, J. B et al.Networks (New York, NY). 1986, Vol 16, Num 1, pp 77-86, issn 0028-3045Article

On the costs of self-stabilizationCHANG, E. J. H; GONNET, G. H; ROTEM, D et al.Information processing letters. 1987, Vol 24, Num 5, pp 311-316, issn 0020-0190Article

Data management for multiuser access to digital video librariesZHAO, J. L; ROTEM, D; CHEN, S.-S et al.Journal of parallel and distributed computing (Print). 1999, Vol 56, Num 3, pp 208-234, issn 0743-7315Article

Efficient organization and access of multi-dimensional datasets on tertiary storage systemsCHEN, L. T; DRACH, R; KEATING, M et al.Information systems (Oxford). 1995, Vol 20, Num 2, pp 155-183, issn 0306-4379Article