 | 2003 |
|---|
| 11 |       | Gur Mosheiov,
Jeffrey B. Sidney:
Scheduling with general job-dependent learning curves.
European Journal of Operational Research 147(3): 665-670 (2003) |
| 2000 |
|---|
| 10 | | Jeffrey B. Sidney,
Chris N. Potts,
Chelliah Sriskandarajah:
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups.
Oper. Res. Lett. 26(4): 165-173 (2000) |
| 1998 |
|---|
| 9 | | Nicholas G. Hall,
Wei-Ping Liu,
Jeffrey B. Sidney:
Scheduling in broadcast networks.
Networks 32(4): 233-253 (1998) |
| 1992 |
|---|
| 8 |  | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney:
A Distributed Selection Algorithm and its Expected Communication Complexity.
Theor. Comput. Sci. 100(1): 185-204 (1992) |
| 1989 |
|---|
| 7 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Partial Orders.
SIAM J. Discrete Math. 2(2): 245-254 (1989) |
| 1988 |
|---|
| 6 | | Nicola Santoro,
Michael Scheutzow,
Jeffrey B. Sidney:
On the Expected Complexity of Distributed Selection.
J. Parallel Distrib. Comput. 5(2): 194-203 (1988) |
| 1987 |
|---|
| 5 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney:
On the Expected Complexity of Distributed Selection.
STACS 1987: 456-467 |
| 4 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Vector Dominance.
Theor. Comput. Sci. 53: 345-352 (1987) |
| 1985 |
|---|
| 3 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance.
STACS 1985: 322-327 |
| 2 | | Doron Rotem,
Nicola Santoro,
Jeffrey B. Sidney:
Distributed Sorting.
IEEE Trans. Computers 34(4): 372-376 (1985) |
| 1 | | Nicola Santoro,
Jeffrey B. Sidney:
Interpolation-Binary Search.
Inf. Process. Lett. 20(4): 179-181 (1985) |
