default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuan Hoang Nguyen 0001
Person information
- affiliation: Fantom Foundation
- affiliation (former): University of Sydney, Australia
Other persons with the same name
- Quan Hoang Nguyen 0002 — University of Queensland, Brisbane, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i13]Quan Hoang Nguyen, James Henderson, Egor Lysenko:
Progress Metrics in DAG-based Consensus. CoRR abs/2311.02339 (2023)- 2021
- [i12]Quan Hoang Nguyen, Andre Cronje, Michael Kong, Egor Lysenko, Alex Guzev:
Lachesis: Scalable Asynchronous BFT on DAG Streams. CoRR abs/2108.01900 (2021) - 2020
- [i11]Quan Hoang Nguyen, Andre Cronje:
On Probabilistic Byzantine Fault Tolerance. CoRR abs/2002.03087 (2020) - [i10]Quan Hoang Nguyen, Andre Cronje, Michael Kong:
OV: Validity-based Optimistic Smart Contracts. CoRR abs/2004.04338 (2020)
2010 – 2019
- 2019
- [i9]Quan Hoang Nguyen, Andre Cronje:
ONLAY: Online Layering for scalable asynchronous BFT system. CoRR abs/1905.04867 (2019) - [i8]Quan Hoang Nguyen, André Cronje, Michael Kong, Alex Kampa, George Samman:
StakeDag: Stake-based Consensus For Scalable Trustless Systems. CoRR abs/1907.03655 (2019) - [i7]Quan Hoang Nguyen, Andre Cronje, Michael Kong, Alex Kampa, George Samman:
StairDag: Cross-DAG Validation For Scalable BFT Consensus. CoRR abs/1908.11810 (2019) - [i6]Quan Hoang Nguyen, Andre Cronje, Michael Kong:
Fast Stochastic Peer Selection in Proof-of-Stake Protocols. CoRR abs/1911.04629 (2019) - 2018
- [c16]Seok-Hee Hong, Quan Hoang Nguyen, Amyra Meidiana, Jiaxi Li, Peter Eades:
BC Tree-Based Proxy Graphs for Visualization of Big Graphs. PacificVis 2018: 11-20 - [c15]Viet-Hong Tran, Quan Hoang Nguyen, Vinh Van Nguyen:
A Neural Network Classifier Based on Dependency Tree for English-Vietnamese Statistical Machine Translation. CICLing (1) 2018: 265-278 - [i5]Quan Hoang Nguyen:
INKA: An Ink-based Model of Graph Visualization. CoRR abs/1801.07008 (2018) - [i4]Sang-Min Choi, Jiho Park, Quan Hoang Nguyen, Andre Cronje, Ki-Young Jang, Hyunjoon Cheon, Yo-Sub Han, Byung-Ik Ahn:
OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems. CoRR abs/1810.02186 (2018) - [i3]Sang-Min Choi, Jiho Park, Quan Hoang Nguyen, Andre Cronje:
Fantom: A scalable framework for asynchronous distributed systems. CoRR abs/1810.10360 (2018) - 2017
- [j2]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades, Amyra Meidiana:
Proxy Graph: Visual Quality Metrics of Big Graph Sampling. IEEE Trans. Vis. Comput. Graph. 23(6): 1600-1611 (2017) - [c14]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
dNNG: Quality metrics and layout for neighbourhood faithfulness. PacificVis 2017: 290-294 - [c13]Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs Using Spectral Sparsification. GD 2017: 272-286 - [i2]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Towards Faithful Graph Visualizations. CoRR abs/1701.00921 (2017) - [i1]Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs using Spectral Sparsification. CoRR abs/1708.08659 (2017) - 2016
- [j1]Hooman Reisi Dehkordi
, Peter Eades, Seok-Hee Hong, Quan Hoang Nguyen:
Circular right-angle crossing drawings in linear time. Theor. Comput. Sci. 639: 26-41 (2016) - 2013
- [c12]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the faithfulness of graph visualizations. PacificVis 2013: 209-216 - [c11]Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Circular Graph Drawings with Large Crossing Angles. WALCOM 2013: 298-309 - 2012
- [c10]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
StreamEB: Stream Edge Bundling. GD 2012: 400-413 - [c9]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the Faithfulness of Graph Visualizations. GD 2012: 566-568 - 2011
- [c8]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. GD 2011: 123-135 - 2010
- [c7]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang:
Large Crossing Angles in Circular Layouts. GD 2010: 397-399
2000 – 2009
- 2009
- [c6]Adel Ahmed, Xiaoyan Fu, Seok-Hee Hong, Quan Hoang Nguyen, Kai Xu:
Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering. VINCI 2009: 25-39 - 2008
- [c5]Lin Gao, Quan Hoang Nguyen, Lian Li, Jingling Xue, Tin-Fook Ngai:
Thread-Sensitive Modulo Scheduling for Multicore Processors. ICPP 2008: 132-140 - [c4]Li Wang, Xuejun Yang, Jingling Xue, Yu Deng, Xiaobo Yan, Tao Tang, Quan Hoang Nguyen:
Optimizing scientific application loops on stream processors. LCTES 2008: 161-170 - 2007
- [c3]Adel Ahmed, Xiaoyan Fu, Seok-Hee Hong, Quan Hoang Nguyen, Kai Xu:
Visual Analysis of Dynamic Networks with Geological Clustering. IEEE VAST 2007: 221-222 - [c2]Lian Li, Quan Hoang Nguyen, Jingling Xue:
Scratchpad allocation for data aggregates in superperfect graphs. LCTES 2007: 207-216 - [c1]Quan Hoang Nguyen, Bernhard Scholz:
Computing SSA Form with Matrices. Bytecode@ETAPS 2007: 121-132
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-04-24 22:59 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:
