default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTo-Yat Cheung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j31]Li Jiao, Hejiao Huang, To-Yat Cheung:
Handling Resource Sharing Problem Using Property-Preserving Place Fusions of Petri Nets. J. Circuits Syst. Comput. 17(3): 365-387 (2008)- 2007
- [j30]Hejiao Huang, To-Yat Cheung, Xiaolong Wang:
Applications of Property-Preserving Algebras to Component-Based Manufacturing System Design. J. Inf. Sci. Eng. 23(1): 167-181 (2007) - 2006
- [j29]Li Jiao, To-Yat Cheung:
Compositional Verification for Workflow Nets. J. Circuits Syst. Comput. 15(4): 551-570 (2006) - 2005
- [j28]Li Jiao, To-Yat Cheung, Weiming Lu:
Handling Synchronization Problem in Petri Net-Based System Design by Property-Preserving Transition-Reduction. Comput. J. 48(6): 692-701 (2005) - [j27]Li Jiao, Hejiao Huang, To-Yat Cheung:
Property-preserving Composition by Place Merging. J. Circuits Syst. Comput. 14(4): 793-812 (2005) - [j26]H. J. Huang, Li Jiao, To-Yat Cheung:
Property-preserving subnet reductions for designing manufacturing systems with shared resources. Theor. Comput. Sci. 332(1-3): 461-485 (2005) - 2004
- [j25]Li Jiao, To-Yat Cheung, Weiming Lu:
On liveness and boundedness of asymmetric choice nets. Theor. Comput. Sci. 311(1-3): 165-197 (2004) - [j24]Hejiao Huang, To-Yat Cheung, Wai Ming Mak:
Structure and behavior preservation by Petri-net-based refinements in system design. Theor. Comput. Sci. 328(3): 245-269 (2004) - 2003
- [j23]Li Jiao, To-Yat Cheung:
Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties. Int. J. Found. Comput. Sci. 14(4): 641-658 (2003) - [j22]Fan Zhang, To-Yat Cheung:
Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines. IEEE Trans. Software Eng. 29(1): 1-14 (2003) - [c16]H. J. Huang, Li Jiao, To-Yat Cheung:
Property-preserving composition of augmented marked graphs that share common resources. ICRA 2003: 1446-1451 - 2002
- [c15]Li Jiao, To-Yat Cheung, Weiming Lu:
Characterizing Liveness of Petri Nets in Terms of Siphons. ICATPN 2002: 203-216 - [c14]Hai Zhuge, Yanyan Li, Jia Bi, To-Yat Cheung:
KGCL: A Knowledge-Grid-Based Cooperative Learning Environment. ICWL 2002: 192-202 - 2001
- [j21]Hai Zhuge, To-Yat Cheung, Hung Keng Pung:
A timed workflow process model. J. Syst. Softw. 55(3): 231-243 (2001) - [c13]Yiqin Lu, Gang Wei, To-Yat Cheung:
Managing Feature Interactions in Telecommunications Systems by Temporal Colored Petri Nets. ICECCS 2001: 260-269 - [c12]Yiqin Lu, Gang Wei, To-Yat Cheung:
A use case driven approach to synthesis and analysis of flexible manufacturing systems. SMC 2001: 2445-2450 - 2000
- [j20]Huiwei Guan, To-Yat Cheung:
Efficient approaches for constructing a massively parallel processing system. J. Syst. Archit. 46(13): 1185-1190 (2000) - [c11]Hai Zhuge, Hung Keng Pung, To-Yat Cheung:
Timed Workflow: Concept, Model, and Method. WISE 2000: 183-189
1990 – 1999
- 1999
- [j19]Weijia Jia, Jiannong Cao, To-Yat Cheung, Xiaohua Jia:
A Multicast Protocol Based on a Single Logical Ring Using a Virtual Token and Logical Clocks. Comput. J. 42(3): 202-220 (1999) - [j18]Moses Charikar
, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. J. Algorithms 33(1): 73-91 (1999) - [c10]To-Yat Cheung, Yiqin Lu:
Five Classes of Invariant-Preserving Transformations on Colored Petri Nets. ICATPN 1999: 384-403 - 1998
- [j17]To-Yat Cheung, Wei Zeng:
Invariant-preserving transformations for the verification of place/transition systems. IEEE Trans. Syst. Man Cybern. Part A 28(1): 114-121 (1998) - [c9]Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. SODA 1998: 192-200 - 1997
- [c8]Huiwei Guan, To-Yat Cheung, Chi-Kwong Li, Songnian Yu:
Parallel Design and Implementation of SOM Neural Computing Model in PVM Environment of a Distributed System. APDC 1997: 26-33 - [c7]Jiannong Cao, Weijia Jia, Xiaohua Jia, To-Yat Cheung:
Design and Analysis of An Efficient Algorithm for Coordinated Checkpointing in Distributed Systems. APDC 1997: 261-269 - 1996
- [j16]To-Yat Cheung:
Petri nets for protocol engineering. Comput. Commun. 19(14): 1250-1257 (1996) - [c6]Weijia Jia, Jiannong Cao, To-Yat Cheung:
A Multicast Protocol Based on a Single Logical Ring Using a Virtual Token and Logical Clocks. ICPP, Vol. 1 1996: 85-92 - [c5]Brian Siu, To-Yat Cheung:
Towards a Method for Schema Translation from Relational to Object-Oriented Databases. International Hong Kong Computer Society Database Workshop 1996: 307-323 - 1995
- [j15]To-Yat Cheung, Xinming Ye:
A Fault-Detection Approach to the Conformance Testing of Nondeterministic Systems. J. Parallel Distributed Comput. 28(1): 94-100 (1995) - [c4]To-Yat Cheung:
Some Government Policies on the Development of IT in Hong Kong. PACIS 1995: 12 - 1993
- [c3]To-Yat Cheung:
An Integrated Software Environment for the Development of Distributed Systems. Software Engineering Education 1993: 221-232 - 1991
- [j14]To-Yat Cheung, Yun-zhou Zhu:
Recognizing Different Types of Beta-Cycles in a Database Scheme. Theor. Comput. Sci. 81(2): 295-304 (1991) - [c2]To-Yat Cheung, Youwen Wu, Xinming Ye:
Generating Test Sequences and their Degrees of Indeterminism for Protocols. PSTV 1991: 301-316 - 1990
- [c1]To-Yat Cheung, Yucheng Ye:
An Executor for Graphical LOTOS. FORTE 1990: 547-550
1980 – 1989
- 1989
- [j13]To-Yat Cheung, Mike Sablatash:
A Functional Network Model for Analytical File Management in ISDN Systems from Generalization of Videotex Systems. Comput. Networks 16: 299-310 (1989) - [j12]To-Yat Cheung:
An Algorithm with Decentralized Control for Sorting Files in a Network. J. Parallel Distributed Comput. 7(3): 464-481 (1989) - 1987
- [j11]Yun-zhou Zhu, To-Yat Cheung:
A New Distributed Breadth-First-Search Algorithm. Inf. Process. Lett. 25(5): 329-334 (1987) - 1986
- [j10]To-Yat Cheung:
On the Projection Method for Protocol Verification. IEEE Trans. Software Eng. 12(11): 1088-1095 (1986) - 1983
- [j9]To-Yat Cheung:
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation. IEEE Trans. Software Eng. 9(4): 504-512 (1983) - 1982
- [j8]To-Yat Cheung:
Estimating Block Accesses and Number of Recorde in File Management. Commun. ACM 25(7): 484-487 (1982) - [j7]To-Yat Cheung:
A Statistical Model for Estimating the Number of Records in a Relational Database. Inf. Process. Lett. 15(3): 115-118 (1982) - [j6]To-Yat Cheung:
A Method for Equijoin Queries in Distributed Relational Databases. IEEE Trans. Computers 31(8): 746-751 (1982) - 1980
- [j5]To-Yat Cheung:
Computational Comparison of Eight Methods for the Maximum Network Flow Problem. ACM Trans. Math. Softw. 6(1): 1-16 (1980) - [j4]To-Yat Cheung:
Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach. ACM Trans. Math. Softw. 6(3): 387-390 (1980) - [j3]To-Yat Cheung:
Algorithm 558: A Program for the Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach [H]. ACM Trans. Math. Softw. 6(3): 430-431 (1980)
1970 – 1979
- 1974
- [j2]To-Yat Cheung:
An Interactive Graphic Display for Region Partitioning by Linear Programming. Commun. ACM 17(9): 513-516 (1974) - 1973
- [j1]To-Yat Cheung:
Approximate Solutions and Error Bounds for Quasilinear Elliptic Boundary Value Problems. J. Comput. Syst. Sci. 7(3): 306-322 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
