| Max-min d-cluster formation in wireless ad hoc networks AD Amis, R Prakash, THP Vuong, DT Huynh Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000 | 1512 | 2000 |
| Finite-automaton aperiodicity is PSPACE-complete S Cho, DT Huynh Theoretical Computer Science 88 (1), 99-116, 1991 | 111 | 1991 |
| On some equivalence relations for probabilistic processes DT Huynh, L Tian Fundamenta Informaticae 17 (3), 211-234, 1992 | 82 | 1992 |
| Commutative grammars: The complexity of uniform word problems DT Huynh Information and Control 57 (1), 21-39, 1983 | 78 | 1983 |
| A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems DT Huynh Information and Control 68 (1-3), 196-206, 1986 | 76 | 1986 |
| Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states RR Howell, LE Rosier, DT Huynh, HC Yen Theoretical Computer Science 46, 107-140, 1986 | 52 | 1986 |
| Extending order preserving encryption for multi-user systems L Xiao, IL Yen, DT Huynh Cryptology ePrint Archive, 2012 | 50 | 2012 |
| The parallel complexity of finite-state automata problems S Cho, DT Huynh Information and Computation 97 (1), 1-22, 1992 | 47 | 1992 |
| Software architecture analysis: a dynamic slicing approach. T Kim, YT Song, L Chung, DT Huynh ACIS Int. J. Comput. Inf. Sci. 1 (2), 91-103, 2000 | 44 | 2000 |
| Connected d-hop dominating sets in mobile ad hoc networks TN Nguyen, DT Huynh 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad …, 2006 | 43 | 2006 |
| A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes JG Geske, DT Huynh, JI Seiferas Information and Computation 92 (1), 97-104, 1991 | 43 | 1991 |
| Deciding bisimilarity of normed context-free processes is in Σp2 DT Huynh, L Tian Theoretical Computer Science 123 (2), 183-197, 1994 | 42 | 1994 |
| Minimum latency data aggregation in the physical interference model NX Lam, MK An, DT Huynh, TN Nguyen Proceedings of the 14th ACM international conference on Modeling, analysis …, 2011 | 40 | 2011 |
| On deciding readiness and failure equivalences for processes DT Huynh, L Tian Information and Computation 117 (2), 193-205, 1995 | 40 | 1995 |
| The complexity of equivalence problems for commutative grammars DT Huynh Information and Control 66 (1-2), 103-121, 1985 | 37 | 1985 |
| Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is Σp2-complete DT Huynh Theoretical Computer Science 33 (2-3), 305-326, 1984 | 35 | 1984 |
| Resource-bounded Kolmogorov complexity of hard languages DT Huynh Structure in Complexity Theory: Proceedings of the Conference held at the …, 2005 | 33 | 2005 |
| Forward dynamic object-oriented program slicing YT Song, DT Huynh Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software …, 1999 | 32 | 1999 |
| The complexity of ranking simple languages DT Huynh Mathematical Systems Theory 23 (1), 1-19, 1990 | 31 | 1990 |
| The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems DT Huynh Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985 | 31 | 1985 |
