Jia-Wei Hong

According to our database, Jia-Wei Hong authored at least 14 papers between 1980 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Examining the Feasibility of AI-Generated Questions in Educational Settings.

Omar Zeghouani, Zawar Ali, William Simson van Dijkhuizen, Jia-Wei Hong, Jérémie Clos

Proceedings of the Second International Symposium on Trustworthy Autonomous Systems, 2024

2016

Vision-Based Fall Detection through Shape Features.

Chih-Yang Lin, Shang-Ming Wang, Jia-Wei Hong, Li-Wei Kang, Chung-Lin Huang

Proceedings of the IEEE Second International Conference on Multimedia Big Data, 2016

1996

Optimal Emulations by Butterfly-Like Networks.

Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe

J. ACM, 1996

1988

Optimal Simulations by Butterfly Networks (Preliminary Version)

Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1986

Computation - computability, similarity and duality.

Jia-Wei Hong

Research notes in theoretical computer science, Pitman, ISBN: 978-0-273-08720-5, 1986

1984

A Tradeoff Theorem for Space and Reversal.

Jia-Wei Hong

Theor. Comput. Sci., 1984

On Similarity and Duality of Computation (I)

Jia-Wei Hong

Inf. Control., 1984

1983

Cost Trade-offs in Graph Embeddings, with Applications

Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg

J. ACM, October, 1983

1982

Graphs that are Almost Binary Trees.

Jia-Wei Hong, Arnold L. Rosenberg

SIAM J. Comput., 1982

On Some Deterministic Space Complexity Problems.

Jia-Wei Hong

SIAM J. Comput., 1982

1981

Graphs that Are Almost Binary Trees (Preliminary Version)

Jia-Wei Hong, Arnold L. Rosenberg

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

I/O Complexity: The Red-Blue Pebble Game

Jia-Wei Hong, H. T. Kung

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).

Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg

Proceedings of the Automata, 1981

1980

On Similarity and Duality of Computation (Extended Abstract)

Jia-Wei Hong

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980