The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hing Leung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tsong Yueh Chen, Hing Leung, Yuen-Tak Yu
    On the Analysis of Subdomain Testing Strategies. [Citation Graph (0, 0)][DBLP]
    APSEC, 1995, pp:218-224 [Conf]
  2. Tsong Yueh Chen, Hing Leung, I. K. Mak
    Adaptive Random Testing. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2004, pp:320-329 [Conf]
  3. Hing Leung, Tsong Yueh Chen
    A Revisit of the Proportional Sampling Strategy. [Citation Graph (0, 0)][DBLP]
    Australian Software Engineering Conference, 2000, pp:247-254 [Conf]
  4. Hing Leung
    Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:221-229 [Conf]
  5. Hing Leung
    On Finite Automata with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:355-363 [Conf]
  6. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    Measuring Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:295-306 [Conf]
  7. Hing Leung
    Structurally Unambiguous Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:198-207 [Conf]
  8. Hing Leung
    On Finite Automata with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:7, pp:595-624 [Journal]
  9. Hing Leung, Tsong Yueh Chen
    A New Perspective of the Proportional Sampling Strategy. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:8, pp:693-698 [Journal]
  10. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    On the Relation between Ambiguity and Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:100, n:2, pp:261-270 [Journal]
  11. Hing Leung
    Descriptional complexity of nfa of different ambiguity. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:975-984 [Journal]
  12. Hing Leung
    A Note on Finitely Ambiguous Distance Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:6, pp:329-331 [Journal]
  13. Hing Leung, Desh Ranjan, Héctor J. Hernández, D. T. Tang, Agustin González
    A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:5, pp:279-282 [Journal]
  14. Hing Leung, T. H. Tse, F. T. Chan, Tsong Yueh Chen
    Test case selection with and without replacement. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2000, v:129, n:1-4, pp:81-103 [Journal]
  15. Hing Leung
    On a Family of Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:3, pp:235-244 [Journal]
  16. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    Measuring nondeterminism in pushdown automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:440-466 [Journal]
  17. Hing Leung
    Tight Lower Bounds on the Size of Sweeping Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:3, pp:384-393 [Journal]
  18. Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
    Descriptional Complexity of Machines with Limited Resources. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:193-234 [Journal]
  19. Hing Leung
    Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1073-1082 [Journal]
  20. Jérémie Chalopin, Hing Leung
    On factorization forests of finite height. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:489-499 [Journal]
  21. Hing Leung
    Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:1, pp:137-145 [Journal]
  22. Hing Leung, Viktor Podolskiy
    The limitedness problem on distance automata: Hashiguchi's method revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:147-158 [Journal]
  23. Hing Leung, Detlef Wotschke
    On the size of parsers and LR(k)-grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:59-69 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002