Travelled to:1 × Israel
3 × USA
Collaborated with:A.L.Rosenberg H.T.Kung ∅ K.Mehlhorn S.N.Bhatt F.R.K.Chung F.T.Leighton
Talks about:complex (2) graph (2) determinist (1) butterfli (1) tradeoff (1) problem (1) network (1) binari (1) applic (1) almost (1)
Person: Jia-Wei Hong
DBLP: Hong:Jia=Wei
Contributed to:
1988
198119811980Wrote 5 papers:
- STOC-1988-BhattCHLR #network #simulation
- Optimal Simulations by Butterfly Networks (SNB, FRKC, JWH, FTL, ALR), pp. 192–204.
- ICALP-1981-HongMR #graph #trade-off
- Cost Tradeoffs in Graph Embeddings, with Applications (JWH, KM, ALR), pp. 41–55.
- STOC-1981-HongK #complexity #game studies
- I/O Complexity: The Red-Blue Pebble Game (JWH, HTK), pp. 326–333.
- STOC-1981-HongR #graph
- Graphs that Are Almost Binary Trees (JWH, ALR), pp. 334–341.
- STOC-1980-Hong #complexity #on the #problem
- On Some Deterministic Space Complexity Problems (JWH), pp. 310–317.