default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuanfeng Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Lewis Tseng, Guanfeng Liang, Nitin H. Vaidya:
Iterative approximate Byzantine consensus in arbitrary directed graphs. Distributed Comput. 37(3): 225-246 (2024)
2010 – 2019
- 2017
- [c24]Rupesh Gupta, Guanfeng Liang, Rómer Rosales:
Optimizing Email Volume For Sitewide Engagement. CIKM 2017: 1947-1955 - 2016
- [j5]Guanfeng Liang, Ulas C. Kozat:
On Throughput-Delay Optimal Access to Storage Clouds via Load Adaptive Coding and Chunking. IEEE/ACM Trans. Netw. 24(4): 2168-2181 (2016) - [j4]Ulas C. Kozat, Guanfeng Liang, Koray Kokten, János Tapolcai
:
On Optimal Topology Verification and Failure Localization for Software Defined Networks. IEEE/ACM Trans. Netw. 24(5): 2899-2912 (2016) - [c23]Rupesh Gupta, Guanfeng Liang, Hsiao-Ping Tseng, Ravi Kiran Holur Vijay, Xiaoyu Chen, Rómer Rosales:
Email Volume Optimization at LinkedIn. KDD 2016: 97-106 - 2015
- [j3]Ulas C. Kozat, Guanfeng Liang:
Building Reliable Storage Clouds: Models, Fundamental Tradeoffs, and Solutions. Found. Trends Netw. 9(4): 219-315 (2015) - [c22]Ulas C. Kozat, Guanfeng Liang:
Demand estimation in dense and efficient small cell architectures. ICC 2015: 3435-3441 - [c21]Tan Zhang, Xian Zhang, Fangming Liu, Hongkun Leng, Qian Yu, Guanfeng Liang:
eTrain: Making Wasted Energy Useful by Utilizing Heartbeats for Mobile Data Transmissions. ICDCS 2015: 113-122 - 2014
- [j2]Guanfeng Liang, Ulas C. Kozat:
FAST CLOUD: Pushing the Envelope on Delay Performance of Cloud Storage With Coding. IEEE/ACM Trans. Netw. 22(6): 2012-2025 (2014) - [c20]Guanfeng Liang, Ulas C. Kozat:
Use of erasure code for low latency cloud storage. Allerton 2014: 576-581 - [c19]Chris Xiao Cai, Guanfeng Liang, Ulas C. Kozat:
Load balancing and dynamic scaling of cache storage against zipfian workloads. ICC 2014: 4208-4214 - [c18]Guanfeng Liang, Ulas C. Kozat:
TOFEC: Achieving optimal throughput-delay trade-off of cloud storage using erasure codes. INFOCOM 2014: 826-834 - [c17]Shengbo Chen, Yin Sun, Ulas C. Kozat, Longbo Huang, Prasun Sinha, Guanfeng Liang, Xin Liu, Ness B. Shroff:
When queueing meets coding: Optimal-latency data retrieving scheme in storage clouds. INFOCOM 2014: 1042-1050 - [c16]Ulas C. Kozat, Guanfeng Liang, Koray Kokten:
On diagnosis of forwarding plane via static forwarding rules in Software Defined Networks. INFOCOM 2014: 1716-1724 - [i16]Guanfeng Liang, Ulas C. Kozat:
On Throughput-Delay Optimal Access to Storage Clouds via Load Adaptive Coding and Chunking. CoRR abs/1403.5007 (2014) - [i15]Shengbo Chen, Yin Sun, Ulas C. Kozat, Longbo Huang, Prasun Sinha, Guanfeng Liang, Xin Liu, Ness B. Shroff:
When Queueing Meets Coding: Optimal-Latency Data Retrieving Scheme in Storage Clouds. CoRR abs/1404.6687 (2014) - 2013
- [c15]Ulas C. Kozat, Guanfeng Liang, Koray Kokten:
Verifying forwarding plane connectivity and locating link failures using static rules in software defined networks. HotSDN 2013: 157-158 - [i14]Guanfeng Liang, Ulas C. Kozat:
FAST CLOUD: Pushing the Envelope on Delay Performance of Cloud Storage with Coding. CoRR abs/1301.1294 (2013) - [i13]Guanfeng Liang, Ulas C. Kozat:
TOFEC: Achieving Optimal Throughput-Delay Trade-off of Cloud Storage Using Erasure Codes. CoRR abs/1307.8083 (2013) - [i12]Ulas C. Kozat, Guanfeng Liang, Koray Kokten:
On Diagnosis of Forwarding Plane via Static Forwarding Rules in Software Defined Networks. CoRR abs/1308.4465 (2013) - 2012
- [b1]Guanfeng Liang:
Network-aware mechanisms for tolerating Byzantine failures in distributed systems. University of Illinois Urbana-Champaign, USA, 2012 - [c14]Guanfeng Liang, Nitin H. Vaidya:
Capacity of Byzantine consensus in capacity limited point-to-point networks. COMSNETS 2012: 1-10 - [c13]Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya:
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers. INFOCOM 2012: 1422-1430 - [c12]Guanfeng Liang, Nitin H. Vaidya:
Byzantine broadcast in point-to-point networks using local linear coding. PODC 2012: 319-328 - [c11]Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang:
Iterative approximate byzantine consensus in arbitrary directed graphs. PODC 2012: 365-374 - [i11]Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang:
Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs. CoRR abs/1201.4183 (2012) - [i10]Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang:
Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems. CoRR abs/1202.6094 (2012) - 2011
- [c10]Guanfeng Liang, Nitin H. Vaidya:
Capacity of byzantine agreement with finite link capacity. INFOCOM 2011: 739-747 - [c9]Guanfeng Liang, Nitin H. Vaidya:
Error-free multi-valued consensus with byzantine failures. PODC 2011: 11-20 - [c8]Guanfeng Liang, Nitin H. Vaidya:
Multiparty Equality Function Computation in Networks with Point-to-Point Links. SIROCCO 2011: 258-269 - [i9]Guanfeng Liang, Nitin H. Vaidya:
Error-Free Multi-Valued Consensus with Byzantine Failures. CoRR abs/1101.3520 (2011) - [i8]Guanfeng Liang, Nitin H. Vaidya:
Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links. CoRR abs/1104.0043 (2011) - [i7]Guanfeng Liang, Nitin H. Vaidya:
Multiparty Equality and Byzantine Broadcast using Random Linear Codes in Point-to-Point Networks. CoRR abs/1106.1845 (2011) - [i6]Guanfeng Liang, Nitin H. Vaidya:
New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures. CoRR abs/1106.1846 (2011) - 2010
- [c7]Guanfeng Liang, Rachit Agarwal, Nitin H. Vaidya:
When Watchdog Meets Coding. INFOCOM 2010: 2267-2275 - [c6]Chun-cheng Chen, Guanfeng Liang, Nitin H. Vaidya:
OCP: Opportunistic Carrier Prediction for wireless networks. MASS 2010: 1-10 - [c5]Guanfeng Liang, Nitin H. Vaidya:
Capacity of byzantine agreement: summary of recent results. S3@MobiCom 2010: 13-16 - [c4]Guanfeng Liang, Nitin H. Vaidya:
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks. PODC 2010: 396-397 - [i5]Guanfeng Liang, Nitin H. Vaidya:
Complexity of Multi-Value Byzantine Agreement. CoRR abs/1006.2422 (2010) - [i4]Guanfeng Liang, Nitin H. Vaidya:
Short Note on Complexity of Multi-Value Byzantine Agreement. CoRR abs/1007.4857 (2010) - [i3]Guanfeng Liang, Nitin H. Vaidya:
Deterministic Consensus Algorithm with Linear Per-Bit Complexity. CoRR abs/1008.4551 (2010) - [i2]Guanfeng Liang, Nitin H. Vaidya:
Multiparty Equality Function Computation in Networks with Point-to-Point Links. CoRR abs/1010.5497 (2010)
2000 – 2009
- 2009
- [c3]Guanfeng Liang, Nitin H. Vaidya:
Cooperation Helps Power Saving. MASS 2009: 439-447 - [i1]Guanfeng Liang, Nitin H. Vaidya:
When Watchdog Meets Coding. CoRR abs/0910.0881 (2009) - 2008
- [j1]Guanfeng Liang, Ben Liang:
Effect of Delay and Buffering on Jitter-Free Streaming Over Random VBR Channels. IEEE Trans. Multim. 10(6): 1128-1141 (2008) - 2007
- [c2]Guanfeng Liang, Ben Liang:
Balancing Interruption Frequency and Buffering Penalties in VBR Video Streaming. INFOCOM 2007: 1406-1414 - 2006
- [c1]Guanfeng Liang, Ben Liang:
Jitter-free probability bounds for video streaming over random VBR channel. QSHINE 2006: 6
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-08-13 21:45 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:
