Journals starting with ipl_

IPL( Vol No. ) * *Information Processing Letters

IPL(1) * Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set, An
* Note on Scattered Context Grammars, A

IPL(10) * Further comments on Bykat's Convex Hull Algorithm
* On the O(n log n) Lower Bound for Convex Hull and Maximal Vector Determination

IPL(11) * Comments on a Lower Bound for Convex Hull Determination
* Note on Finding Convex Hulls via Maximal Vectors, A

IPL(14) * New Hierarchy of Two-Dimensional Array Languages, A
* Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems

IPL(15) * Drawing Straight Lines with a Pyramid Cellular Automaton
* Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane

IPL(16) * Decision Procedure for Optimal Polyhedron Partitioning, A
* Improved Algorithm for the Fixed-Radius Neighbor Problem, An
* Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons, A
* On Computing All North-East Nearest Neighbors in the L1 Metric
* On Computing Approximate Convex Hulls

IPL(17) * Two Pyramid Machine Algorithms for Edge Detection in Noisy Binary Images

IPL(18) * Analytical Comparison of Two String Searching Algorithms, An
* Experiments with a Fast String Searching Algorithm

IPL(2) * On the Identification of the Convex Hull of a Finite Set of Points in the Plane

IPL(20) * Parallel Median Algorithm, A

IPL(3) * Analysis of Range Searches in Quad Trees

IPL(4) * Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques

IPL(45) * O(log n) Parallel Algorithm for the Minimum Spanning Tree, An
* Parallelizing Mallat Algorithm for 2-D Wavelet Transforms

IPL(6) * Two-Dimensional Pattern Matching

IPL(63) * Approximation Algorithm for Least Median of Squares Regression, An

IPL(7) * Convex Hull of a Finite Set of Points in Two Dimensions
* Fast Convex Hull Algorithm, A
* Improved Algorithm to Check for Polygon Similarity, An
* More Efficient Convex Hull Algorithm, A
* Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set, A

IPL(8) * Comments on Convex Hull of a Finite Set of Points in Two Dimensions
* Two Remarks on a Convex Hull Algorithm

IPL(9) * Another Efficient Algorithm for Convex Hulls in Two Dimensions
* Linear Algorithm for Finding the Convex Hull of a Simple Polygon, A
* Neither the Greedy nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation

Index for "i"


Last update:10-Aug-19 15:50:48
Use price@usc.edu for comments.