default search action
Wing Ning Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c26]Reid A. Phillips, Wing Ning Li, Craig W. Thompson, Wesley Deneke:
Data File Layout Inference Using Content-Based Oracles. CSE 2013: 1029-1035 - [c25]Wesley Deneke, Wing Ning Li, Craig W. Thompson:
Automatic Composition of ETL Workflows from Business Intents. CSE 2013: 1036-1042 - [c24]Chris Dempewolf, Jacqueline Morris, Meghna Chopra, Srinivas Jayanthi, Thallapuranam K. Suresh Kumar, Wing Ning Li:
Identification of Consensus Glycosaminoglycan Binding Strings in Proteins. ICISA 2013: 1-5 - [c23]Paul Walton, Wing Ning Li:
Searching for Monochromatic-Square-Free Ramsey Grid Colorings via SAT Solvers. ICISA 2013: 1-5 - 2012
- [c22]Daniel Apon, Wing Ning Li:
Parallel search for Ramsey grid colorings. ACM Southeast Regional Conference 2012: 274-279
2000 – 2009
- 2008
- [c21]Wesley Deneke, Josh Eno, Wing Ning Li, Craig W. Thompson, John R. Talburt, Jonathan Loghry, David Nash, Jeff Stires:
Towards a Domain-Specific Modeling Language for Customer Data Integration Workflow. GPC Workshops 2008: 49-56 - [c20]Reid A. Phillips, Patrick Benham, Wing Ning Li, Gordon Beavers, Craig W. Thompson:
Automating File Schema Recognition Via Content-Based Oracles. IKE 2008: 279-285 - 2007
- [j9]Craig W. Thompson, Wing Ning Li, Zhichun Xiao:
Workflow Planning on a Grid. IEEE Internet Comput. 11(1): 74-77 (2007) - [c19]Wing Ning Li, Thomas Schweiger:
Distributed Data Structures and Algorithms for Disjoint Sets in Computing Connected Components of Huge Network. PDPTA 2007: 905-909 - 2006
- [c18]Zhichun Xiao, Craig W. Thompson, Wing Ning Li:
Data Processing Workflow Automation in Grid Architecture. GCC Workshops 2006: 189-195 - [c17]Roopa Bheemavaram, Johnson Zhang, Wing Ning Li:
Efficient Algorithms for Grouping Data to Improve Data Quality. IKE 2006: 149-154 - 2005
- [c16]Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq:
On unit task linear-nonlinear two-cluster scheduling problem. SAC 2005: 713-717 - 2004
- [c15]John Jing-Fu Jenq, Wing Ning Li:
Parallel Thinning on Rmesh. CATA 2004: 164-167 - [c14]Wing Ning Li, Zhichun Xiao, John Jing-Fu Jenq:
An Exact Scheduling Algorithm for Two, Linear-Nonlinear Clusters, With A Common Communication Delay. PDPTA 2004: 1095-1101 - 2003
- [c13]Wing Ning Li:
Convergent transfer subgraph characterization and computation. ISCAS (3) 2003: 248-251 - [c12]Chia-Chyi Li, Wing Ning Li:
A Novel Computational Model for Predicting Interactive Sites of Proteins. METMBS 2003: 72-76 - [c11]Chia-Chyi Li, Wing Ning Li:
PISMOL: A Software Tool for Protein Interactive Site Prediction Model Development. METMBS 2003: 77-81 - 2000
- [j8]Wing Ning Li, Jing-Fu Jenq:
On the Thread Scheduling Problem. J. Univers. Comput. Sci. 6(10): 994-1014 (2000)
1990 – 1999
- 1998
- [j7]John Jing-Fu Jenq, Wing Ning Li:
Feedforward backpropagation artificial neural networks on reconfigurable meshes. Future Gener. Comput. Syst. 14(5-6): 313-319 (1998) - [c10]Jing-Fu Jenq, Wing Ning Li:
Artificial Neural Networks on Reconfigurable Meshes. IPPS/SPDP Workshops 1998: 234-242 - [c9]Wing Ning Li:
Towards a hierarchical design and integration of programming projects. SIGCSE 1998: 121-125 - 1997
- [j6]Wing Ning Li:
Two-segmented Channel Routing Is Strong NP-complete. Discret. Appl. Math. 78(1-3): 291-298 (1997) - 1996
- [c8]Wing Ning Li, Ravi Kiran:
An object-oriented design and implementation of reusable graph objects with C++: a case study. SAC 1996: 510-514 - 1995
- [j5]Wing Ning Li:
The complexity of segmented channel routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(4): 518-523 (1995) - [c7]Wing Ning Li:
An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization. SAC 1995: 56-60 - [c6]Jing-Fu Jenq, Wing Ning Li:
Optimal hypercube algorithms for robot configuration space computation. SAC 1995: 182-186 - [c5]Jing-Fu Jenq, Wing Ning Li:
Computing the configuration space for a convex robot on hypercube multiprocessors. SPDP 1995: 160-167 - 1994
- [c4]Wing Ning Li:
On the equivalence of pull-up transistor assignment in PLA folding and distribution graph. SAC 1994: 374-378 - 1993
- [j4]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni:
On the circuit implementation problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(8): 1147-1156 (1993) - [c3]Wing Ning Li:
Strongly NP-Hard Discrete Gate Sizing Problems. ICCD 1993: 468-471 - 1992
- [c2]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni:
On the Circuit Implementation Problem. DAC 1992: 478-483 - 1990
- [j3]Wing Ning Li, Sartaj Sahni:
Pull up transistor folding. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(5): 512-521 (1990) - [j2]Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni:
Long and short covering edges in combination logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(12): 1245-1253 (1990)
1980 – 1989
- 1989
- [j1]Wing Ning Li, Sudhakar M. Reddy, Sartaj K. Sahni:
On path selection in combinational logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(1): 56-63 (1989) - 1988
- [c1]Wing Ning Li, Sudhakar M. Reddy, Sartaj Sahni:
On Path Selection in Combinational Logic Circuits. DAC 1988: 142-147
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 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint