 | 1996 |
|---|
| 13 |       | Sandeep N. Bhatt,
Fan R. K. Chung,
Jia-Wei Hong,
Frank Thomson Leighton,
Bojana Obrenic,
Arnold L. Rosenberg,
Eric J. Schwabe:
Optimal Emulations by Butterfly-Like Networks.
J. ACM 43(2): 293-330 (1996) |
| 1988 |
|---|
| 12 | | Sandeep N. Bhatt,
Fan R. K. Chung,
Jia-Wei Hong,
Frank Thomson Leighton,
Arnold L. Rosenberg:
Optimal Simulations by Butterfly Networks (Preliminary Version)
STOC 1988: 192-204 |
| 1986 |
|---|
| 11 |  | Jia-Wei Hong:
Computation - computability, similarity and duality.
Pitman 1986: 1-236 |
| 1984 |
|---|
| 10 | | Jia-Wei Hong:
On Similarity and Duality of Computation (I)
Information and Control 62(2/3): 109-128 (1984) |
| 9 | | Jia-Wei Hong:
A Tradeoff Theorem for Space and Reversal.
Theor. Comput. Sci. 32: 221-224 (1984) |
| 1983 |
|---|
| 8 | | Jia-Wei Hong,
Kurt Mehlhorn,
Arnold L. Rosenberg:
Cost Trade-offs in Graph Embeddings, with Applications
J. ACM 30(4): 709-728 (1983) |
| 1982 |
|---|
| 7 | | Jia-Wei Hong,
Arnold L. Rosenberg:
Graphs that are Almost Binary Trees.
SIAM J. Comput. 11(2): 227-242 (1982) |
| 6 | | Jia-Wei Hong:
On Some Deterministic Space Complexity Problems.
SIAM J. Comput. 11(3): 591-601 (1982) |
| 1981 |
|---|
| 5 | | Jia-Wei Hong,
Kurt Mehlhorn,
Arnold L. Rosenberg:
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).
ICALP 1981: 41-55 |
| 4 | | Jia-Wei Hong,
H. T. Kung:
I/O Complexity: The Red-Blue Pebble Game
STOC 1981: 326-333 |
| 3 | | Jia-Wei Hong,
Arnold L. Rosenberg:
Graphs that Are Almost Binary Trees (Preliminary Version)
STOC 1981: 334-341 |
| 1980 |
|---|
| 2 | | Jia-Wei Hong:
On Similarity and Duality of Computation (Extended Abstract)
FOCS 1980: 348-359 |
| 1 | | Jia-Wei Hong:
On Some Deterministic Space Complexity Problems
STOC 1980: 310-317 |
Data released under the ODC-BY 1.0 license — See also our legal information page