Francis Y. L. Chin

According to our database1, Francis Y. L. Chin authored at least 211 papers between 1976 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate.
Math. Found. Comput., 2018

EmotionX-DLC: Self-Attentive BiLSTM for Detecting Sequential Emotions in Dialogue.
CoRR, 2018

Neural Machine Translation for Financial Listing Documents.
Proceedings of the Neural Information Processing - 25th International Conference, 2018

EmotionX-DLC: Self-Attentive BiLSTM for Detecting Sequential Emotions in Dialogues.
Proceedings of the Sixth International Workshop on Natural Language Processing for Social Media, 2018

Approximation and Competitive Algorithms for Single-Minded Selling Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Unbounded One-Way Trading on Distributions with Monotone Hazard Rate.
Proceedings of the Combinatorial Optimization and Applications, 2017

Mixed Membership Sparse Gaussian Conditional Random Fields.
Proceedings of the Advanced Data Mining and Applications - 13th International Conference, 2017

2016
Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds.
Encyclopedia of Algorithms, 2016

Haplotype Inference on Pedigrees Without Recombinations.
Encyclopedia of Algorithms, 2016

Constrained pairwise and center-star sequences alignment problems.
J. Comb. Optim., 2016

Announcement.
Int. J. Found. Comput. Sci., 2016

2015
Competitive algorithms for unbounded one-way trading.
Theor. Comput. Sci., 2015

IDBA-MTP: A Hybrid Metatranscriptomic Assembler Based on Protein Information.
Journal of Computational Biology, 2015

Alberto Apostolico.
Int. J. Found. Comput. Sci., 2015

misFinder: identify mis-assemblies in an unbiased manner using reference and paired-end reads.
BMC Bioinformatics, 2015

2014
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing.
Theor. Comput. Sci., 2014

Constant-competitive tree node assignment.
Theor. Comput. Sci., 2014

Online pricing for bundles of multiple items.
J. Global Optimization, 2014

MetaCluster-TA: taxonomic annotation for metagenomic data based on assembly-assisted binning.
BMC Genomics, 2014

DDGni: Dynamic delay gene-network inference from high-temporal data using gapped local alignment.
Bioinformatics, 2014

Algorithms for Placing Monitors in a Flow Network.
Algorithmica, 2014

Learning Sparse Gaussian Bayesian Network Structure by Variable Grouping.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

On the Complexity of Constrained Sequences Alignment Problems.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Predicting drug-target interaction for new drugs using enhanced similarity measures and super-target clustering1.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

Competitive Algorithms for Unbounded One-Way Trading.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Non-adaptive complex group testing with multiple positive sets.
Theor. Comput. Sci., 2013

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing.
J. Comb. Optim., 2013

IDBA-MT: De Novo Assembler for Metatranscriptomic Data Generated from Next-Generation Sequencing Technology.
Journal of Computational Biology, 2013

IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels.
Bioinformatics, 2013

Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Intra- and inter-sparse multiple output regression with application on environmental microbial community study.
Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013

PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM Approach.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
MetaCluster 4.0: A Novel Binning Algorithm for NGS Reads and Huge Number of Species.
Journal of Computational Biology, 2012

Online call control in cellular networks revisited.
Inf. Process. Lett., 2012

Sheng Yu.
Int. J. Found. Comput. Sci., 2012

Competitive Algorithms for Online Pricing.
Discrete Math., Alg. and Appl., 2012

MetaCluster 5.0: a two-round binning approach for metagenomic data for low-abundance species in a noisy sample.
Bioinformatics, 2012

IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth.
Bioinformatics, 2012

Phylogenetic Tree Reconstruction with Protein Linkage.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Online Pricing for Multi-type of Items.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
A new upper bound 2.5545 on 2D Online Bin Packing.
ACM Trans. Algorithms, 2011

A clique-based algorithm for constructing feasible timetables.
Optimization Methods and Software, 2011

Online tree node assignment with resource augmentation.
J. Comb. Optim., 2011

Uniformly inserting points on square grid.
Inf. Process. Lett., 2011

Minimum Manhattan Network is NP-Complete.
Discrete & Computational Geometry, 2011

Meta-IDBA: a de Novo assembler for metagenomic data.
Bioinformatics [ISMB/ECCB], 2011

A robust and accurate binning algorithm for metagenomic sequences with arbitrary species abundance ratio.
Bioinformatics, 2011

T-IDBA: A de novo Iterative de Bruijn Graph Assembler for Transcriptome - (Extended Abstract).
Proceedings of the Research in Computational Molecular Biology, 2011

Adaptive Phenotype Testing for AND/OR Items.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Competitive Algorithms for Online Pricing.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

DMPFinder - Finding Differentiating Pathways with Gaps from Two Groups of Metabolic Networks.
Proceedings of the ISCA 3rd International Conference on Bioinformatics and Computational Biology, 2011

Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
One-Space Bounded Algorithms for Two-Dimensional Bin Packing.
Int. J. Found. Comput. Sci., 2010

Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers.
BMC Bioinformatics, 2010

A Constant-Competitive Algorithm for Online OVSF Code Assignment.
Algorithmica, 2010

Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks.
Algorithmica, 2010

IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler.
Proceedings of the Research in Computational Molecular Biology, 2010

Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

MetaCluster: unsupervised binning of environmental genomic fragments and taxonomic annotation.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

Online Uniformly Inserting Points on Grid.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.
SIAM J. Comput., 2009

Predicting Protein Complexes from PPI Data: A Core-Attachment Approach.
Journal of Computational Biology, 2009

Clustering-Based Approach for Predicting Motif Pairs from protein Interaction Data.
J. Bioinformatics and Computational Biology, 2009

A New Upper Bound on 2D Online Bin Packing
CoRR, 2009

Finding optimal threshold for correction error reads in DNA assembling.
BMC Bioinformatics, 2009

A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.
Algorithmica, 2009

1-Bounded Space Algorithms for 2-Dimensional Bin Packing.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A hybrid simulated annealing algorithm for container loading problem.
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009

Variable-Size Rectangle Covering.
Proceedings of the Combinatorial Optimization and Applications, 2009

Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers.
Proceedings of the Proceeding of the 3rd International Workshop on Data and Text Mining in Bioinformatics, 2009

2008
Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

DNA Motif Representation with Nucleotide Dependency.
IEEE/ACM Trans. Comput. Biology Bioinform., 2008

Improved on-line broadcast scheduling with deadlines.
J. Scheduling, 2008

On-line scheduling of parallel jobs on two machines.
J. Discrete Algorithms, 2008

Dynamic Offline Conflict-Free Coloring for Unit Disks.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
Approximation Algorithms for Some Optimal 2D and 3D Triangulations.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Multimedia Object Placement for Transparent Data Replication.
IEEE Trans. Parallel Distrib. Syst., 2007

Online bin packing of fragile objects with application in cellular networks.
J. Comb. Optim., 2007

Greedy online frequency allocation in cellular networks.
Inf. Process. Lett., 2007

An efficient cache replacement algorithm for multimedia object caching.
Comput. Syst. Sci. Eng., 2007

The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Online frequency allocation in cellular networks.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Watershed segmentation with boundary curvature ratio based merging criterion.
Proceedings of the Signal and Image Processing (SIP 2007), 2007

Discovering Motifs With Transcription Factor Domain Knowledge.
Proceedings of the Biocomputing 2007, 2007

Object-Based Surveillance Video Retrieval System with Real-Time Indexing Methodology.
Proceedings of the Image Analysis and Recognition, 4th International Conference, 2007

A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Online Frequency Assignment in Wireless Communication Networks.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Preface.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Online OVSF Code Assignment with Resource Augmentation.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Online competitive algorithms for maximizing weighted throughput of unit jobs.
J. Discrete Algorithms, 2006

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time.
J. Comb. Optim., 2006

Construction of the nearest neighbor embracing graph of a point set.
J. Comb. Optim., 2006

Algorithms for Challenging Motif Problems.
J. Bioinformatics and Computational Biology, 2006

A tight lower bound for job scheduling with cancellation.
Inf. Process. Lett., 2006

An efficient motif discovery algorithm with unknown motif length and number of binding sites.
IJDMB, 2006

Finding motifs from all sequences with and without binding sites.
Bioinformatics, 2006

Linear-Time Haplotype Inference on Pedigrees Without Recombinations.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Real-time Multiple Head Shape Detection and Tracking System with Decentralized Trackers.
Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), 2006

Frequency Allocation Problems for Linear Cellular Networks.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Discovering DNA Motifs with Nucleotide Dependency.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

An Efficient Algorithm for String Motif Discovery.
Proceedings of 4th Asia-Pacific Bioinformatics Conference. 13-16 February 2006, 2006

2005
Optimal methods for coordinated enroute web caching for tree networks.
ACM Trans. Internet Techn., 2005

Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees.
Trans. Computational Systems Biology, 2005

Finding Motifs with Insufficient Number of Strong Binding Sites.
Journal of Computational Biology, 2005

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.
J. Bioinformatics and Computational Biology, 2005

Online scheduling of unit jobs with bounded importance ratio.
Int. J. Found. Comput. Sci., 2005

Approximating the minimum triangulation of convex 3-polytopes with bounded degrees.
Comput. Geom., 2005

Generalized Planted (l, d)-Motif Problem with Negative Set.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Shadow detection for vehicles by locating the object-shadow boundary.
Proceedings of the Signal and Image Processing (SIP 2005), 2005

Efficient Block-based Motion Segmentation Method using Motion Vector Consistency.
Proceedings of the IAPR Conference on Machine Vision Applications (IAPR MVA 2005), 2005

Placement Solutions for Multiple Versions of A Multimedia Object.
Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), 2005

Laxity Helps in Broadcast Scheduling.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Explicit contour model for vehicle tracking with automatic hypothesis validation.
Proceedings of the 2005 International Conference on Image Processing, 2005

Cooperative Determination on Cache Replacement Candidates for Transcoding Proxy Caching.
Proceedings of the Networking and Mobile Computing, Third International Conference, 2005

k-Recombination Haplotype Inference in Pedigrees.
Proceedings of the Computational Science, 2005

Multimedia object placement for hybrid transparent data replication.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

Finding exact optimal motifs in matrix representation by partitioning.
Proceedings of the ECCB/JBI'05 Proceedings, Fourth European Conference on Computational Biology/Sixth Meeting of the Spanish Bioinformatics Network (Jornadas de BioInformática), Palacio de Congresos, Madrid, Spain, September 28, 2005

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

Voting algorithms for discovering long motifs.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Improved competitive algorithms for online scheduling with partial job values.
Theor. Comput. Sci., 2004

Approximate and dynamic rank aggregation.
Theor. Comput. Sci., 2004

A simple algorithm for the constrained sequence problems.
Inf. Process. Lett., 2004

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
Proceedings of the STACS 2004, 2004

Finding motifs for insufficient number of sequences with strong binding to transcription facto.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Progress on Maximum Weight Triangulation.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons".
Inf. Process. Lett., 2003

Transversal of disjoint convex polygons.
Inf. Process. Lett., 2003

Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
Algorithmica, 2003

Escaping a Grid by Edge-Disjoint Paths.
Algorithmica, 2003

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002
Efficient algorithm for transversal of disjoint convex polygons.
Inf. Process. Lett., 2002

Algorithms and Complexity for Tetrahedralization Detections.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Experiences in Running a Flexible, Web-Based, and Self-Paced Course.
Proceedings of the Advances in Web-Based Learning, First International Conference, 2002

2001
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.
Discrete & Computational Geometry, 2001

Approximation for minimum triangulation of convex polyhedra.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Mining Confident Rules Without Support Requirement.
Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids.
J. Algorithms, 2000

Triangulations without minimum-weight drawing.
Inf. Process. Lett., 2000

Selection and Multiselection on Multi-Dimensional Meshes.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999
Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks.
IEEE Trans. Parallel Distrib. Syst., 1999

Maximum Weight Triangulation and Graph Drawing.
Inf. Process. Lett., 1999

Finding the Medial Axis of a Simple Polygon in Linear Time.
Discrete & Computational Geometry, 1999

A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

A Faster Algorithm for Finding Disjoint Paths in Grids.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Maximum Stabbing Line in 2D Plane.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time.
SIAM J. Comput., 1998

A Polynomial Time Solution for Labeling a Rectlinear Map.
Inf. Process. Lett., 1998

Maximum Weight Triangulation and Its Application on Graph Drawing.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Interpolating Polyhedral Models Using Intrinsic Shape Parameters.
Journal of Visualization and Computer Animation, 1997

A New Subgraph of Minimum Weight Triangulations.
J. Comb. Optim., 1997

Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Algorithms for Finding Optimal Disjoint Paths Around a Rectangle.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

A Polynomial Time Solution for Labeling a Rectilinear Map.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Optimal Multiresolution Polygonal Approximation.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes.
J. Parallel Distributed Comput., 1996

Hierarchical motion estimation based on visual patterns for video coding.
Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

1995
Optimal Simulation of Full Binary Trees on Faulty Hypercubes.
IEEE Trans. Parallel Distrib. Syst., 1995

Improved and Optimal Adaptive Hierarchical Vector Quantization for Image Coding and Indexing.
Proceedings of the International Workshop on Multi-Media Database Management Systems, 1995

A microprocessor-based optical character recognition check reader.
Proceedings of the Third International Conference on Document Analysis and Recognition, 1995

Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract).
Proceedings of the Algorithms, 1995

1994
Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences.
Algorithmica, 1994

On Greedy Tetrahedralization of Points in 3D.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes.
IEEE Trans. Parallel Distrib. Syst., 1993

Optimal Resilient Distributed Algorithms for Ring Election.
IEEE Trans. Parallel Distrib. Syst., 1993

Schedulers for Larger Classes of Pinwheel Instances.
Algorithmica, 1993

Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

1992
General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction.
IEEE Trans. Computers, 1992

Optimal Generating Kernels for Image Pyramids by Piecewise Fitting.
IEEE Trans. Pattern Anal. Mach. Intell., 1992

1991
Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes.
Proceedings of the ISA '91 Algorithms, 1991

1990
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees.
SIAM J. Comput., 1990

Packing Squares into a Square.
J. Parallel Distributed Comput., 1990

1989
An Optimal EREW Parallel Algorithm for Parenthesis Matching.
Proceedings of the International Conference on Parallel Processing, 1989

1988
On Embedding Rectangular Grids in Hypercubes.
IEEE Trans. Computers, 1988

Distributed Election in Complete Networks.
Distributed Computing, 1988

1987
An Information-Based Model for Failure-Handling in Distributed Database Systems.
IEEE Trans. Software Eng., 1987

An Improved Algorithm for Finding the Median Distributively.
Algorithmica, 1987

Optimal Resilient Ring Election Algorithms.
Proceedings of the Distributed Algorithms, 1987

1986
Optimal Termination Protocols for Network Partitioning.
SIAM J. Comput., 1986

Security problems on inference control for SUM, MAX, and MIN queries.
J. ACM, 1986

1985
A unifying approach for a class of problems in the computational geometry of polygons.
The Visual Computer, 1985

A Near-optimal Algorithm for Finding the Median Distributively.
Proceedings of the 5th International Conference on Distributed Computing Systems, 1985

An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
Efficient Inference Control for Range SUM Queries.
Theor. Comput. Sci., 1984

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems.
SIAM J. Comput., 1984

Minimum Vertex Distance Between Separable Convex Polygons.
Inf. Process. Lett., 1984

1983
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons.
IEEE Trans. Computers, 1983

A General Program Scheme for Finding Bridges.
Inf. Process. Lett., 1983

Optimal Termination Prococols for Network Partitioning.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1982
Enhancing the Security of Statistical Databases with a Question-Answering System and a Kernel Design.
IEEE Trans. Software Eng., 1982

Auditing and Inference Control in Statistical Databases.
IEEE Trans. Software Eng., 1982

Scheduling the Open Shop to Minimize Mean Flow Time.
SIAM J. Comput., 1982

Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems.
Math. Oper. Res., 1982

Efficient Parallel Algorithms for Some Graph Problems.
Commun. ACM, 1982

1981
Statistical Database Design.
ACM Trans. Database Syst., 1981

On J-maximal and J-minimal Flow-Shop Schedules.
J. ACM, 1981

Bounds on Schedules for Independent Tasks with Similar Execution Times.
J. ACM, 1981

Efficient Inference Control for Range SUM Queries on Statistical Data Bases.
Proceedings of the First LBL Workshop on Statistical Database Management, 1981

Auditing for secure statistical databases.
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1980
Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops).
IEEE Trans. Computers, 1980

1978
Security in Statistical Databases for Queries with Small Counts.
ACM Trans. Database Syst., 1978

Algorithms for Updating Minimal Spanning Trees.
J. Comput. Syst. Sci., 1978

An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products.
Commun. ACM, 1978

1977
The Partial Fraction Expansion Problem and Its Inverse.
SIAM J. Comput., 1977

A Fast Error Evaluation Algorithm for Polynomial Approximation.
Inf. Process. Lett., 1977

A Study on the Protection of Statistical Data Bases.
Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, 1977

1976
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation.
SIAM J. Comput., 1976


  Loading...