Francis Y. L. Chin
#176,203
Most Influential Person Now
Francis Y. L. Chin's AcademicInfluence.com Rankings
Francis Y. L. Chinmathematics Degrees
Mathematics
#7914
World Rank
#10754
Historical Rank
Geometry
#203
World Rank
#282
Historical Rank
Measure Theory
#2842
World Rank
#3380
Historical Rank
Download Badge
Mathematics Computer Science
Francis Y. L. Chin's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Francis Y. L. Chin Influential?
(Suggest an Edit or Addition)Francis Y. L. Chin's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Finding the Medial Axis of a Simple Polygon in Linear Time (1995) (225)
- Efficient parallel algorithms for some graph problems (1982) (212)
- Auditing and Inference Control in Statistical Databases (1982) (211)
- Packing Squares into a Square (1990) (183)
- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs (2004) (112)
- General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction (1992) (102)
- A simple algorithm for the constrained sequence problems (2004) (98)
- Statistical database design (1981) (96)
- Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? (2003) (95)
- Security problems on inference control for SUM, MAX, and MIN queries (1986) (92)
- Algorithms for Updating Minimal Spanning Trees (1978) (88)
- An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees (1985) (87)
- On Embedding Rectangular Grids in Hypercubes (1988) (83)
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems (1984) (82)
- Mining confident rules without support requirement (2001) (82)
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons (1983) (82)
- Improved on-line broadcast scheduling with deadlines (2006) (80)
- Scheduling the Open Shop to Minimize Mean Flow Time (1982) (75)
- Security in statistical databases for queries with small counts (1978) (60)
- Optimal methods for coordinated enroute web caching for tree networks (2005) (57)
- Schedulers for larger classes of pinwheel instances (1993) (54)
- A study on the protection of statistical data bases (1977) (54)
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time (1999) (49)
- Multimedia Object Placement for Transparent Data Replication (2007) (48)
- Efficient constrained multiple sequence alignment with performance guarantee (2003) (43)
- A fast algorithm for computing longest common subsequences of small alphabet size (1989) (43)
- Interpolating Polyhedral Models Using Intrinsic Shape Parameters (1997) (41)
- A new upper bound 2.5545 on 2D Online Bin Packing (2011) (37)
- Auditing for secure statistical databases (1981) (34)
- An O(n) algorithm for determining a near-optimal computation order of matrix chain products (1978) (32)
- The Effectiveness Of Output Modification By Rounding For Protection Of Statistical Data Bases (1979) (32)
- Efficient Inference Control for Range SUM Queries (1984) (29)
- Object-Based Surveillance Video Retrieval System with Real-Time Indexing Methodology (2007) (27)
- Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks (1999) (27)
- A polynomial time solution for labeling a rectilinear map (1997) (27)
- Optimal Generating Kernels for Image Pyramids by Piecewise Fitting (1992) (27)
- Linear-Time Haplotype Inference on Pedigrees Without Recombinations (2006) (26)
- OPTIMAL PARALLEL ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM. (1981) (25)
- Finding Motifs with Insufficient Number of Strong Binding Sites (2005) (25)
- Performance analysis of some simple heuristics for computing longest common subsequences (1994) (24)
- Minimum Manhattan Network is NP-Complete (2009) (23)
- Real-time Multiple Head Shape Detection and Tracking System with Decentralized Trackers (2006) (23)
- Escaping a Grid by Edge-Disjoint Paths (2000) (22)
- Competitive Algorithms for Unbounded One-Way Trading (2014) (22)
- Efficient Block-based Motion Segmentation Method using Motion Vector Consistency (2005) (20)
- Frequency Allocation Problems for Linear Cellular Networks (2006) (20)
- Online frequency allocation in cellular networks (2007) (20)
- On J-maximal and J-minimal Flow-Shop Schedules (1981) (19)
- Efficient constrained multiple sequence alignment with performance guarantee. (2005) (19)
- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs (2007) (19)
- Shadow detection for vehicles by locating the object-shadow boundary (2005) (19)
- Greedy online frequency allocation in cellular networks (2007) (18)
- Approximate and dynamic rank aggregation (2004) (18)
- An Optimal EREW Parallel Algorithm for Parenthesis Matching (1989) (18)
- Watershed segmentation with boundary curvature ratio based merging criterion (2007) (18)
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing (2010) (17)
- Improved competitive algorithms for online scheduling with partial job values (2004) (17)
- Enhancing the Security of Statistical Databases with a Question-Answering System and a Kernel Design (1982) (17)
- Optimal Simulation of Full Binary Trees on Faulty Hypercubes (1995) (16)
- Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids (2000) (16)
- Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems (1982) (15)
- Dilation-5 embedding of 3-dimensional grids into hypercubes (1993) (15)
- A General Program Scheme for Finding Bridges (1983) (14)
- On-line scheduling of parallel jobs on two machines (2008) (14)
- A clique-based algorithm for constructing feasible timetables (2011) (13)
- An improved algorithm for finding the median distributively (1987) (13)
- Online bin packing of fragile objects with application in cellular networks (2005) (12)
- Maximum Weight Triangulation and Graph Drawing (1998) (12)
- A Faster Algorithm for Finding Disjoint Paths in Grids (1999) (12)
- Efficient algorithms for finding disjoint paths in grids (1997) (12)
- Algorithms for Placing Monitors in a Flow Network (2009) (12)
- Bounds on Schedules for Independent Tasks with Similar Execution Times (1981) (12)
- Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes (2001) (12)
- Minimum Vertex Distance Between Separable Convex Polygons (1984) (11)
- One-Space Bounded Algorithms for Two-Dimensional Bin Packing (2010) (11)
- Laxity Helps in Broadcast Scheduling (2005) (11)
- Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops) (1980) (11)
- A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation (1976) (11)
- Explicit contour model for vehicle tracking with automatic hypothesis validation (2005) (11)
- Competitive Algorithms for Online Pricing (2011) (11)
- Online OVSF Code Assignment with Resource Augmentation (2007) (10)
- Uniformly inserting points on square grid (2011) (10)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (2013) (10)
- Optimal termination protocols for network partitioning (1983) (10)
- A hybrid simulated annealing algorithm for container loading problem (2009) (10)
- Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing (2013) (10)
- A Constant-Competitive Algorithm for Online OVSF Code Assignment (2007) (9)
- A Polynomial Time Solution for Labeling a Rectlinear Map (1998) (9)
- A New Subgraph of Minimum Weight Triangulations (1996) (9)
- k-Recombination Haplotype Inference in Pedigrees (2005) (8)
- A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes (1993) (8)
- Maximum Stabbing Line in 2D Plane (1999) (8)
- Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks (2010) (8)
- Online pricing for bundles of multiple items (2014) (8)
- Construction of the nearest neighbor embracing graph of a point set (2004) (8)
- Triangulations without minimum-weight drawing (2000) (8)
- A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs (2009) (8)
- Variable-Size Rectangle Covering (2009) (8)
- Optimal Resilient Distributed Algorithms for Ring Election (1993) (7)
- Hierarchical motion estimation based on visual patterns for video coding (1996) (6)
- An Information-Based Model for Failure-Handling in Distributed Database Systems (1987) (6)
- A New Upper Bound on 2D Online Bin Packing (2009) (6)
- Online tree node assignment with resource augmentation (2009) (6)
- An efficient cache replacement algorithm for multimedia object caching (2007) (6)
- A Near-optimal Algorithm for Finding the Median Distributively (1985) (5)
- Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees (1990) (5)
- The Partial Fraction Expansion Problem and Its Inverse (1977) (5)
- Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract) (1995) (5)
- A tight lower bound for job scheduling with cancellation (2006) (5)
- Approximation Algorithms for Some Optimal 2D and 3D Triangulations (2007) (4)
- OUTPUT PERTURBATION FOR PROTECTION OF STATISTICAL DATA BASES. (1978) (4)
- 1-Bounded Space Algorithms for 2-Dimensional Bin Packing (2009) (4)
- Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees (2005) (4)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (2011) (4)
- Placement solutions for multiple versions of a multimedia object (2005) (4)
- Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops (2009) (4)
- An Efficient Algorithm for Rhythm-Finding (1992) (4)
- On Hamiltonian Tetrahedralizations Of Convex Polyhedra (2005) (4)
- Selection and Multiselection on Multi-Dimensional Meshes (2000) (4)
- Proceedings of the 4th International Symposium on Algorithms and Computation (1993) (4)
- Distributed election in complete networks (1988) (4)
- Visual pattern-based motion estimation for video coding (1996) (3)
- Dynamic Offline Conflict-Free Coloring for Unit Disks (2009) (3)
- Cooperative Determination on Cache Replacement Candidates for Transcoding Proxy Caching (2005) (3)
- Efficient Inference Control for Range SUM Queries on Statistical Data Bases (1981) (3)
- Approximation for minimum triangulation of convex polyhedra (2001) (3)
- Approximation and Competitive Algorithms for Single-Minded Selling Problem (2018) (3)
- The First International Workshop on Internet and Network Economics (2005) (3)
- Offline and online algorithms for single-minded selling problem (2020) (3)
- Automated hierarchical image segmentation based on merging of quadrilaterals (2006) (3)
- Unbounded One-Way Trading on Distributions with Monotone Hazard Rate (2017) (2)
- Online Uniformly Inserting Points on Grid (2010) (2)
- Constrained pairwise and center-star sequences alignment problems (2016) (2)
- Online Frequency Assignment in Wireless Communication Networks (2007) (2)
- Adaptive hierarchical vector quantization for image coding: new results (1995) (2)
- Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate (2018) (2)
- A unifying approach for a class of problems in the computational geometry of polygons (1985) (2)
- Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes (1991) (2)
- Experiences in Running a Flexible, Web-Based, and Self-Paced Course (2002) (2)
- Online scheduling of unit jobs with bounded importance ratio (2005) (2)
- Efficient algorithm for transversal of disjoint convex polygons (2002) (2)
- Constant-competitive tree node assignment (2014) (1)
- The 6th International Workshop on Algorithms in Bioinformatics (2006) (1)
- Constraints in the wavelet transform domain for stereo vision correspondence matching (1996) (1)
- Algorithms for Finding Optimal Disjoint Paths Around a Rectangle (1997) (1)
- Transversal of disjoint convex polygons (2003) (1)
- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks (2010) (1)
- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs (2010) (1)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (2005) (1)
- Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing (2012) (1)
- Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees (2001) (1)
- Motion and edge adaptive interpolation de-interlacing algorithm (2006) (1)
- On the Complexity of Constrained Sequences Alignment Problems (2014) (1)
- A Simple Algorithm for Finding All k-Edge-Connected Components (2015) (1)
- Optimal Resilient Ring Election Algorithms (1987) (1)
- Improved and optimal adaptive hierarchical vector quantization for image coding and indexing (1995) (1)
- Optimal Multiresolution Polygonal Approximation (1997) (1)
- Multimedia object placement for hybrid transparent data replication (2005) (1)
- The 16th Australasian Workshop on Combinatorial Algorithms (2005) (0)
- Title Online algorithms for 1-space bounded multi dimensional binpacking and hypercube packing (2013) (0)
- An optimal schedule for printing and binding (1984) (0)
- Maximum Weight Triangulation and Its Application on Graph Drawing (1998) (0)
- Title Linear-time haplotype inference on pedigrees withoutrecombinations and mating loops (2009) (0)
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time (2006) (0)
- Title Explicit contour model for vehicle tracking with automatichypothesis validation (2005) (0)
- Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling (2005) (0)
- Title Automated Hierarchical Image Segmentation Based on Mergingof (2007) (0)
- Online call control in cellular networks revisited (2012) (0)
- Title Escaping a grid by edge-disjoint paths (2000) (0)
- Title Finding optimal threshold for correction error reads in DNAassembling (2009) (0)
- CSIS 801 Final Year Project Report (2012) (0)
- Title A dynamic programming approach of finding an optimalbroadcast schedule in minimizing total flow time (2005) (0)
- A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane (1999) (0)
- Title An efficient algorithm for the extended ( l , d )-motif problem withunknown number of binding sites (2005) (0)
- Enhancing theSecurity ofStatistical Databases with (1982) (0)
- Offline algorithms and difficulties (2012) (0)
- Algorithms for Placing Monitors in a Flow Network (2012) (0)
- Haplotype Inference on Pedigrees Without Recombinations (2016) (0)
- Erratum to: "Efficient algorithm for transversal of disjoint convex polygons" (2003) (0)
- Optimal Cubic B-Spline Kernels for Image Pyramids1 (1994) (0)
- Title A 1-local asymptotic 13 / 9-competitive algorithm for multicoloringhexagonal graphs (2008) (0)
- Title Watershed segmentation with boundary curvature ratio basedmerging criterion (2007) (0)
- Constrained pairwise and center-star sequences alignment problems (2015) (0)
- Algorithms and Complexity for Tetrahedralization Detections (2002) (0)
- Title Approximation for minimum triangulation of convex polyhedra (2001) (0)
- On Greedy Tetrahedralization of Points in 3D (1994) (0)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (2023) (0)
- A Fast Error Evaluation Algorithm for Polynomial Approximation (1977) (0)
- Online pricing for bundles of multiple items (2013) (0)
- Discrete Algorithms Seminar (2009) (0)
- Csis 0801 Final Year Project Plan (2011) (0)
- Loughborough University Institutional Repository Competitive algorithms for unbounded one-way trading (2019) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Francis Y. L. Chin?
Francis Y. L. Chin is affiliated with the following schools:
