The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hsu-Chun Yen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jin-Fu Chang, Shi-Chung Chang, Zsehong Tsai, Jung-Shyr Wu, Hsu-Chun Yen
    Design, implementation, and applications of a B-ISDN simulation testbed. [Citation Graph (0, 0)][DBLP]
    Annual Simulation Symposium, 1995, pp:212-219 [Conf]
  2. Hsu-Chun Yen, Bow-Yaw Wang, Ming-Sheng Yang
    A Unified Approach for Reasoning about Conflict-Free Petri Nets. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1993, pp:513-531 [Conf]
  3. Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
    On Sequential and 1-Deterministic P Systems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:905-914 [Conf]
  4. Hsu-Chun Yen, Lien-Po Yu
    Petri Nets with Simple Circuits. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:149-158 [Conf]
  5. Meng-Hang Ho, Hsu-Chun Yen
    A Dictionary-Based Compressed Pattern Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 2002, pp:873-878 [Conf]
  6. Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
    The Power of Maximal Parallelism in P Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:212-224 [Conf]
  7. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    Normal and Sinkless Petri Nets. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:234-243 [Conf]
  8. Louis E. Rosier, Hsu-Chun Yen
    A multiparameter analysis of the boundedness problem for vector addition systems. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:361-370 [Conf]
  9. Ethan Gannett, Suresh C. Kothari, Hsu-Chun Yen
    On Optimal Parallelization of Sorting Networks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:195-206 [Conf]
  10. Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Some Applications of Orderly Spanning Trees in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:332-343 [Conf]
  11. Ho-Lin Chen, Hsueh-I Lu, Hsu-Chun Yen
    On Maximum Symmetric Subgraphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:372-383 [Conf]
  12. Ho-Lin Chen, Hsu-Chun Yen
    Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:416-417 [Conf]
  13. Jen-Hui Chuang, Chun-Cheng Lin, Hsu-Chun Yen
    Drawing Graphs with Nonuniform Nodes Using Potential Fields. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:460-465 [Conf]
  14. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Floor-Planning via Orderly Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:367-377 [Conf]
  15. Chun-Cheng Lin, Hsu-Chun Yen
    On Balloon Drawings of Rooted Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:285-296 [Conf]
  16. Cheng Li, Zhe Dang, Oscar H. Ibarra, Hsu-Chun Yen
    Signaling P Systems and Verification Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1462-1473 [Conf]
  17. Louis E. Rosier, Hsu-Chun Yen
    On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:334-343 [Conf]
  18. Hsu-Chun Yen
    Analysis of Self-Stabilization for Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
    ICECCS, 2001, pp:240-248 [Conf]
  19. Jiunn Deng, Hsu-Chun Yen
    Design and Performance Evaluation of an Optimal Collision Avoidance Mechanism over Congested and Noisy Channels for IEEE 802.11 DCF Access Method. [Citation Graph (0, 0)][DBLP]
    ICOIN, 2005, pp:11-20 [Conf]
  20. Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Competitive Analysis of On-Line Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:356-365 [Conf]
  21. Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Competitive Source Routing on Tori and Meshes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:82-91 [Conf]
  22. Hsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao
    Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:301-310 [Conf]
  23. Ming-Che Chuang, Hsu-Chun Yen
    On Nearly Symmetric Drawings of Graphs. [Citation Graph (0, 0)][DBLP]
    IV, 2002, pp:489-0 [Conf]
  24. Chun-Cheng Lin, Hsu-Chun Yen
    A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion. [Citation Graph (0, 0)][DBLP]
    IV, 2005, pp:329-334 [Conf]
  25. Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
    On Symport/Antiport P Systems and Semilinear Sets. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2005, pp:253-271 [Conf]
  26. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:351-359 [Conf]
  27. Joseph Deng, Hsu-Chun Yen
    Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless lans. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2004, pp:165-170 [Conf]
  28. Hsu-Chun Yen, Lien-Po Yu
    Dependability Analysis of a Class of Probabilistic Petri Nets. [Citation Graph (0, 0)][DBLP]
    PRDC, 2004, pp:373-380 [Conf]
  29. Farn Wang, Hsu-Chun Yen
    Parametric Optimization of Open Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:299-318 [Conf]
  30. Louis E. Rosier, Hsu-Chun Yen
    Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:287-298 [Conf]
  31. Louis E. Rosier, Hsu-Chun Yen
    Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:306-320 [Conf]
  32. Oscar H. Ibarra, Hsu-Chun Yen
    On Deterministic Catalytic Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:163-175 [Conf]
  33. Farn Wang, Hsu-Chun Yen
    Timing Parameter Characterization of Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:23-34 [Conf]
  34. Hsu-Chun Yen
    Priority Conflict-Free Petri Nets. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:8, pp:673-688 [Journal]
  35. Hsu-Chun Yen
    Priority Systems with many Identical Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:7, pp:681-692 [Journal]
  36. Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Distributed and On-Line Routing on Tori. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:562-593 [Journal]
  37. Ming-Yang Chen, Hsueh-I Lu, Hsu-Chun Yen
    On the Ramsey Numbers for Bipartite Multigraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  38. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Compact Floor-Planning via Orderly Spanning Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  39. Hsu-Chun Yen, Lien-Po Yu
    Decidability Analysis of Self-Stabilization for Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:70, n:4, pp:387-402 [Journal]
  40. Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang
    On the Computational Power of 1-Deterministic and Sequential P Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:133-152 [Journal]
  41. Hsu-Chun Yen
    A Unified Approach for Deciding the Existence of Certain Petri Net Paths [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:1, pp:119-137 [Journal]
  42. Hsu-Chun Yen
    On the Regularity of Petri Net Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:124, n:2, pp:168-181 [Journal]
  43. Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
    On various notions of parallelism in P Systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:683-705 [Journal]
  44. Hsu-Chun Yen, Bow-Yaw Wang, Ming-Sheng Yang
    Some Complexity Results for Rings of Petri Nets. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1994, v:5, n:3/4, pp:282-292 [Journal]
  45. Seok-Hee Hong, Hsu-Chun Yen
    Preface. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1003-1004 [Journal]
  46. Kien-Weh Chin, Hsu-Chun Yen
    The symmetry number problem for trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:2, pp:73-79 [Journal]
  47. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:1, pp:27-33 [Journal]
  48. Hsu-Chun Yen
    A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:2, pp:71-76 [Journal]
  49. Hsu-Chun Yen
    A Note on Fine Covers and Iterable Factors of VAS Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:5, pp:237-243 [Journal]
  50. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
    Compact floor-planning via orderly spanning trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:441-451 [Journal]
  51. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    Normal and Sinkless Petri Nets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:1, pp:1-26 [Journal]
  52. Louis E. Rosier, Hsu-Chun Yen
    A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:1, pp:105-135 [Journal]
  53. Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Competitive Analysis of On-Line Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:491-506 [Journal]
  54. Hsu-Chun Yen
    Communicating Processes, Scheduling, and the Complexity of Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:1, pp:33-59 [Journal]
  55. Hsu-Chun Yen, Namhee Pak
    Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:4, pp:357-378 [Journal]
  56. Hsu-Chun Yen, Bow-Yaw Wang, Ming-Sheng Yang
    Deciding a Class of Path Formulas for Conflict-Free Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:5, pp:475-494 [Journal]
  57. Louis E. Rosier, Hsu-Chun Yen
    Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:779-807 [Journal]
  58. Hsu-Chun Yen
    On multiterminal single bend wirability. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1994, v:13, n:6, pp:822-826 [Journal]
  59. Ethan Gannett, Suresh C. Kothari, Hsu-Chun Yen
    On Optimal Parallelization of Sorting Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:76, n:2-3, pp:331-341 [Journal]
  60. Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen
    Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:46, n:3, pp:107-140 [Journal]
  61. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    Global and Local Views of State Fairness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:1, pp:77-104 [Journal]
  62. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:2, pp:341-372 [Journal]
  63. Oscar H. Ibarra, Hsu-Chun Yen
    Deterministic catalytic systems are not universal. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:149-161 [Journal]
  64. Yih-Kai Lin, Hsu-Chun Yen
    An omega-automata approach to the compression of bi-level images. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:31, n:, pp:- [Journal]
  65. Louis E. Rosier, Hsu-Chun Yen
    Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:69-105 [Journal]
  66. Louis E. Rosier, Hsu-Chun Yen
    On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:263-324 [Journal]
  67. Hsu-Chun Yen
    A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:98, n:2, pp:263-287 [Journal]
  68. Hsu-Chun Yen
    On Reachability Equivalence for BPP-Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:179, n:1-2, pp:301-317 [Journal]
  69. Hsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao
    Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:170, n:1-2, pp:445-464 [Journal]
  70. Yih-Kai Lin, Hsu-Chun Yen
    An /spl omega/-automata approach to the representation of bilevel images. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2003, v:33, n:3, pp:524-531 [Journal]
  71. Hsu-Chun Yen, Chien-Liang Chen
    Computing Minimal Elements of Upward-Closed Sets for Petri Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:465-483 [Conf]
  72. Chun-Cheng Lin, Hsu-Chun Yen
    Balloon Views of Source Code and Their Multiscalable Font Modes. [Citation Graph (0, 0)][DBLP]
    IV, 2007, pp:53-58 [Conf]

  73. Mental map preserving graph drawing using simulated annealing. [Citation Graph (, )][DBLP]


  74. Many-to-one boundary labeling. [Citation Graph (, )][DBLP]


  75. An alignment-based surface pattern for a question answering system. [Citation Graph (, )][DBLP]


  76. Width-Optimal Visibility Representations of Plane Graphs. [Citation Graph (, )][DBLP]


  77. Compute the Term Contributed Frequency. [Citation Graph (, )][DBLP]


  78. A template alignment algorithm for question classification. [Citation Graph (, )][DBLP]


  79. Boundary Labeling in Text Annotation. [Citation Graph (, )][DBLP]


  80. Concurrency, Synchronization, and Conflicts in Petri Nets. [Citation Graph (, )][DBLP]


  81. Complexity Analysis of Balloon Drawing for Rooted Trees [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
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