Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Purdue University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2401 - 2430 of 2813

Full-Text Articles in Physical Sciences and Mathematics

Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico Oct 1985

Improving The Worst Case Performance Of The Hunt-Szymanski Strategy For The Longest Common Subsequence Of Two Strings, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.


Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel Oct 1985

Robust Transmission Of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico, Aviezri S. Fraenkel

Department of Computer Science Technical Reports

No abstract provided.


The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra Oct 1985

The Longest Common Subsequence Problem Revisited, A. Apostolico, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.


The Myriad Virtues Of Subword Trees, Alberto Apostolico Oct 1985

The Myriad Virtues Of Subword Trees, Alberto Apostolico

Department of Computer Science Technical Reports

No abstract provided.


A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra Oct 1985

A Fast Linear Space Algorithm For Computing Longest Common Subsequences, A. Apostolio, C. Guerra

Department of Computer Science Technical Reports

No abstract provided.


Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata Oct 1985

Data Structures And Algorithms For The String Statistics Problem, A. Apostolico, F. P. Preparata

Department of Computer Science Technical Reports

No abstract provided.


The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo Oct 1985

The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao, Raffaele Giancarlo

Department of Computer Science Technical Reports

No abstract provided.


Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap Oct 1985

Fast Parallel Algorithms For Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, Chee Yap

Department of Computer Science Technical Reports

No abstract provided.


Adaptive Tensor Product Grids For Singular Problems, John R. Rice Oct 1985

Adaptive Tensor Product Grids For Singular Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Efficient Algorithms For Common Transversals, Mikhail J. Atallah, Chanderjit Bajaj Oct 1985

Efficient Algorithms For Common Transversals, Mikhail J. Atallah, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


The Aspect Ratio Significant For Finite Element Problems, John R. Rice Sep 1985

The Aspect Ratio Significant For Finite Element Problems, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah Aug 1985

Order Statistics And Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Using Supercomputers Today And Tomorrow, John R. Rice Aug 1985

Using Supercomputers Today And Tomorrow, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


An Efficient Parallel Solution For Euclidean Shortest Paths In Three Dimensions, Chanderjit Bajaj Aug 1985

An Efficient Parallel Solution For Euclidean Shortest Paths In Three Dimensions, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich Aug 1985

An Optimal Parallel Algorithm For The All Nearest -- Neighbor Problem For A Convex Polygon, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.


On Multidimensional Arrays Of Processors, Mikhail J. Atallah Jul 1985

On Multidimensional Arrays Of Processors, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


A Distributed Shortest Path Algorithm For A Planar Network, Greg N. Frederickson Jul 1985

A Distributed Shortest Path Algorithm For A Planar Network, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.


Generalized Unfoldings For Shortest Paths In Euclidean 3-Space, C. Bajaj, T. T. Moh Jul 1985

Generalized Unfoldings For Shortest Paths In Euclidean 3-Space, C. Bajaj, T. T. Moh

Department of Computer Science Technical Reports

No abstract provided.


Eliminating Proofs Of Interference-Freedom From Levin-Gries Csp Program Proofs, Thomas P. Murtagh Jul 1985

Eliminating Proofs Of Interference-Freedom From Levin-Gries Csp Program Proofs, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.


Display Oriented Front End Interfaces, Balachander Krishnamurthy, Francie J. Newbery, Craig E. Wills Jul 1985

Display Oriented Front End Interfaces, Balachander Krishnamurthy, Francie J. Newbery, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.


The Algebraic Complexity Of Shortest Paths In Polyhedral Spaces, Chanderjit Bajaj Jun 1985

The Algebraic Complexity Of Shortest Paths In Polyhedral Spaces, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.


Least Squares Approximation By One-Pass Methods With Piecewise Polynomials, Fujiichi Yoshimoto Jun 1985

Least Squares Approximation By One-Pass Methods With Piecewise Polynomials, Fujiichi Yoshimoto

Department of Computer Science Technical Reports

No abstract provided.


Multidimensional Timestamp Protocols For Concurrency Control, Pei-Jyun Leu, Bharat Bhargava May 1985

Multidimensional Timestamp Protocols For Concurrency Control, Pei-Jyun Leu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Representing Graph Families With Edge Grammars, Francine Berman, Gregory Shannon May 1985

Representing Graph Families With Edge Grammars, Francine Berman, Gregory Shannon

Department of Computer Science Technical Reports

No abstract provided.


Solving Tree Problems On A Mesh-Connected Processor Array, Mikhail J. Atallah, Susanne E. Hambrusch May 1985

Solving Tree Problems On A Mesh-Connected Processor Array, Mikhail J. Atallah, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.


Finding A Minimum Independent Dominating Set In A Permutation Graph, Mikhail J. Atallah, Glenn Manacher, J. Urritia Apr 1985

Finding A Minimum Independent Dominating Set In A Permutation Graph, Mikhail J. Atallah, Glenn Manacher, J. Urritia

Department of Computer Science Technical Reports

No abstract provided.


Some Thoughts On A Uniform Generic Command Interface, Balachander Krishnamurthy Apr 1985

Some Thoughts On A Uniform Generic Command Interface, Balachander Krishnamurthy

Department of Computer Science Technical Reports

No abstract provided.


Performance Analysis Of Network File Systems, Walter F. Tichy, Zuwang Ruan Apr 1985

Performance Analysis Of Network File Systems, Walter F. Tichy, Zuwang Ruan

Department of Computer Science Technical Reports

No abstract provided.


Electing A Leader In A Synchronous Ring, Greg N. Frederickson, Nancy A. Lynch Apr 1985

Electing A Leader In A Synchronous Ring, Greg N. Frederickson, Nancy A. Lynch

Department of Computer Science Technical Reports

No abstract provided.


A Survey Of Program Design Languages (Pdls), Brian A. Nejmeh, Herbert E. Dunsmore Apr 1985

A Survey Of Program Design Languages (Pdls), Brian A. Nejmeh, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.