Limited activity: This researcher has not published recently (last publication: 2013). Profile data may be outdated.
Match tier Listed
Presence Current · Arkansas
Last published 2013
Sources OpenAlex · ORCID
Refreshed 2026-10-03

Wing Ning Li

Role not yet determined Is this you? Add your title

University of Arkansas primary UA Little Rock

Also affiliated: University of Minnesota (1988); Tennessee State University (2002)

6 h-index 23 pubs 81 cited

Research Areas

OverviewAI-generated summary

Wing Ning Li's research has primarily focused on the development and analysis of algorithms for computer systems. This work includes investigations into distributed systems, fault tolerance, and the performance of various computational models. Li has explored efficient methods for data management and communication in networked environments, contributing to the understanding of system reliability and scalability.

Metrics

  • h-index: 6
  • Publications: 23
  • Citations: 81

Selected Publications

  • Searching for Monochromatic-Square-Free Ramsey Grid Colorings via SAT Solvers (2013)
    DOI OpenAlex
  • Identification of Consensus Glycosaminoglycan Binding Strings in Proteins (2013)
    8 citations DOI OpenAlex
  • Parallel search for Ramsey grid colorings (2012)
    1 citation DOI OpenAlex
  • Transitive Closure of Data Records: Application and Computation (2009)
    International series in management science/operations research/International series in operations research & management science 13 citations DOI OpenAlex
  • Distributed Data Structures and Algorithms for Disjoint Sets in Computing Connected Components of Huge Network. (2007)
    Parallel and Distributed Processing Techniques and Applications 2 citations OpenAlex
  • On unit task linear-nonlinear two-cluster scheduling problem (2005)
    2 citations DOI OpenAlex
  • Computing the configuration space for a convex robot on hypercube multiprocessors (2002)
    2 citations DOI OpenAlex
  • NON-LINEAR CLUSTERING SCHEDULING WITH TWO CLUSTERS, ONE BEING LINEAR, IS NP -HARD (2001)
    1 citation DOI OpenAlex
  • On the Thread Scheduling Problem (2000)
    Joint International Conference on Information Sciences OpenAlex
  • Artificial neural networks on reconfigurable meshes (1998)
    Lecture notes in computer science 1 citation DOI OpenAlex
  • Two-segmented channel routing is strong NP-complete (1997)
    Discrete Applied Mathematics 10 citations DOI OpenAlex
  • An object-oriented design and implementation of reusable graph objects with C++ (1996)
    2 citations DOI OpenAlex
  • An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (1995)
    3 citations DOI OpenAlex
  • Optimal hypercube algorithms for robot configuration space computation (1995)
    3 citations DOI OpenAlex
  • The complexity of segmented channel routing (1995)
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 7 citations DOI OpenAlex

View all publications on OpenAlex →

Collaborators

Researchers in the database who share publications

Thallapuranam Krishnaswamy Suresh Kumar University of Arkansas at Fayetteville 1 shared publication Srinivas Jayanthi University of Arkansas at Fayetteville 1 shared publication Reid A. Phillips University of Arkansas at Fayetteville 1 shared publication Gordon Beavers University of Arkansas at Fayetteville 1 shared publication