default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFong Pong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j8]Fong Pong, Nian-Feng Tzeng:
Concise Lookup Tables for IPv4 and IPv6 Longest Prefix Matching in Scalable Routers. IEEE/ACM Trans. Netw. 20(3): 729-741 (2012)- [c12]Chih-Hsun Chou, Fong Pong, Nian-Feng Tzeng:
Speedy FPGA-based packet classifiers with low on-chip memory requirements. FPGA 2012: 11-20 - 2011
- [j7]Fong Pong, Nian-Feng Tzeng:
HaRP: Rapid Packet Classification via Hashing Round-Down Prefixes. IEEE Trans. Parallel Distributed Syst. 22(7): 1105-1119 (2011) - 2010
- [j6]Fong Pong, Nian-Feng Tzeng:
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation. IEEE/ACM Trans. Netw. 18(1): 81-94 (2010)
2000 – 2009
- 2009
- [c11]Fong Pong, Nian-Feng Tzeng:
Hashing Round-down Prefixes for Rapid Packet Classification. USENIX ATC 2009 - 2008
- [c10]Fong Pong, Nian-Feng Tzeng:
Application-Layer Packet Processing through Ethereal Memory. NCA 2008: 185-194 - 2007
- [c9]Fong Pong, Nian-Feng Tzeng, Koray Öner, Chun Ning, Kwong-Tak Chui, Manoj Ekbote, Yanping Lu:
Communication performance of a modular high-bandwidth multiprocessor system. ICPADS 2007: 1-8 - [c8]Fong Pong, Nian-Feng Tzeng:
Storage-Efficient Architecture for Routing Tables via Prefix Transformation. LCN 2007: 55-62 - 2006
- [c7]Fong Pong:
Fast and Robust TCP Session Lookup by Digest Hash. ICPADS (1) 2006: 507-514 - 2000
- [j5]Fong Pong, Michel Dubois:
Formal Automatic Verification of Cache Coherence in Multiprocessors with Relaxed Memory Models. IEEE Trans. Parallel Distributed Syst. 11(9): 989-1006 (2000)
1990 – 1999
- 1998
- [j4]Fong Pong, Michel Dubois:
Formal Verification of Complex Coherence Protocols Using Symbolic State Models. J. ACM 45(4): 557-587 (1998) - [j3]Fong Pong, Michael C. Browne, Gunes Aybay, Andreas Nowatzyk, Michel Dubois:
Design Verification of the S3.mp Cache-Coherent Shared-Memory System. IEEE Trans. Computers 47(1): 135-140 (1998) - 1997
- [j2]Fong Pong, Michel Dubois:
Verification Techniques for Cache Coherence Protocols. ACM Comput. Surv. 29(1): 82-126 (1997) - 1996
- [c6]Fong Pong, Michel Dubois:
Formal Verification of Delayed Consistency Protocols. IPPS 1996: 124-131 - [c5]Ashley Saulsbury, Fong Pong, Andreas Nowatzyk:
Missing the Memory Wall: The Case for Processor/Memory Integration. ISCA 1996: 90-101 - 1995
- [j1]Fong Pong, Michel Dubois:
A New Approach for the Verification of Cache Coherence Protocols. IEEE Trans. Parallel Distributed Syst. 6(8): 773-787 (1995) - [c4]Fong Pong, Andreas Nowatzyk, Gunes Aybay, Michel Dubois:
Verifying Distributed Directory-Based Cahce Coherence Protocols: S3.mp, a Case Study. Euro-Par 1995: 287-300 - 1994
- [c3]Fong Pong, Per Stenström, Michel Dubois:
An Integrated Methodology for the Verification of Directory-Based Cache Protocols. ICPP (1) 1994: 158-165 - 1993
- [c2]Fong Pong, Michel Dubois:
The Verification of Cache Coherence Protocols. SPAA 1993: 11-20 - [c1]Fong Pong, Michel Dubois:
Correctness of a Directory-Based Cache Coherence Protocol: Early Experience. SPDP 1993: 37-44
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-07-17 21:30 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:
