Tao Jiang

According to our database1, Tao Jiang authored at least 215 papers between 1987 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
NeoDTI: neural integration of neighbor information from a heterogeneous network for discovering new drug-target interactions.
Bioinformatics, 2019

DeepIsoFun: a deep domain adaptation approach to predict isoform functions.
Bioinformatics, 2019

DeepHINT: understanding HIV-1 integration via deep learning with attention.
Bioinformatics, 2019

DIFFUSE: predicting isoform functions from sequences and expression profiles via deep learning.
Bioinformatics, 2019

OMGS: Optical Map-Based Genome Scaffolding.
Proceedings of the Research in Computational Molecular Biology, 2019

2018
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
Algorithmica, 2018

2017
TITER: predicting translation initiation sites by deep learning.
Bioinformatics, 2017

ROSE: A Deep Learning Based Framework for Predicting Ribosome Stalling.
Proceedings of the Research in Computational Molecular Biology, 2017

2016
SDEAP: a splice graph based differential transcript expression analysis tool for population data.
Bioinformatics, 2016

H-PoP and H-PoPG: heuristic partitioning algorithms for single individual haplotyping of polyploids.
Bioinformatics, 2016

2015
Uniformly asymptotic behavior of ruin probabilities in a time-dependent renewal risk model with stochastic return.
J. Computational Applied Mathematics, 2015

Accurate inference of isoforms from multiple sample RNA-Seq data.
BMC Genomics, 2015

Differential regulation enrichment analysis via the integration of transcriptional regulatory network and gene expression data.
Bioinformatics, 2015

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Phylogeny-based classification of microbial communities.
Bioinformatics, 2014

AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references.
Bioinformatics, 2014

GDNorm: An Improved Poisson Regression Model for Reducing Biases in Hi-C Data.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

Formal Models and Computability.
Proceedings of the Computing Handbook, 2014

2013
BRANCH: boosting RNA-Seq assemblies with partial or related genomic sequences.
Bioinformatics, 2013

Differential gene expression analysis using coexpression and RNA-Seq data.
Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

2012
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012

A fast and accurate algorithm for single individual haplotyping.
BMC Systems Biology, 2012

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.
BMC Bioinformatics, 2012

Detecting genome-wide epistases based on the clustering of relatively frequent items.
Bioinformatics, 2012

Transcriptome assembly and isoform expression level estimation from biased RNA-Seq reads.
Bioinformatics, 2012

Separating metagenomic short reads into genomes via clustering.
Algorithms for Molecular Biology, 2012

An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants.
Algorithmica, 2012

A Probabilistic Approach to Accurate Abundance-Based Binning of Metagenomic Reads.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Workshop: Transcriptome assembly and isoform expression level estimation from biased RNA-Seq reads.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

2011
A Max-Flow-Based Approach to the Identification of Protein Complexes Using Protein Interaction and Microarray Data.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly.
Journal of Computational Biology, 2011

Inferring Haplotypes from genotypes on a Pedigree with mutations, genotyping Errors and Missing Alleles.
J. Bioinformatics and Computational Biology, 2011

Improving Probe Set Selection for Microbial Community Analysis by Leveraging Taxonomic Information of Training Sequences.
BMC Bioinformatics, 2011

Uncover disease genes by maximizing information flow in the phenome-interactome network.
Bioinformatics [ISMB/ECCB], 2011

SEED: efficient clustering of next-generation sequences.
Bioinformatics, 2011

Separating Metagenomic Short Reads into Genomes via Clustering - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly - (Extended Abstract).
Proceedings of the Research in Computational Molecular Biology, 2011

Workshop: Transcriptome assembly from RNA-Seq data: Objectives, algorithms and challenges.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010
Beyond evolutionary trees.
Natural Computing, 2010

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops.
J. Comb. Optim., 2010

Efficient Genome-Wide TagSNP Selection Across Populations via the Linkage Disequilibrium Criterion.
Journal of Computational Biology, 2010

Computational prediction of type III secreted proteins from gram-negative bacteria.
BMC Bioinformatics, 2010

Accurate HLA type inference using a weighted similarity graph.
BMC Bioinformatics, 2010

MSOAR 2.0: Incorporating tandem duplications into ortholog assignment based on genome rearrangement.
BMC Bioinformatics, 2010

Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing.
Bioinformatics, 2010

Haplotype Inference on Pedigrees with Recombinations and Mutations.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Inference of Isoforms from Short Sequence Reads.
Proceedings of the Research in Computational Molecular Biology, 2010

Polony Identification Using the EM Algorithm Based on a Gaussian Mixture Model.
Proceedings of the 10th IEEE International Conference on Bioinformatics and Bioengineering, 2010

2009
Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations.
SIAM J. Comput., 2009

Preface.
J. Comput. Sci. Technol., 2009

Some Algorithmic Challenges in Genome-Wide Ortholog Assignment.
J. Comput. Sci. Technol., 2009

Computational prediction of novel non-coding RNAs in Arabidopsis thaliana.
BMC Bioinformatics, 2009

An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract).
Proceedings of the Algorithms, 2009

Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Nearest Neighbor Interchange and Related Distances.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximate clustering of incomplete fingerprints.
J. Discrete Algorithms, 2008

On the Approximation of Correlation Clustering and Consensus Clustering.
J. Comput. Syst. Sci., 2008

An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background.
Journal of Computational Biology, 2008

A Survey on Haplotyping Algorithms for Tightly Linked Markers.
J. Bioinformatics and Computational Biology, 2008

Clustering of Main orthologs for Multiple genomes.
J. Bioinformatics and Computational Biology, 2008

W-AlignACE: an improved Gibbs sampling algorithm based on more accurate position weight matrices learned from sequence and gene expression/ChIP-chip data.
Bioinformatics, 2008

ChemmineR: a compound mining framework for R.
Bioinformatics, 2008

A maximum common substructure-based algorithm for searching and predicting drug-like compounds.
Proceedings of the Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2008

Finding Additive Biclusters with Random Background.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Complexity and approximation of the minimum recombinant haplotype configuration problem.
Theor. Comput. Sci., 2007

MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement.
Journal of Computational Biology, 2007

Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility.
Inf. Process. Lett., 2007

Study of gene function based on spatial co-expression in a high-resolution mouse brain atlas.
BMC Systems Biology, 2007

Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Computing the Breakpoint Distance between Partially Ordered Genomes.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
A network flow approach to the Minimum Common Integer Partition Problem.
Theor. Comput. Sci., 2006

A General Framework for Biclustering Gene Expression Data.
J. Bioinformatics and Computational Biology, 2006

OligoSpawn: a software tool for the design of overgo probes from large unigene datasets.
BMC Bioinformatics, 2006

A Parsimony Approach to Genome-Wide Ortholog Assignment.
Proceedings of the Research in Computational Molecular Biology, 2006

Understanding microbial genomic structures and applications to biological pathway inference.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

On the Minimum Common Integer Partition Problem.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
Assignment of Orthologous Genes via Genome Rearrangement.
IEEE/ACM Trans. Comput. Biology Bioinform., 2005

Exponential companding technique for PAPR reduction in OFDM systems.
TBC, 2005

Computing the Minimum Recombinant Haplotype Configuration from Incomplete Genotype Data on a Pedigree by Integer Linear Programming.
Journal of Computational Biology, 2005

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.
Journal of Computational Biology, 2005

A software system for gene sequence database construction based on fast approximate string matching.
IJBRA, 2005

Haplotype-based linkage disequilibrium mapping via direct data mining.
Bioinformatics, 2005

Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Correlation Clustering and Consensus Clustering.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Companding technique for PAPR reduction in OFDM systems based on an exponential function.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

Robust and Accurate Cancer Classification with Gene Expression Profiling.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, 2005

A Fast Algorithm for Approximate String Matching on Gene Sequences.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Approximate Clustering of Fingerprint Vectors with Missing Values.
Proceedings of the Theory of Computing 2005, 2005

Computing the Assignment of Orthologous Genes via Genome Rearrangement.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

The Regularized EM Algorithm.
Proceedings of the Proceedings, 2005

2004
Foreword - Special Issue on Bioinformatics.
J. Comput. Sci. Technol., 2004

A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition.
J. Comb. Optim., 2004

Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme.
J. Algorithms, 2004

A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Computational Construction of Nitrogen Assimilation Pathway in Cyanobacteria Synechococcus sp. WH8102.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Minimum Entropy Clustering and Applications to Gene Expression Analysis.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

2003
Approximation algorithms for NMR spectral peak assignment.
Theor. Comput. Sci., 2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Scheduling, 2003

Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering.
J. Bioinformatics and Computational Biology, 2003

Efficient Inference of Haplotypes from Genotypes on a Pedigree.
J. Bioinformatics and Computational Biology, 2003

MAVG: locating non-overlapping maximum average segments in a given sequence.
Bioinformatics, 2003

Minimum Recombiant Haplotype Configuration on Tree Pedigrees.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Efficient rule-based haplotyping algorithms for pedigree data.
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

Efficient and Robust Feature Extraction by Maximum Margin Criterion.
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Statistical Validation of Compound Structure-Selectivity Relationship Using NCI Cancer Database.
Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2003

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.
Proceedings of the Algorithms, 2003

Computational Inference of Regulatory Pathways in Microbes.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

Efficient Selection of Unique and Popular Oligos for Large EST Databases.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
The average-case area of Heilbronn-type triangles.
Random Struct. Algorithms, 2002

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
J. Comput. Syst. Sci., 2002

A General Edit Distance between RNA Structures.
Journal of Computational Biology, 2002

Automated assignment of backbone NMR peaks using constrained bipartite matching.
Computing in Science and Engineering, 2002

Improved Approximation Algorithms for NMR Spectral Peak Assignment.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Approximating minimum quartet inconsistency (abstract).
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Identifying transcription factor binding sites through Markov chain optimization.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks.
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

2001
Computing Phylogenetic Roots with Bounded Degrees and Errors.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Probe selection algorithms with applications in the analysis of microbial communities.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

An efficient algorithm for finding short approximate non-tandem repeats.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
New applications of the incompressibility method: Part II.
Theor. Comput. Sci., 2000

A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application.
SIAM J. Comput., 2000

Optimal Information Gathering on the Internet with Time and Cost Constraints.
SIAM J. Comput., 2000

Average-Case Analysis of Algorithms Using Kolmogorov Complexity.
J. Comput. Sci. Technol., 2000

Some Open Problems in Computational Molecular Biology.
J. Algorithms, 2000

A lower bound on the average-case complexity of shellsort.
J. ACM, 2000

The Incompressibility Method.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Phylogenetic k-Root and Steiner k-Root.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

The Longest Common Subsequence Problem for Arc-Annotated Sequences.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Some open problems in computational molecular biology.
SIGACT News, 1999

Aligning DNA Sequences to Minimize the Change in Protein.
J. Comb. Optim., 1999

New Applications of the Incompressibility Method.
Comput. J., 1999

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.
Algorithmica, 1999

Recovering Branches on the Tree of Life: An Approximation Algorithm.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Average-Case Complexity of Shellsort.
Proceedings of the Automata, 1999

New Applications of the Incompressibility Method.
Proceedings of the Automata, 1999

Quartet Cleaning: Improved Algorithms and Simulations.
Proceedings of the Algorithms, 1999

On computing the nearest neighbor interchange distance.
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

The Expected Size of Heilbronn's Triangles.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

Some Examples of Average-case Analysis by the Imcompressibility Method.
Proceedings of the Jewels are Forever, 1999

1998
Mapping Clones with a Given Ordering or Interleaving.
Algorithmica, 1998

Constructing maps using the span and inclusion relations.
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

Orchestrating Quartets: Approximation and Data Correction.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Aligning DNA Sequences to Minimize the Change in Protein (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Rotations of Periodic Strings and Short Superstrings.
J. Algorithms, 1997

Erratum: "Two heads are better that two tapes".
J. ACM, 1997

Mapping Clones with a Given Ordering or Interleaving (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

On Distances between Phylogenetic Trees (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

A more efficient approximation scheme for tree alignment.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Mapping clones with a given ordering or interleaving (abstract).
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

An algorithmic approach to multiple complete digest mapping.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

On the complexity and approximation of syntenic distance.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Shortest common superstrings.
Proceedings of the Pattern Matching Algorithms, 1997

Formal Models and Computability.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
An approximation scheme for some Steiner tree problems in the plane.
Networks, 1996

DNA Sequencing and String Learning.
Mathematical Systems Theory, 1996

Lower Bounds on Learning Decision Lists and Trees.
Inf. Comput., 1996

On the Complexity of Comparing Evolutionary Trees.
Discrete Applied Mathematics, 1996

Approximation Algorithms for Tree Alignment with a Given Phylogeny.
Algorithmica, 1996

Efficient Information Gathering on the Internet (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Shortest Consistent Superstrings Computable in Polynomial Time.
Theor. Comput. Sci., 1995

New Decidability Results Concerning Two-Way Counter Machines.
SIAM J. Comput., 1995

Decision Problems for Patterns.
J. Comput. Syst. Sci., 1995

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).
Proceedings of the STACS 95, 1995

On the Complexity of Comparing Evolutionary Trees (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994
Approximating Shortest Superstrings with Constraints.
Theor. Comput. Sci., 1994

Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata.
Theor. Comput. Sci., 1994

On the Complexity of Multiple Sequence Alignment.
Journal of Computational Biology, 1994

Linear Approximation of Shortest Superstrings.
J. ACM, 1994

Some MAX SNP-Hard Results Concerning Unordered Labeled Trees.
Inf. Process. Lett., 1994

Two heads are better than two tapes.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Aligning sequences via an evolutionary tree: complexity and approximation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

An Approximation Scheme for Some Steiner Tree Problems in the Plane.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Alignment of Trees - An Alternative to Tree Edit.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

On Some Open Problems Concerning the Complexity of Cellular Arrays.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
On Efficient Parallel Algorithms for Solving Set Recurrence Equations.
J. Algorithms, 1993

Approximating Shortest Superstrings with Constraints (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

k one-way heads cannot do string-matching.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages.
Proceedings of the STACS 93, 1993

Inclusion is Undecidable for Pattern Languages.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

New Decidability Results Concerning Two-way Counter Machines and Applications.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
The Synchronization of Nonuniform Networks of Finite Automata
Inf. Comput., April, 1992

A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars.
Theor. Comput. Sci., 1992

A hierarchy result for 2-dimensional TM's operating in small space.
Inf. Sci., 1992

A Note on Shortest Superstrings with Flipping.
Inf. Process. Lett., 1992

1991
Some Classes of Languages in NC¹
Inf. Comput., January, 1991

The Power of Alternating One-Reversal Counters and Stacks.
SIAM J. Comput., 1991

A Note on the Space Complexity of Some Decision Problems for Finite Automata.
Inf. Process. Lett., 1991

Linear Approximation of Shortest Superstrings
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Minimal NFA Problems Are Hard.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

The Structure and Complexity of Minimal NFA's over a Unary Alphabet.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

On the Complexity of Learning Strings and Sequences.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990
Systolic algorithms for some scheduling and graph problems.
VLSI Signal Processing, 1990

On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals.
Theor. Comput. Sci., 1990

Efficient parallel algorithms for solving set recurrence equations and applications.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

String Editing on a One-Way Linear Array of Finite-State Machines.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

On the Complexity of (Off-Line) 1-Tape ATM's Running in Constant Reversals.
Proceedings of the Advances in Computing and Information, 1990

1989
On Iterative and Cellular Tree Arrays.
J. Comput. Syst. Sci., 1989

Optimal Simulation of Tree Arrays by Linear Arrays.
Inf. Process. Lett., 1989

Parallel Parsing on a One-way Linear Array of Finite-State Machines.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

The Synchronization of Nonuniform Networks of Finite Automata (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Relating the Power of Cellular Arrays to Their Closure Properties.
Theor. Comput. Sci., 1988

Some Subclasses of Context-Free Languages In NC1.
Inf. Process. Lett., 1988

Learning Regular Languages From Counterexamples.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Trading reversals for alternation.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

On Some Languages in NC.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
On One-Way Cellular Arrays.
SIAM J. Comput., 1987

On the Computing Power of One-Way Cellular Arrays.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987


  Loading...