2003-11-20 Modal Functions for Concise Definition of State Machines and Products. 65-72 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Yodaiken91 2003-11-20 Scalable and Predictable Performance for Irregular Problems Using the WPRAM Computational Model. 237-246 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Nash98 http://dx.doi.org/10.1016/S0020-0190(98)00060-X 2003-11-24 Special Subgraphs of Weighted Visibility Graphs. 69-75 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#HsuLC92 2003-11-20 Improvements of generalization of threshold signature and authenticated encryption for group communications. 41-45 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#HsuWW02 http://dx.doi.org/10.1016/S0020-0190(01)00189-2 2003-11-25 Estimating the result size of a query to velocity skewed moving objects. 279-285 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#ChoiPC03 2003-11-20 Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. 187-191 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#NgCY02 http://dx.doi.org/10.1016/S0020-0190(01)00274-5 2003-11-20 Comparison of two code scalability tests. 169-174 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Lyon02 http://dx.doi.org/10.1016/S0020-0190(01)00204-6 2003-11-20 Batch Scheduling from Short Lists. 57-59 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Lyon79 2003-11-20 A Tagless Marking That is Linear Over Subtrees. 23-28 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Lyon88 2003-11-20 On Improving Dependency Implication Algorithms. 135-141 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#MokE97 http://dx.doi.org/10.1016/S0020-0190(97)00158-0 2005-11-15 An Optimal Algorithm to Compute all the Covers of a String. 239-246 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#MooreS94 2005-11-15 A Correction to ``An Optimal Algorithm to Compute all the Covers of a String''. 101-103 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#MooreS95 http://dx.doi.org/10.1016/0020-0190(94)00235-Q 2003-11-20 A div(n) Depth Bollean Circuit for Smooth Modular Inverse. 153-156 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Mnuk91 2003-11-20 Cost-Minimal Preemptive Scheduling of Independent Jobs With Release and Due Dates on Open Shop Under Resource Constraints. 233-237 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Slowinski79 2003-11-20 A Fast and Effective Heuristic for the Feedback Arc Set Problem. 319-323 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#EadesLS93 2003-11-20 Improved Lower Bounds for Some Matrix Multiplication Problems. 123-127 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#JaJaT85 2003-11-20 Inductive Data Types for Predicate Transformers. 113-117 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Moor92 2003-11-20 Statistical delay analysis on an ATM switch with self-similar input traffic. 163-173 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#NgSZ00 http://dx.doi.org/10.1016/S0020-0190(00)00043-0 2003-11-20 The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. 97-103 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#EadesSW96 http://dx.doi.org/10.1016/S0020-0190(96)00133-0 2003-11-20 On the Arithmetic Complexity of Matrix Kronecker Powers. 145-148 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#SeroussiM83 2003-11-20 Untiming Timed Languages. 129-135 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Berard95 http://dx.doi.org/10.1016/0020-0190(95)00077-P 2003-11-20 On a Hierarchy of Classes for Nested Databases. 259-266 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#GyssensPG90 2005-05-04 An Approximate Model of Processor Communication Rings Under Heavy Load. 61-67 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#CoffmanFGG97 http://dx.doi.org/10.1016/S0020-0190(97)00159-2 2003-11-20 From the Editors of this special issue. 49-51 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#AlmstrumG01 http://dx.doi.org/10.1016/S0020-0190(00)00217-9 2003-11-20 Strictness Analysis Aids Inductive Proofs. 155-159 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Launchbury90 2003-11-20 An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time. 207-212 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Zippel89 2003-11-20 Zero Testing of Algebraic Functions. 63-67 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Zippel97 http://dx.doi.org/10.1016/S0020-0190(96)00207-4 2003-11-20 Hyperspherical Neighbourhoods and Pattern Recognition Using Neural Networks. 223-228 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#AthithanR96 http://dx.doi.org/10.1016/0020-0190(96)00086-5 2003-11-20 A New Algorithm for Parallel Solution of Linear Equations. 407-412 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Sridhar87 2003-11-20 On the Connectivity of the De Bruijn Graph. 315-318 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Sridhar88 2003-11-20 An Algorithm for Inverting a Permutation. 237-238 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Huang81 2003-11-20 A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function. 319-321 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Huang88 2003-11-20 Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. 275 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Francez90a 2003-11-20 On the Non-Compactness of the Class of Program Schemas. 141-142 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#FrancezS73 2003-11-20 Adding State Merging to the DMC Data Compression Algorithm. 223-228 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Young-Lai99 http://dx.doi.org/10.1016/S0020-0190(99)00066-6 2003-11-20 The Weakest Deadlock-Preserving Congruence. 341-346 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Valmari95 http://dx.doi.org/10.1016/0020-0190(94)00214-J 2003-11-20 On Finding Solutions for Extended Horn Formulas. 133-137 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#SchlipfAFS95 http://dx.doi.org/10.1016/0020-0190(95)00019-9 2003-11-20 Multisymbol Majority Vote and Hard Core. 285-292 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#OgataSK96 http://dx.doi.org/10.1016/0020-0190(96)00058-0 2003-11-20 Safety and Liveness of omega-Context-Free Languages. 13-20 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#ChaudhuriL91 2003-11-20 Details of Distortions in the Computed Fourier Transforms of Signals - Part I: Short Periodic Signals. 111-113 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Njau85 2003-11-20 Ear Decomposition with Bounds on Ear Length. 245-249 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Franzblau99 http://dx.doi.org/10.1016/S0020-0190(99)00067-8 2003-11-20 A Truncation Technique for Clausal Analytic Tableaux. 271-281 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#WrightsonC92 2003-11-20 An efficient automata approach to some problems on context-free grammars. 221-227 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#BouajjaniEFMRWW00 http://dx.doi.org/10.1016/S0020-0190(00)00055-7 2003-11-20 More on Looping vs. Repeating in Dynamic Logic. 87-90 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#HarelP85 2003-11-20 Accuracy of Approximating Queueing Network Departure Processes With Independent Renewal Processes. 43-48 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Lester83 2003-11-20 A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs. 297-300 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Gawiejnowicz96 http://dx.doi.org/10.1016/0020-0190(96)00021-X 2003-11-20 A Simple Approach to Implementing Multiplication with Small Tables. 327-329 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#WangCC91 2003-11-20 Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. 187-192 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#WangCL90 2003-11-20 An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs. 83-87 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#WangCL95 http://dx.doi.org/10.1016/0020-0190(95)00125-V 2003-11-20 The Economics of Large-Memory Computations. 263-268 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Thomborson98 http://dx.doi.org/10.1016/S0020-0190(98)00063-5 2003-11-20 Triangulations without minimum-weight drawing. 183-189 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#WangCY00 http://dx.doi.org/10.1016/S0020-0190(00)00067-3 2003-11-20 Maximum Weight Triangulation and Graph Drawing. 17-22 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#WangCY99 http://dx.doi.org/10.1016/S0020-0190(99)00037-X 2003-11-20 General Algorithms for the Address Calculation of Lexicographically Ordered Tuples. 113-116 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#KothariR85 2003-11-20 Erratum: Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages. 90 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#WangG76a 2003-11-20 A Unified Algorithm for Sorting on Multidimensional Mesh-Connected Processors. 225-231 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#CorbettS91 2003-11-20 Optimal 1-Hamiltonian Graphs. 157-161 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#WangHH98 http://dx.doi.org/10.1016/S0020-0190(98)00004-0 2003-11-20 The Reachability Problem for Finite Cellular Automata. 27-31 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#ClementiI95 http://dx.doi.org/10.1016/0020-0190(94)00169-Y 2003-11-20 Comments on Two Group Signatures. 95-97 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#WangHL99 http://dx.doi.org/10.1016/S0020-0190(98)00198-7 2003-11-20 Miller's Primality Test. 86-88 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Lenstra79 2003-11-20 Faithful 1-Edge Fault Tolerant Graphs. 173-181 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#WangHS97 http://dx.doi.org/10.1016/S0020-0190(97)00003-3 2003-11-20 Literal Shuffle on omega-Languages. 165-168 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#MoriyaY96 http://dx.doi.org/10.1016/0020-0190(96)00091-9 2003-11-20 On Process Assignment in Parallel Computing. 31-34 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#BurtonMR88 2003-11-20 Consistent Global Checkpoints Based on Direct Dependency Tracking. 223-230 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#WangLF94 2003-11-20 Randomized splay trees: Theoretical and experimental results. 213-221 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#AlbersK02 http://dx.doi.org/10.1016/S0020-0190(01)00230-7 2003-11-20 Revisiting the Counter Algorithms for List Update. 155-160 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#AlbersM97 http://dx.doi.org/10.1016/S0020-0190(97)00160-9 2003-11-20 The Class of Context-Free Languages is not an E0L Family. 190-195 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#AlbertM77 2003-11-20 On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems. 317-322 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Zissimopoulos95 http://dx.doi.org/10.1016/0020-0190(95)00051-D 2003-11-20 Pancyclicity in switching classes. 153-156 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#EhrenfeuchtHHR00 http://dx.doi.org/10.1016/S0020-0190(00)00020-X 2003-11-20 Message Terminating Algorithms for Anonymous Rings of Unknown Size. 111-119 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#CidonS95 http://dx.doi.org/10.1016/0020-0190(94)00237-S 2003-11-20 The expected complexity of Prim's minimum spanning tree algorithm. 197-201 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Martel02 http://dx.doi.org/10.1016/S0020-0190(01)00220-4 2003-11-20 Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set. 81-85 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Martel86 2003-11-20 Self-Adjusting Multi-Way Search Trees. 135-141 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Martel91 2003-11-20 Maximum Finding on a Multiple Access Broadcast Network. 7-15 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Martel94 2003-11-20 Towards an energy complexity of computation. 181-187 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Martin01 http://dx.doi.org/10.1016/S0020-0190(00)00214-3 2003-11-20 Precise Typing and Filters. 109-112 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Martin83 2003-11-20 The Probe: An Addition to Communication Primitives. 125-130 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Martin85 2003-11-20 A New Generalization of Dekker's Algorithm for Mutual Exclusion. 295-297 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Martin86 2003-11-20 Extension Functions for Multiset Orderings. 181-186 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Martin87 2003-11-20 A Note on Division Orderings on Strings. 237-240 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Martin90 2003-11-20 Estimating the number of vertices of a polyhedron. 137-143 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#AvisD00 http://dx.doi.org/10.1016/S0020-0190(00)00011-9 2003-11-20 A Fast Algorithm for String Matching with Mismatches. 105-110 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Dermouche95 http://dx.doi.org/10.1016/0020-0190(95)00043-C 2005-06-06 Parallel Algorithms for Gossiping by Mail. 197-202 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#BagchiHMS90 2003-11-20 On Helping by Parity-Like Languages. 41-43 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Ogihara95 http://dx.doi.org/10.1016/0020-0190(94)00232-N 2003-11-20 Functions Computable with Limited Access to NP. 35-38 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Ogihara96 http://dx.doi.org/10.1016/0020-0190(96)00030-0 2003-11-20 On the Completeness of Modular Proof Systems. 195-201 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Ramesh90 2003-11-20 Consecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and Their Storage Space Requirements. 211-217 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Hoopen80 2005-08-01 On the equivalence and range of applicability of graph-based representations of logic programs. 241-249 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00290-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#CostantiniDP02 2003-11-20 Declustering signature files based on a dynamic measure. 235-241 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#ImKKY00 http://dx.doi.org/10.1016/S0020-0190(00)00059-4 2003-11-20 Linear Speed-Up Does not Hold on Turing Machines with Tree Storages. 313-318 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Huhne93 2003-11-20 A Dynamic Fault-Tolerant Message Routing Algorithm for Double-Loop Networks. 259-264 1999 70 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#ChouGW99 http://dx.doi.org/10.1016/S0020-0190(99)00072-1 2003-11-20 Symbolic Verification Method for Definite Iteration over Data Structures. 207-213 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Nepomniaschy99 http://dx.doi.org/10.1016/S0020-0190(99)00009-5 2003-11-20 Annotation inference for modular checkers. 97-108 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#FlanaganJL01 http://dx.doi.org/10.1016/S0020-0190(00)00196-4 2003-11-20 Completeness Issues for Join Dependencies Derived from the Universal Relation Join Dependency. 269-274 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#MillerGKL88 2003-11-20 A Model of Reconfiguration in Communicating Sequential Processes. 19-22 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Jacob90a 2003-11-20 Area Requirement of Visibility Representations of Trees. 81-88 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KantLTT97 http://dx.doi.org/10.1016/S0020-0190(97)00048-3 2003-11-20 Probabilistic Checking of Associativity in Algebras. 187-191 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Jacobs91 2003-11-20 Transposition of an 1*1 Matrix Requires O(log 1) Reversals on Conservative Turing Machines. 55-59 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Kirchherr88 2003-11-20 Kolmogorov Complexity and Random Graphs. 125-130 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Kirchherr92 2004-04-21 A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs. 11-16 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#LakhalL98 http://dx.doi.org/10.1016/S0020-0190(97)00177-4 2003-11-20 A Divide-and-Conquer Approach to General Context-Free Parsing. 203-208 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#BossiCC83 2003-11-20 A Complete Equational Axiomatization for Prefix Iteration. 333-337 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Fokkink94 2003-11-20 Unification for Infinite Sets of Equations Between Finite Terms. 183-188 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Fokkink97 http://dx.doi.org/10.1016/S0020-0190(97)00063-X 2003-11-20 Undecidability of the Bandwidth Problem on Linear Graph Languages. 193-197 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#WankeW89 2003-11-20 The Power of Parallel Projection. 185-191 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Kreveld93 2003-11-20 On Coupling and the Approximation of the Permanent. 91-95 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Mihail89 2003-11-20 Universal Traversal Sequences for Expander Graphs. 67-69 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#HooryW93 2003-11-20 Exact VC-Dimension of Boolean Monomials. 19-20 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#NatschlagerS96 http://dx.doi.org/10.1016/0020-0190(96)00084-1 2003-11-20 A Note on Restricted H-Colouring. 149-151 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#BrewsterM91 2003-11-25 On the complexity of digraph packings. 101-106 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00478-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#BrewsterR03 2003-11-20 Improved Bounds for Covering Complete Uniform Hypergraphs. 203-207 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Radhakrishnan92 2003-11-20 The Critical Value of the Basic Parameter of a Nonlinear Differential Equation. 87-90 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Whale72 2003-11-25 Inclusion-exclusion for k-CNF formulas. 111-117 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00259-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#AmanoIMMM03 2003-11-20 Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion. 163-169 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#HungP94 2004-06-08 An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner. 253-258 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#ItanoSHY88 http://dx.doi.org/10.1016/0020-0190(88)90088-9 2003-11-20 An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. 31-34 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#LarmoreR94 2003-11-20 A Simplified Account of Polymorphic References. 201-206 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Harper94 2003-11-20 A Note on ``A Simplified Account of Polymorphic References''. 15-16 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Harper96 http://dx.doi.org/10.1016/0020-0190(95)00178-6 2004-06-11 Computing the Optimal Bridge Between Two Convex Polygons. 127-130 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#CaiXZ99 http://dx.doi.org/10.1016/S0020-0190(99)00003-4 2003-11-20 Extended Impossibility Results for Asynchronous Complete Networks. 145-151 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#MoranW87 2003-11-20 Dynamic Maintenance of Majority Information in Constant Time per Update. 75-78 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#FrandsenS97 http://dx.doi.org/10.1016/S0020-0190(97)00100-2 2005-04-11 Realization of Graceful Permutation by a Shuffle-Exchange Network. 171-173 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Cahit77 2003-11-20 Clique polynomials have a unique root of smallest modulus. 127-132 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#GoldwurmS00 http://dx.doi.org/10.1016/S0020-0190(00)00086-7 2003-11-20 LL-Regular Grammars. 31-37 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#JarzabekK75 2003-11-20 Subsumption and Implication. 109-111 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Gottlob87 2003-11-20 United and Discriminated Record Types in Strongly Typed Languages. 13-18 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#BerryS79 2003-11-20 Incremental Constraint Deletion in Systems of Linear Constraints. 111-115 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#HuynhM95 http://dx.doi.org/10.1016/0020-0190(95)00063-I 2003-11-20 Some Nested Dissection Order is Nearly Optimal. 325-328 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Gilbert88 2003-11-20 Counter-One-Pass Features in One-Pass Compilation: A Formalization Using Attribute Grammars. 279-284 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#GiegerichW78 2003-11-20 A Note on the Graph Isomorphism counting Problem. 131-132 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Mathon79 2003-11-20 Parallel Parsing on the Connection Machine. 111-117 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#SkillicornB89 2003-11-20 The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction. 79-83 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#PanR91 2003-11-20 On Separation of the Emptiness and Equivalence Problems for Program Schemes. 91-93 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#AuzinsK85 2003-11-20 A Note on the Hamiltonian Circuit Problem on Directed Path Graphs. 167-170 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Narasimhan89 2003-11-20 A Note on a Construction of Margulis. 17-19 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Angluin79 2003-11-20 On Accelerating Newton's Method Based on a Conic Model. 277-281 1989 30 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#NazarethA89 2003-11-20 A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time. 247-254 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Park91 2003-11-20 The Lexicographically First Topological Order Problem is NLOG-Complete. 121-124 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Shoudai89 2003-11-20 A P-Complete Language Describable with Iterated Shuffle. 233-238 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Shoudai92 2003-11-20 A Note on Bitonic Sorting. 223-225 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Paul94 2003-11-20 On the Generative Capacity of Simple Matrix Grammars of Finite Index. 100-102 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Paun78 2003-11-20 On Szilard's Languages Associated to a Matrix Grammar. 104-105 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Paun79 2003-11-20 Splicing Systems with Targets are Computationally Universal. 129-133 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Paun96 http://dx.doi.org/10.1016/0020-0190(96)00097-X 2003-11-24 On the query complexity of finding a local maximum point. 327-332 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00313-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#RastsvetaevB02 2003-11-25 Foreword. 1-2 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00391-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#FiadeiroMT03 2003-11-20 About the Expressive Power of CTL Combinators. 343-345 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Laroussinie95 http://dx.doi.org/10.1016/0020-0190(95)00053-F 2003-11-20 A Note on Preemptive Scheduling of Periodic, Real-Time Tasks. 115-118 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#LeungM80 2003-11-20 Tighter Bounds on a Heuristic for a Partition Problem. 51-57 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#LeungW95 http://dx.doi.org/10.1016/0020-0190(95)00099-X 2003-11-20 Preemptive Scheduling to Minimize Mean Weighted Flow Time. 47-50 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#LeungY90 2003-11-20 The Formal Termination Problem for Programs with Finite ALGOL 68-Modes. 155-159 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#LangmaackLW79 2003-11-20 Memory-Efficient Enumeration of Constrained Spanning Trees. 47-53 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#NievergeltDM99 http://dx.doi.org/10.1016/S0020-0190(99)00117-9 2003-11-20 Global and Logical Time in Distributed Algorithms. 189-194 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Morgan85 2003-11-20 Data Refinement by Miracles. 243-246 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Morgan88 2003-11-20 Multiprocessor Simulation Strategies with Optimal Speed-up. 23-33 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#DunneGL95 http://dx.doi.org/10.1016/0020-0190(94)00226-O 2003-11-20 Algorithms for Drawing Binary Trees in the Plane. 133-139 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#ShinKKC98 http://dx.doi.org/10.1016/S0020-0190(98)00049-0 2003-11-20 Corrigendum: Separating Collections of Points in Euclidean Spaces. 359 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#BolandU95a http://dx.doi.org/10.1016/0020-0190(95)00075-N 2003-11-20 Abstract FOR-Loops Over Several Aggregates. 204-206 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#FridmanHMS79 2003-11-20 Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls. 169-174 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Pelc91 2003-11-20 On the Complexity of Tree Embedding Problems. 323-328 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#SimonsonS92 2003-11-20 A Distributed Index Sequential Access Method. 1-5 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#GairolaR76 2003-11-20 Which Finite Monoids are Syntactic Monoids of Rational omega-Languages. 127-132 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#HuyLV92 2003-11-20 Perfect Staircase Profile of Linear Complexity for Finite Sequences. 85-89 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#MoriiK92 2003-11-20 An Note on the Number of Monadic Quantifiers in Monadic Sigma^1_1. 337-339 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Otto95a http://dx.doi.org/10.1016/0020-0190(94)00219-O 2003-11-20 First-Order Queries on Databases Embedded in an Infinite Structure. 37-41 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#OttoB96 http://dx.doi.org/10.1016/S0020-0190(96)00140-8 2003-11-20 Optimal Node Ranking of Trees in Linear Time. 91-96 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Schaffer89 2003-11-20 Enumerating longest increasing subsequences and patience sorting. 7-11 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#BespamyatnikhS00a http://dx.doi.org/10.1016/S0020-0190(00)00124-1 2003-11-20 Cryptanalysis of YCN key assignment scheme in a hierarchy. 97-101 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Hwang00 http://dx.doi.org/10.1016/S0020-0190(00)00013-2 2003-11-20 Protocols for Group Oriented Secret Sharing. 179-182 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Hwang92 2003-11-20 Scheme for Secure Digital Mobile Communications Based on Symmetric Key Cryptography. 35-37 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Hwang93 2003-11-20 A New Class of C.F.L. for Which the Equivalence is Decidable. 30-34 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Senizergues81 2003-11-20 The Clique Problem for Planar Graphs. 131-133 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#PapadimitriouY81a 2003-11-20 An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. 131-133 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#EadesM84 2003-11-20 Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. 325-329 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Morita92 2003-11-20 Finding the Vertices Nearest to a Point in a Hypercube. 99-102 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#PattersonS88 2003-11-20 The Unicity Distance: An Upper Bound on the Probability of an Eavesdropper Successfully Estimating the Secret Key. 43-47 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Jabri96 http://dx.doi.org/10.1016/S0020-0190(96)00138-X 2003-11-20 Closure Property of Principal Cones Under Substitution. 315-317 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Moriya88 2003-11-20 On Two-Way Tree Automata. 117-121 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Moriya94 2003-11-20 The correct diameter of trivalent Cayley graphs. 109-111 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#TsaiHHC99 http://dx.doi.org/10.1016/S0020-0190(99)00123-4 2003-11-20 Separability and the Detection of Hidden Channels. 27-29 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Jacob90 2003-11-20 A Model of Reconfiguration in Communicating Sequential Processes with a Notion of Transactions. 9-12 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Jacob92 2003-11-20 Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices. 159-163 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Mostowski82 2003-11-20 Alternating Automata with Start Formulas. 287-290 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Mostowski90 2003-11-20 Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard. 271-275 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#FotouhiP91 2003-11-20 Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. 179-184 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Schuler95 http://dx.doi.org/10.1016/0020-0190(95)00108-O 2003-11-20 On Solving Hard Problems by Polynomial-Size Circuits. 171-176 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Huynh87 2003-11-20 The Effective Entropies of Some Extensions of Context-Free Languages. 165-169 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Huynh91 2003-11-20 Constraint Preservation Through Loops. 143-148 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Nikolik95 http://dx.doi.org/10.1016/0020-0190(95)00092-Q 2003-11-25 Software evolution - Background, theory, practice. 33-44 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00382-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#LehmanR03 2003-11-20 Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General. 237-242 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Otto95 http://dx.doi.org/10.1016/0020-0190(94)00208-G 2003-11-20 On the Size of a Square-Free Morphism on a Three Letter Alphabet. 231-235 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Carpi83 2003-11-20 On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet. 187-190 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Carpi84 2003-11-20 On Repeated Factors in C^\infty-Words. 289-294 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Carpi94 2003-11-20 Separating some splicing models. 255-259 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#BonizzoniFMZ01 http://dx.doi.org/10.1016/S0020-0190(01)00139-9 2003-11-20 Attacks on Shamir's `RSA for Paranoids'. 197-199 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GilbertGOQ98 http://dx.doi.org/10.1016/S0020-0190(98)00160-4 2003-11-20 A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. 203-206 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Pitt87 2003-11-20 An Algorithm for the Computation of the Hutchinson Distance. 113-117 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#BrandtCM91 2003-11-20 Corrigendum: An Algorithm for the Computation of the Hutchinson Distance. 347 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#BrandtCM92 2003-11-20 A combinatorial property of the factor poset of a word. 35-39 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#CarpiL02 http://dx.doi.org/10.1016/S0020-0190(01)00192-2 2003-11-20 Square-Free Words on Partially Commutative Free Monoids. 125-131 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#CarpiL86 2003-11-20 Counting Productions in Context-Free Derivations. 196-200 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Jaffe78 2003-11-20 Exploiting Logical Structures in Replicated Databases. 255-260 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#AgrawalA90 2003-11-20 Updating Hypothetical Data Bases. 145-146 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#AgrawalD83 2003-11-20 On the IO-Complexity and Approximation Languages. 27-31 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#RolimG88 2003-11-20 A Note on the Best-Case Complexity. 133-138 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#RolimG89 2003-11-25 On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. 79-85 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00479-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#KikuchiS03 2003-11-20 Lower and Upper Bounds of the Sizes of Domains: Estimates and Experiments. 247-253 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#BourretO86 2003-11-20 An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs. 49-53 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#BlumK97 http://dx.doi.org/10.1016/S0020-0190(96)00190-1 2003-11-20 A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. 57-60 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#BlumR94 2003-11-20 Maximum Flow in (s, t) Planar Networks. 107 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Hassin81 2003-11-20 On bounded occurrence constraint satisfaction. 1-6 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Hastad00 http://dx.doi.org/10.1016/S0020-0190(00)00032-6 2003-11-20 One-Way Permutations in NC0. 153-155 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Hastad87 2003-11-20 A Note on Implementing Combining Networks. 195-200 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#KellerW95 http://dx.doi.org/10.1016/0020-0190(95)00105-L 2003-11-20 Concurrent File Access Under Unpredictability. 203-208 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#HerschbergB77 2003-11-20 On the Non-Existence of Maximal Inference Degrees for Language Identification. 81-88 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#JainS93 2003-11-20 Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs. 163-168 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#JainW95 http://dx.doi.org/10.1016/0020-0190(95)00013-3 2003-11-20 Finding Hamiltonian Cycles in Certain Planar Graphs. 249-254 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Cimikowski90 2003-11-20 Shortest-Path Problem is not Harder Than Matrix Multiplication. 134-136 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Romani80 2003-11-20 Author's Reply to S. Moran's Note on the Shortest Path Problem. 87 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Romani81 2003-11-20 Join During Merge: An Improved Sort Based Algorithm. 11-16 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#NegriP85 2003-11-20 Model-based specification. 77-84 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Bijlsma01 http://dx.doi.org/10.1016/S0020-0190(00)00206-4 2003-11-20 Derivation of Logic Programs by Functional Methods. 325-332 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Bijlsma91 2003-11-20 Quasi-Boolean Equivalence. 243-247 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Bijlsma93 2003-11-20 On the Completeness of a Set of Transformations Optimizing Linear Programs. 165-167 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Matwin77 2003-11-20 Approximating the Tree and Tour Covers of a Graph. 275-282 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ArkinHH93 2003-11-20 A Starvation-Free Solution to the Mutual Exclusion Problem. 76-80 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Morris79 2003-11-20 Another Compacting Garbage Collector. 139-142 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Morris82 2003-11-20 Varieties of Weakest Liberal Preconditions. 207-210 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Morris87 2003-11-20 Non-Deterministic Expressions and Predicate Transformers. 241-246 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Morris97 http://dx.doi.org/10.1016/S0020-0190(97)00023-9 2003-11-25 Verifying minimum stable circuit values. 27-32 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00453-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Poon03 2003-11-20 Approximating the maximum quadratic assignment problem. 13-16 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#ArkinHS01 http://dx.doi.org/10.1016/S0020-0190(00)00151-4 2003-11-25 Minimum-link watchman tours. 203-207 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00502-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#ArkinMP03 2003-11-25 Sparse LCS Common Substring Alignment. 259-270 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#LandauSZ03 2003-11-20 A Simple Model of Query Scheduling in Distributed Data Base Systems. 137-147 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#CellaryM80 2003-11-20 Presburger Arithmetic With Array Segments. 79-82 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Jaffar81 2003-11-20 Billiard Quorums on the Grid. 9-16 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#AgrawalEA97 http://dx.doi.org/10.1016/S0020-0190(97)00145-2 2003-11-20 A Regeneration Scheme for Generating Extensions. 127-134 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#GluckK97 http://dx.doi.org/10.1016/S0020-0190(97)00055-0 2003-11-20 Simplified Linear-Time Jordan Sorting and Polygon Clipping. 85-92 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#FungNTW90 2003-11-20 Shortest Path Under Rational Constraint. 245-248 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Romeuf88 2003-11-20 An Axiom System for Database Transactions. 183-189 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Qian90 2003-11-20 Embedding Meshes of Trees Into deBruijn Graphs. 237-240 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Schwabe92 2003-11-20 Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly Network. 295-301 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Schwabe93 2003-11-20 Fault-tolerant hamiltonian laceability of hypercubes. 301-306 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#TsaiTLH02 http://dx.doi.org/10.1016/S0020-0190(02)00214-4 2003-11-20 On the Optimality of Semidynamic Routing Schemes. 20-22 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#AgrawalaT81 2003-11-20 A Note on Diameter of Acyclic Directed Hypercubes. 51-52 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#QiuM90 2003-11-20 Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies. 251-254 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Pugh90 2003-11-20 The Solution of a Problem by Ginsburg. 7-10 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Maurer71 2003-11-20 Unifiability is Complete for co-NLogSpace. 220-222 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#LewisS82 2003-11-20 Trigonometric Polynomials with Simple Roots. 231-236 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Schweikard91 2003-11-24 A framework to visualize equivalences between computational models of regular languages. 5-16 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00223-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Ayala-RinconFPS02 2003-11-25 Computing the update of the repeated median regression line in linear time. 111-117 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00350-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#BernholtF03 2003-11-20 Query Processing for Multimedia Applications on Optical Media. 301-306 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#SpiliopoulouCH95 http://dx.doi.org/10.1016/0020-0190(95)94067-3 2003-11-20 An Execution Mechanism for Nondeterministic, State-Oriented Programs Based on a Chart Parser. 211-217 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Rosenblueth93 2003-11-20 Distance Measures on Intersecting Objects and Their Applications. 181-188 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#SridharanSCK94 2003-11-20 Key Exchange Using `Keyless Cryptography'. 79-81 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#AlpernS83 2003-11-20 Defining Liveness. 181-185 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#AlpernS85 2003-11-20 Acyclic Directed Hypercubes may have Exponential Diameter. 243-245 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#EverettG89 2003-11-20 Minimization of Demand Paging for the LRU Stack Model of Program Behavior. 99-104 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#WoodFL83 2003-11-20 On Similarity of Polynomial Configurations. 231-236 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#RaoL93 2003-11-20 An Algorithm for Local Compaction of Horizontal Microprograms. 29-33 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#RaoM85 2003-11-20 An Integrated Approach to Routing and Via Minimization. 257-263 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#RaoP91 2003-11-20 Linear Algorithm for Domatic Number Problem on Interval Graphs. 29-33 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#RaoR89 2003-11-20 A Distributed Solution of the Distributed Termination Problem. 43-46 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Rana83 2003-11-20 Building Heaps in Parallel. 355-358 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#RaoZ91 2003-11-20 An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. 173-177 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#KabadiA97 http://dx.doi.org/10.1016/S0020-0190(97)00142-7 2003-11-20 An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. 223-229 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#PawagiR86 2003-11-20 A Primal-Dual Approximation Algorithm for the Steiner Forest Problem. 185-190 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Ravi94 2003-12-10 Even Initial Feedback Vertex Set Problem is NP-Complete. 64-66 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#SimoviciG79 2003-11-20 A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. 35-37 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#SchnorrK77 2003-11-20 Distributed Consensus Revisited. 195-201 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Neiger94 2003-11-20 On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. 261-267 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#HellersteinKW90 2003-11-25 Hardware/software co-design then and now. 83-87 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00385-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Wirth03 2003-11-20 On a Recursion Connected with Tree Balancing Algorithms. 189-192 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#LeijenhorstW87 2003-11-20 An Analysis of the Karp-Rabin String Matching Algorithm. 271-274 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#GonnetB90 2003-11-20 Heuristics for Syntactial Optimization of Relational Queries. 313-316 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#DemolombeI89 2003-11-20 The Interpolation-Sequential Search Algorithm. 136-139 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#GonnetR77 2003-11-20 A Note on the Notation of Recursion in Process Algebras. 299-303 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Taubner91 2003-11-20 New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. 151-158 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Alimonti96 http://dx.doi.org/10.1016/0020-0190(95)00196-4 2004-01-19 On the Proof of a Distributed Algorithm. 145-147 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Verjus87 2003-11-20 Depth-First Search is Inherently Sequential. 229-234 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Reif85 2003-11-20 A Topological Approach to Dynamic Graph Connectivity. 65-70 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Reif87 2003-11-20 An Adaptive Time Advancement Algorithm for Discrete Simulation. 83-86 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Javor77 2006-04-27 A new sufficient condition for Hamiltonicity of graphs. 159-161 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Li06 2005-06-16 A Note on Relation Schemes which are in 3NF but not in BCNF. 281-283 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#VincentS93 2003-11-20 On Determining the On-Line Minimax Linear Fit to a Discrete Point Set in the Plane. 97-101 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#ReyW87 2003-11-20 A Counter Example to a Monotonicity Property of k-d Trees. 169-173 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#HoshiY82 2003-11-20 The Planar Realization of Boolean Functions. 165-170 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#McCollP87 2003-11-20 Sorting Numbers in Linear Expected Time and Optimal Extra Space. 119-124 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#GonzalezJ82 2003-11-20 4-edge-coloring graphs of maximum degree 3 in linear time. 191-195 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Skulrattanakulchai02 http://dx.doi.org/10.1016/S0020-0190(01)00221-6 2003-11-20 Proving Open Properties by Induction. 19-23 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Raoult88 2003-11-25 Deterministic finite automata with recursive calls and DPDAs. 187-193 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00281-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#GallierTM03 2003-11-20 <i>m</i><i>m</i>²Edges. 115-118 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Rhee98 http://dx.doi.org/10.1016/S0020-0190(98)00041-6 2003-11-20 Input-Driven Languages are in log n Depth. 247-250 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Dymond88 2003-11-20 The Complexity of Testing Whether a Graph is a Superconcentrator. 164-167 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#BlumKVPY81 2003-11-20 An Efficient Computation of Right Context for LR-Based Error Repair. 63-71 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#JungCH94 2003-11-20 Simple and fast linear space computation of longest common subsequences. 275-281 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Rick00 http://dx.doi.org/10.1016/S0020-0190(00)00114-9 2003-11-20 A New Algebraic Algorithm to Decode the Ternary Golay Code. 271-274 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Rifa98 http://dx.doi.org/10.1016/S0020-0190(98)00181-1 2003-11-20 Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines on a Hypercube. 161-166 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Plehn90 2003-11-20 On a Recursive Ascent Parser. 201-206 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Kruseman88 2003-11-24 A Kolmogorov complexity characterization of constructive Hausdorff dimension. 1-3 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00343-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Mayordomo02 2003-11-20 Deterministic small-world communication networks. 83-90 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#ComellasOP00 http://dx.doi.org/10.1016/S0020-0190(00)00118-6 2003-11-20 The Equivalence Problem for Deterministic T0L-Systems is Undecidable. 201-204 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Rozenberg72 2003-11-20 On Slicing of K-Iteration Grammars. 127-131 1976 4 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Rozenberg76 2005-11-07 Average Complexity of Divide-and-Conquer Algorithms. 319-326 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Veroy88a 2004-09-17 Merging by the Parallel Jump Searching Algorithm. 239-246 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#EvansY86 2004-09-17 Explicit Solution of Block Tridiagonal Systems of Linear Equations. 207-209 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#EvansY87 2003-11-20 Improved lower bound on the Shannon capacity of C7. 277-282 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#VeselZ02 http://dx.doi.org/10.1016/S0020-0190(01)00229-0 2003-11-20 A Matched Approximation Bound for the Sum of a Greedy Coloring. 135-140 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Bar-NoyHK99 http://dx.doi.org/10.1016/S0020-0190(99)00104-0 2003-11-20 A Technique for Implementing Backtrack Algorithms and its Application. 174-175 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#HitotumatuN79 2003-11-20 Partitioning Multiple-Chain-Like Task Across a Host-Satellite System. 261-266 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Billionnet93 2003-11-20 The Greedy Algorithm is Optimal for On-Line Edge Coloring. 251-253 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Bar-NoyMN92 2003-11-20 Derivation of a Termination Detection Algorithm for Distributed Computations. 217-219 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#DijkstraFG83 2003-11-20 Iterative Improvement of Vertex Covers. 95-98 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Saab95 http://dx.doi.org/10.1016/0020-0190(95)00058-K 2003-11-20 An Improved Algorithm for Intersecting Convex Polygons. 89-90 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Saab97 http://dx.doi.org/10.1016/S0020-0190(96)00195-0 2003-11-20 Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. 345-351 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Saez02 http://dx.doi.org/10.1016/S0020-0190(02)00213-2 2003-11-20 Global Quiescence Detection Based on Credit Distribution and Recovery. 195-200 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Mattern89 2003-11-20 A D0L-T0L Public Key Cryptosystem. 95-97 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#SubramanianSA87 2003-11-20 A Note on Upper Bounds for the Selection Problem. 214-219 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Motoki82 2003-11-20 Inductive Inference from all Positive and Some Negative Data. 177-182 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Motoki91 2003-11-25 On the design of correct and optimal dynamical systems and games. 59-65 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00387-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Sintzoff03 2003-11-20 Decidability for Some Problems of Linear Cellular Automata Over Finite Commutative Rings. 151-155 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Sato93 2003-11-20 Ergodicity of Linear Cellular Automata over ganzen Zahlen_m. 169-172 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Sato97 http://dx.doi.org/10.1016/S0020-0190(96)00206-2 2003-11-20 _<i>m</i>. 100-104 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Sato98 2003-11-20 A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree. 186-188 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Slater82 2003-11-20 Efficient Multiway Radix Search Trees. 115-120 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#ErlingssonKR96 http://dx.doi.org/10.1016/S0020-0190(96)00151-2 2003-11-20 On the Cardinality of Some Lattices. 67-68 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Hosono75 2004-01-29 A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation. 305-311 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#GibbonsS89 2003-11-20 The Balanced Binary Tree Technique on Mesh-Connected Computers. 101-109 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#GibbonsZ91 2003-11-20 Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. 80-82 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#BlumCW80 2003-11-20 Cyclomatic Numbers Do Not Measure Complexity of Unstructured Programs. 207-211 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Oulsnam79 2003-11-20 A Faster Lexicographical N Queens Algorithm. 231-233 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Rohl83 2003-11-20 Improved Performance of the Greedy Algorithm for Partial Cover. 251-254 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Slavik97 http://dx.doi.org/10.1016/S0020-0190(97)00182-8 2003-11-20 On the Logarithmic Evaluation of Recurrence Relations. 197-199 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Ronn91 2003-11-20 Scheduling Chains to Minimize Mean Flow Time. 297-301 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#DrorKD97 http://dx.doi.org/10.1016/S0020-0190(97)00037-9 2003-11-20 Tree Precedence in Scheduling: The Strong-Weak Distinction. 127-134 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#DrorKL99 http://dx.doi.org/10.1016/S0020-0190(99)00103-9 2003-11-20 Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation. 123-127 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Rote91 2003-11-20 A Note on Word Chains and Regular Languages. 15-18 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Roth89 2006-04-04 Design Parameters for a Multiserver Processing Buffering System with Feedback. 236-243 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Tzafestas72a 2003-11-20 Prefix and Equality Languages of Rational Functions are Co-Context-Free. 77-79 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#EngelfrietH88 2003-11-20 Diophantine Inference on a Statistical Database. 25-31 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Rowe84 2003-11-20 Applicability of Genetic Algorithms to Optimal Evaluation of Path Predicates in Object-Oriented Queries. 123-128 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#SeoL96 http://dx.doi.org/10.1016/0020-0190(96)00036-1 2003-11-20 Copying Theorems. 157-161 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#EngelfrietS76 2003-11-20 Maximizing the Number of Unused Colors in the Vertex Coloring Problem. 87-90 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#HassinL94 2003-11-20 Better approximations for max TSP. 181-186 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#HassinR00 http://dx.doi.org/10.1016/S0020-0190(00)00097-1 2003-11-20 Approximation algorithms for maximum linear arrangement. 171-177 2001 80 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#HassinR01 http://dx.doi.org/10.1016/S0020-0190(01)00159-4 2003-11-20 A 7/8-approximation algorithm for metric Max TSP. 247-251 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#HassinR02 http://dx.doi.org/10.1016/S0020-0190(01)00234-4 2003-11-20 Approximations for the Maximum Acyclic Subgraph Problem. 133-140 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#HassinR94 2003-11-20 An Approximation Algorithm for Maximum Packing of 3-Edge Paths. 63-67 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#HassinR97 http://dx.doi.org/10.1016/S0020-0190(97)00097-5 2003-11-20 An Approximation Algorithm for the Maximum Traveling Salesman Problem. 125-130 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#HassinR98 http://dx.doi.org/10.1016/S0020-0190(98)00102-1 2003-11-20 On the Minimum Diameter Spanning Tree Problem. 109-111 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#HassinT95 http://dx.doi.org/10.1016/0020-0190(94)00183-Y 2003-11-20 New Lower Bounds for Element Distinctness on a On-Tape Turing Machine. 311-314 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Lopez-Ortiz94 2003-11-20 Procedures and Atomicity Refinement. 67-74 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Sere96 http://dx.doi.org/10.1016/S0020-0190(96)00142-1 2003-11-20 NTS Grammars and Church-Rosser Systems. 73-76 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Book81a 2003-11-20 Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. 29-32 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#BookL87 2003-11-20 Cancellation Rules and Extended Word Problems. 5-11 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#BookO85 2003-11-20 A Note on Sparse Sets and the Polynomial-Time Hierarchy. 141-143 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#BookT89 2003-11-20 Lexicographically Least Circular Substrings. 240-242 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Booth80 2003-11-20 A Parallel Algorithm for Constructing Projection Polyhedra. 113-119 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Shah93 2003-11-24 Proxy signature schemes based on factoring. 137-143 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00367-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Shao03 2003-11-20 Perfect Stables in Graphs. 53-56 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#CroitoruS83 2003-11-20 Static Behavior Analysis of a Mesh System. 295-299 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Shen93 2003-11-20 Fault-Tolerant Parallel k Selection Algorithm in n-Cube Networks. 93-97 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Sheu91 2003-11-20 A Note on Dynamic Threshold Schemes. 189-193 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Blundo95 http://dx.doi.org/10.1016/0020-0190(95)00104-K 2003-11-25 Fault-tolerant wormhole routing for hypercube networks. 93-100 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00477-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Shih03 2003-11-20 A Note on Computational Indistinguishability. 277-281 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Goldreich90 2003-11-20 Cryptanalysis of Chang-Wu's group-oriented authentication and key exchange protocols. 113-117 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#ChienWJT01 http://dx.doi.org/10.1016/S0020-0190(01)00147-8 2003-11-20 A Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy. 355-358 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Oyang95 http://dx.doi.org/10.1016/0020-0190(95)00055-H 2003-11-20 A Liveness Property of a Parallel Algorithm. 275-277 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Ruby87 2003-11-24 ²n]. 1-6 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00346-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KavvadiasS03 2003-11-20 The Medians of Discrete Sets. 293-299 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#LungoNPS98 http://dx.doi.org/10.1016/S0020-0190(98)00020-9 2003-11-20 Linear Strategy for Propositional Modal Resolution. 87-92 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Auffray88 2003-11-20 Comments on Morris's Starvation-Free Solution to the Mutual Exclusion Problem. 91-97 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#AnnotJG86 2003-11-20 On Codes, omega-Codes and omega-Generators. 1-5 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#JuliaLP96 http://dx.doi.org/10.1016/S0020-0190(96)00136-6 2003-11-20 On the Probabilistic Performance of Algorithms for the Satisfiability Problem. 103-106 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Franco86 2003-11-20 Quasi-Parity and Perfect Graphs. 35-39 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Rusu95 http://dx.doi.org/10.1016/0020-0190(94)00224-M 2003-11-20 Fast computation of shortest watchman routes in simple polygons. 27-33 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Tan01a http://dx.doi.org/10.1016/S0020-0190(00)00146-0 2003-11-20 Optimal computation of the Voronoi diagram of disjoint clusters. 115-119 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Tan01b http://dx.doi.org/10.1016/S0020-0190(00)00179-4 2003-11-20 Optimal online algorithm for scheduling on two identical machines with machine availability constraints. 323-329 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#TanH02 http://dx.doi.org/10.1016/S0020-0190(02)00211-9 2003-11-25 Finding shortest safari routes in simple polygons. 179-186 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00284-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#TanH03 2003-11-20 On Resource Scheduling of Multi-Join Queries in Parallel Database Systems. 189-195 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#TanL93 2003-11-20 Workload Scheduling for Multiple Query Processing. 251-257 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#TanL95 http://dx.doi.org/10.1016/0020-0190(95)00088-T 2003-11-20 Axiomatic Proofs of Fotal Correctness of Programs. 274-277 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Soundararajan79 2003-11-20 Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. 107-114 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#DehneG97 http://dx.doi.org/10.1016/S0020-0190(97)00168-3 2005-01-14 A Fast Correlation Attack on Multiplexer Generators. 89-93 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#SimpsonGSD99 http://dx.doi.org/10.1016/S0020-0190(99)00045-9 2003-11-20 Hexagonal Three-Layer Channel Routing. 223-228 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#TanS95 http://dx.doi.org/10.1016/0020-0190(95)00090-Y 2003-11-20 Sorting on PRAMs with Reconfigurable Buses. 203-208 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Vaidyanathan92 2003-11-20 Certain Problems of the Theory of Structured Program Schemes. 256-260 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#GlushkovTY78 2003-11-24 A lower bound on the size of [epsiv]-free NFA corresponding to a regular expression. 293-299 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00436-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Lifshits03 2003-11-20 Minimal Comparison Sorting by Choosing Most Efficient Comparisons. 129-130 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Warren73 2003-11-20 On the Complexity of Simplifying Quadratic Forms. 217-220 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Snir81 2003-11-20 Exact Balancing is Not Always Good. 97-102 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Snir86 2003-11-20 A note on the verification of automata specifications of probabilistic real-time systems. 223-228 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#MouraP02 http://dx.doi.org/10.1016/S0020-0190(01)00288-5 2003-11-20 Parallel Algorithms for Addition and Multiplication on Processor Arrays with Reconfigurable Bus Systems. 89-94 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ThangavelM93 2003-11-20 Corrigenda: Common Intersections of Polygons. 53 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Boxer90 2003-11-20 L-Attributed LL(1)-Grammars are LR-Attributed. 325-328 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#NakataS86 2003-11-20 On the computational structure of the connected components of a hard problem. 83-90 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#MatamalaM99 http://dx.doi.org/10.1016/S0020-0190(99)00130-1 2003-11-20 The Synchronization Problem in Protocol Testing and its Complexity. 131-136 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#BoydU91 2003-11-20 A Lower Bound for Randomized List Update Algorithms. 5-9 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Teia93 2003-11-20 Comments on ``Ring Based Termination Detection Algorithm for Distributed Computations''. 127-128 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#TelM89 2003-11-20 Noncommutative Minimization Algorithms. 123-126 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#FlouretL97 http://dx.doi.org/10.1016/S0020-0190(97)00162-2 2003-11-20 Listing and Counting Subtrees of Equal Size of a Binary Tree. 225-229 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Hikita83 2003-11-20 A Generalization of Two Code Ordering Optimizations. 67-70 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Fraser83 2003-11-20 Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing. 167-170 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#TeoT90 2003-11-20 An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths. 305-309 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#TeoT91 2003-11-20 An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle. 101-105 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#TeoT92 2003-11-20 Optimal Alphabetic Search Trees With Restricted Maximal Height. 90-94 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Wessner76 2003-11-20 Space Efficient Processor Identity Protocol. 147-154 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Teng90 2003-11-25 On the freedom of decryption. 329-333 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00211-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Millen03 2003-11-20 Generating Hinges from Arbitrary Subhypergraphs. 307-312 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Miller92 2003-11-20 On the hardness of failure-sensitive agreement problems. 99-104 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Guerraoui01 http://dx.doi.org/10.1016/S0020-0190(00)00171-X 2003-11-20 On the Correspondence Metween Two Classes of Reduction Systems. 83-85 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Thatte85 2003-11-20 Corrigenda: Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix. 167 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#SzymanskiS92a 2005-07-06 Implicit Computation of Synchronization Primitives. 35-38 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#MilloM79 2003-11-20 A Note on Paths Embedded in Trees. 272-273 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Rosenberg79 2003-11-20 Fast Nondeterministic Recognition of Context-Free Languages Using two Queues. 91-93 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Rosenberg98 http://dx.doi.org/10.1016/S0020-0190(98)00091-X 2003-11-25 A new external sorting algorithm with no additional disk space. 229-233 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00201-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#IslamAIH03 2003-11-20 A Functional Model of a Simplified Sequential Machine. 161-166 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Piotrowski90 2003-11-20 Decidability of the Star Problem in A* x {b}*. 65-71 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#GastinOPR92 2003-11-20 A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. 45-49 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#GalbiatiMM94 2003-11-20 An Upper Bound on the Number of Execution Nodes for a Distributed Join. 46-48 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#CeriP81 2003-11-20 A Solution Method for the Non-Additive Resource Allocation Problem in Distributed System Design. 174-178 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#CeriP82 2003-11-20 Viennot Factorization of Infinite Words. 53-57 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Melancon96 http://dx.doi.org/10.1016/S0020-0190(96)00147-0 2003-11-20 Pancyclicity of recursive circulant graphs. 187-190 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ArakiS02 http://dx.doi.org/10.1016/S0020-0190(01)00226-5 2003-11-20 On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. 59-62 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#BordihnH99 http://dx.doi.org/10.1016/S0020-0190(98)00200-2 2003-11-20 A Simple Deduction Method for Modal Logic. 49-51 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Cerro82 2003-11-20 Considerations on the Similarity Measures Between Index Terms. 243-246 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Ozawa83 2003-11-20 On Dynamic Threshold Schemes. 201-206 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#SunS94 2003-11-20 A Fast Algorithm for Stereo Matching. 57-61 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Chung97a http://dx.doi.org/10.1016/S0020-0190(97)00101-4 2003-11-20 History Sensitive String for Multiple Alphabets. 183-188 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#ChungC87 2003-11-20 Order Independent NCE Grammars Recognized in Polynomial Time. 161-164 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Jeffs91 2003-11-20 Extracting indexing information from XML DTDs. 97-103 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ChungK02 http://dx.doi.org/10.1016/S0020-0190(01)00193-4 2003-11-20 Algorithms of Placing Recovery Points. 177-181 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ChungK88 2003-11-20 LR(k)-Coupled-Context-Free Grammars. 349-358 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Pitsch95 http://dx.doi.org/10.1016/0020-0190(95)00117-U 2003-11-20 Semantics-Based Transaction Management for Multidatabase Systems. 109-115 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#ChungM96 http://dx.doi.org/10.1016/0020-0190(96)00098-1 2003-11-20 On the number of spanning trees of a multi-complete/star related graph. 113-119 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#ChungY00 http://dx.doi.org/10.1016/S0020-0190(00)00135-6 2003-11-20 An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format. 1-5 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#ChungY01 http://dx.doi.org/10.1016/S0020-0190(00)00168-X 2003-11-20 Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format. 13-21 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ChungY02 http://dx.doi.org/10.1016/S0020-0190(01)00188-0 2003-11-20 A First-In-First-Out Buffered Cyclic Memory. 63-68 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#RajaramanV77 2003-11-20 On the Number of Descendants in an Object DAG. 211-216 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#ShidlovskyB96 http://dx.doi.org/10.1016/0020-0190(96)00063-4 2003-11-20 Some undecidable problems for parallel communicating finite automata systems. 239-245 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Martin-VideM01 http://dx.doi.org/10.1016/S0020-0190(00)00159-9 2003-11-20 Fixed-Size Blocks Optimization. 165-169 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#NawrockiU88 2003-11-20 Remark on the Computational Power of a Turing Machine Variant. 43-45 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Deimel74 2003-11-20 A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. 53-55 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Anderson78 2003-11-20 Encoded pointers - An Interesting DataSstructure for Modern Sil's. 47-50 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Anderson80 2003-11-20 Recursive (omega)o-Rule for Proof Systems. 291-294 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Yoccoz89 2003-11-20 Order statistics and selection methods of evolutionary algorithms. 15-22 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Cantu-Paz02 http://dx.doi.org/10.1016/S0020-0190(01)00282-4 2003-11-20 On the Expressive Power of the Relational Algebra. 107-111 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Paredaens78 2003-11-20 Error Bounds on Disk Arrangement Using Frequency Information. 209-213 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#CarsonV89 2003-11-20 Algebraic properties of the shuffle over omega-trajectories. 139-144 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#KadrieDTS01 http://dx.doi.org/10.1016/S0020-0190(01)00153-3 2003-11-20 Efficient Deduction in Equality Horn Logic by Horn-Completion. 1-6 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#NieuwenhuisN91 2003-11-20 A Note on the Expected Path Length of Trees with Known Fringe. 309-315 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#PriscoPP96 http://dx.doi.org/10.1016/0020-0190(96)00129-9 2003-11-20 A Public Key Cryptosystem Based on Lyndon Words. 33-36 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#SiromoneyM90 2003-11-20 A Special Purpose MIMD Parallel Processor. 23-27 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#McKeown85 2003-11-20 A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. 251-254 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#ArikatiM99 http://dx.doi.org/10.1016/S0020-0190(99)00071-X 2003-11-20 Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. 149-153 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#ArikatiR90 2003-11-20 Deciding the Winner in Parity Games is in UP \cap co-Up. 119-124 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Jurdzinski98 http://dx.doi.org/10.1016/S0020-0190(98)00150-1 2003-11-20 <sup>th</sup>Element of the Solution of a Difference Equation. 66-67 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Urbanek80 2003-11-20 On the Complexity of Topological Sorting. 229-233 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Toda90 2003-11-20 A Uniform Model for the Storage Utilization of B-Tree-Like Structures. 53-58 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#MerliniSV96 http://dx.doi.org/10.1016/0020-0190(95)00189-1 2003-11-20 On the Number of Small Cuts in a Graph. 41-44 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#HenzingerW96 http://dx.doi.org/10.1016/0020-0190(96)00079-8 2003-11-20 An Algebraic Description of Some State-Dependent Failure Mechanisms. 207-211 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#SchreiberR88 2003-11-20 On-line scheduling with setup costs. 61-68 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#GambosiN00 http://dx.doi.org/10.1016/S0020-0190(99)00152-0 2003-11-20 Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences. 155-160 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#BorealeIN92 2003-11-20 A Note on a Theorem by Ladner. 84-86 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#BalcazarD82 2003-11-20 Feedback Automata and Their Languages. 83-86 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Watjen85 2003-11-20 A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. 77-80 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#IsraelI86 2003-11-20 Arithmetical Axiomatization of First-Order Temporal Logic. 111-116 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Szalas87 2003-11-20 An Incompleteness Result in Process Algebra. 67-70 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Szalas88 2003-11-20 Axiomatizing Fixpoint Logics. 175-180 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Szalas92 2003-11-20 On the stability number of the edge intersection of two graphs. 173-174 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ArbibC02 http://dx.doi.org/10.1016/S0020-0190(01)00324-6 2003-11-20 One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages. 69-72 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Slobodova90 2003-11-25 The constrained longest common subsequence problem. 173-176 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Tsai03 2003-11-20 An Algorithm for Flow Time Minimization and its Asymptotic Makespan Properties. 41-46 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Tsai92 2003-11-20 The Numerical Instability of Bini's Algorithm. 17-19 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Tsao81 2003-11-20 An Efficient Implemention of Priority Queues Using Fixed-Sized Systolic Coprocessors. 193-198 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Tsay93 2003-11-20 The Cost of Graceful Degradation for Omission Failures. 167-172 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#JayantiCT99 http://dx.doi.org/10.1016/S0020-0190(99)00101-5 2003-11-20 Some remarks on distributed depth-first search. 173-178 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Tsin02 http://dx.doi.org/10.1016/S0020-0190(01)00273-3 2003-11-20 An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph. 143-146 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Tsin85 2003-11-20 On Handling Vertex Deletion in Updating Spanning Trees. 167-168 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Tsin88 2003-11-20 Fixed Hypercube Embedding. 35-39 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#CybenkoKV87 2003-11-20 A polynomial algorithm for lot-size scheduling of two type tasks. 229-235 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#KovalyovPS02 http://dx.doi.org/10.1016/S0020-0190(01)00331-3 2003-11-20 Analysis of Queuing Networks in Which Processes Exhibit Locality-Transition Behaviour. 20-23 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Tsur78 2003-11-20 An optimal layout of multigrid networks. 137-141 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#CalamoneriM99 http://dx.doi.org/10.1016/S0020-0190(99)00140-4 2003-11-20 A New 3D Representation of Trivalent Cayley Networks. 247-252 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#CalamoneriP97 http://dx.doi.org/10.1016/S0020-0190(97)00027-6 2003-11-20 3D Straight-Line Grid Drawing of 4-Colorable Graphs. 97-102 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#CalamoneriS97 http://dx.doi.org/10.1016/S0020-0190(97)00098-7 2003-11-25 A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. 235-240 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00202-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#FernauM03 2003-11-20 Calculating with Procedure Calls. 211-217 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Bijlsma93a 2003-11-20 Complexity Measures for Concurrent Programs Based on Information-Theoretic Metrics. 43-50 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ChaCK93 2003-11-20 Test Sets for Languages of Infinite Words. 91-95 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#LucaPV88 2003-11-20 Codes, Simplifying Words, and Open Set Condition. 297-301 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Staiger96 http://dx.doi.org/10.1016/0020-0190(96)00074-9 2003-11-20 On the orthographic dimension of definable sets. 141-145 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#CosmadakisKL01 http://dx.doi.org/10.1016/S0020-0190(00)00184-8 2003-11-20 Periodic String Division Generated by Deterministic L Systems. 229-234 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Tuza90 2003-11-20 Fast String Searching by Finding Subkeys in Subtext. 130-133 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#BaileyD80 2003-11-20 An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. 297-302 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Vishwanathan92 2003-11-20 Computational complexity of similarity retrieval in a pictorial database. 113-117 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#GuanCC00 http://dx.doi.org/10.1016/S0020-0190(00)00092-2 2003-11-20 Horn Functions and Their DNFs. 23-29 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#HammerK92 2003-11-20 Lindenmayer Grammars and Symbolic Testing. 36-39 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Howden78 2003-11-25 A topological characterization of random sequences. 245-250 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#CaludeMS03 2003-11-20 Parallel approximation algorithms for maximum weighted matching in general graphs. 13-17 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#UeharaC00 http://dx.doi.org/10.1016/S0020-0190(00)00128-9 2003-11-20 Enclosing k Points in the Smallest Axis Parallel Rectangle. 95-99 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#SegalK98 http://dx.doi.org/10.1016/S0020-0190(97)00212-3 2003-11-20 Optimal Multidisk Partial Match File Designs. 149-155 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ChanC88 2003-11-20 Testing Unboundedness of Database Schemes and Functional Dependencies. 317-326 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ChanH88 2003-11-20 Normal Forms Have Partial Types. 1-3 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Palsberg93 2003-11-20 Managing the granularity of constraint-based analyses by rule transformation. 79-88 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Chang02 http://dx.doi.org/10.1016/S0020-0190(01)00314-3 2003-11-20 Single Step Graph Search Problem 107-111 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Chang91 2003-11-20 The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets. 309-315 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Howell91 2003-11-20 Performance evaluation of a Java-based networking Application Programming Interface (API). 199-209 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Zeadally00 http://dx.doi.org/10.1016/S0020-0190(00)00104-6 2003-11-20 A Technique for Adding Range Restrictions to Generalized Searching Problems. 263-269 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#GuptaJS97 http://dx.doi.org/10.1016/S0020-0190(97)00183-X 2003-11-20 Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. 7-13 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#GuptaJS99 http://dx.doi.org/10.1016/S0020-0190(98)00187-2 2003-11-20 Typing evolving ambients. 265-270 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#GuanYY01 http://dx.doi.org/10.1016/S0020-0190(01)00172-7 2003-11-20 An Experimental Investigation of Geschke's Method of Global Program Optimization. 177-179 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Matwin77a 2003-11-20 On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. 287-290 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#FriedmanG78 2003-11-20 Almost Exact Minimum Feedback Vertex Set in Meshes and Butterflies. 59-64 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Luccio98 http://dx.doi.org/10.1016/S0020-0190(98)00039-8 2003-11-20 Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. 155-160 1976 5 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#FriedmanW76 2003-11-20 Reference Counting Can Manage the Circular Environments of Mutual Recursion. 41-45 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#FriedmanW79 2005-06-28 A Note on Isomorphic Chordal Rings. 339-341 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#NayakAG95 http://dx.doi.org/10.1016/0020-0190(95)00121-R 2003-11-20 A Note on Isomorphic Chordal Rings (Erratum). 115 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#NayakAG96 http://dx.doi.org/10.1016/0020-0190(95)00207-3 2003-11-20 An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion. 263-267 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#VelK88 2003-11-20 Recognition and dualization of disguised bidual Horn functions. 283-291 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#EiterIM02 http://dx.doi.org/10.1016/S0020-0190(01)00301-5 2003-11-20 A Tight Bound for Approximating the Square Root. 211-213 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BshoutyMST97 http://dx.doi.org/10.1016/S0020-0190(97)00126-9 2003-11-20 Data Compression in Limited Capacity Microcomputer Systems. 138-141 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#DavisRT81 2003-11-20 A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem in Undirected Planar Graphs. 83-86 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Coupry97 http://dx.doi.org/10.1016/S0020-0190(97)00153-1 2003-11-20 Confluence of Indirection Reductions in Graph Rewrite Systems. 143-148 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Broek88 2003-11-20 An improved testing scheme for catastrophic fault patterns. 199-206 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#NayakRS00 http://dx.doi.org/10.1016/S0020-0190(00)00012-0 2003-11-20 The Algorithmic Complexity of Colour Switching. 63-68 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#CheeL92 2003-11-20 On Fixed Priority Scheduling, Offsets and Co-Prime Task Periods. 65-69 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#AudsleyB98 http://dx.doi.org/10.1016/S0020-0190(98)00087-8 2003-11-20 Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. 189-193 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#FischerH94 2003-11-20 Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse. 175-181 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#FischerI87 2003-11-20 A Lower Bound for the Time to Assure Interactive Consistency. 183-186 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#FischerL82 2003-11-20 Storage Requirements for Fair Scheduling. 249-250 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#FischerP83 2003-11-20 Two Results on the List Update Problem. 301-306 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Irani91 2003-11-20 Smoothsort Revisited. 269-276 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#BronH91 2003-11-20 Multi-subsequence searching. 229-233 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Chen00a http://dx.doi.org/10.1016/S0020-0190(00)00057-0 2003-11-20 Coloring Random Graphs. 71-74 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#KrivelevichS98 http://dx.doi.org/10.1016/S0020-0190(98)00092-1 2003-11-20 A Randomized NC Algorithm for the Maximal Tree Cover Problem. 241-246 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Chen91a 2003-11-20 A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application. 243-248 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Chen92a 2003-11-20 A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. 191-193 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Chen92b 2003-11-20 A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. 265-271 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Chen94a 2003-11-20 SIMPLE: An Optimal Disk System with Two Restricted Heads. 273-277 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Chen95a http://dx.doi.org/10.1016/0020-0190(95)00112-P 2003-11-20 A Fast and Efficient NC Algorithm for Maximal Matching. 303-307 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Chen95b http://dx.doi.org/10.1016/0020-0190(95)00106-M 2003-11-20 On the Relationship Between Deterministic Time and Deterministic Reversal. 143-146 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Liskiewicz93 2003-11-20 Fault-tolerant algorithm for Fast Fourier Transform on hypercubes. 11-16 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#ChenC01 http://dx.doi.org/10.1016/S0020-0190(00)00170-8 2003-11-20 A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image. 25-29 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#ChenC94 2003-11-20 Compact Embedding of Binary Trees Into Hyperacubes. 69-72 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#ChenC95 http://dx.doi.org/10.1016/0020-0190(95)00010-A 2003-11-20 A fast modular multiplication algorithm for calculating the product AB modulo N. 77-81 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#ChenC99 http://dx.doi.org/10.1016/S0020-0190(99)00137-4 2003-11-20 Breadth-First Traversal of Trees and Integer Sorting in Parallel. 39-49 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#ChenD92 2003-11-20 Maintaining Visibility of a Polygon with a Moving Point of View. 269-275 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ChenD98 http://dx.doi.org/10.1016/S0020-0190(97)00211-1 2006-05-22 Testing a Simple Polygon for Monotonicity Optimally in Parallel. 325-331 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ChenG93 2003-11-20 Non-Associative Parallel Prefix Computation. 91-94 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#ChenH92 2003-11-20 A Neural Sorting Network with O(1) Time Complexity. 309-313 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#ChenH93 2003-11-20 Performance guarantees for the TSP with a parameterized triangle inequality. 17-21 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#BenderC00 http://dx.doi.org/10.1016/S0020-0190(99)00160-X 2003-11-20 Rectilinear Short Path Queries Among Rectangular Obstacles. 313-319 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#ChenK96 http://dx.doi.org/10.1016/0020-0190(96)00020-8 2003-11-20 Preemptive Scheduling of Independent Jobs on a Hypercube. 201-206 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ChenL88 2003-11-20 The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic. 131-136 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#ChenL93 2003-11-20 Dividing Strategies for the Optimization of a Test Suite. 135-141 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#ChenL96 http://dx.doi.org/10.1016/S0020-0190(96)00135-4 2003-11-20 On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph. 195-199 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#ChenM94 2003-11-20 Internal Path Length of the Binary Representation of Heap-Ordered Trees. 129-132 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#ChenN94 2003-11-20 A note on "Category and measure in complexity classes". 167-168 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#ChenT00 http://dx.doi.org/10.1016/S0020-0190(00)00017-X 2003-11-20 Computing the Optimal IO Sequences of a Protocol in Polynomial Time. 145-148 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#ChenT91 2003-11-20 A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem. 43-49 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ChenT93 2003-11-20 Traversing Binary Trees Simply and Cheaply. 197-200 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Morris79a 2003-11-20 The Value of an Array Facility in Prolog. 247-251 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#ChenW86 2003-11-20 A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs. 13-18 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#ChenW97 http://dx.doi.org/10.1016/S0020-0190(97)00088-4 2003-11-20 An Inheritance Flow Model for Class Hierarchy Analysis. 309-315 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#ChenW98 http://dx.doi.org/10.1016/S0020-0190(98)00072-6 2003-11-20 A More General Sufficient Condition for Partition Testing to be Better than Random Testing. 145-149 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#ChenY96 http://dx.doi.org/10.1016/0020-0190(95)00203-0 2003-11-24 <sub>3, 3</sub><sub>5</sub>-free graph with an application. 141-145 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00268-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#ChenZ02 2003-11-20 A Note on a Theorem of Barrington, Straubing and Thérien. 31-33 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Caussinus96 http://dx.doi.org/10.1016/0020-0190(96)00029-4 2003-11-20 An Algebraic Semantics of Notional Entailment Logic Cn. 117-121 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Cheng90 2003-11-20 A Graph Transformation Algorithm for Concurrency Control in a Partitioned Database. 43-48 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Cheng91 2003-11-20 Widest Empty L-Shaped Corridor. 277-283 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Cheng96 http://dx.doi.org/10.1016/0020-0190(96)00070-1 2003-11-20 On Covering Boyce-Codd Normal Forms. 218-223 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#KandziaM80 2003-11-20 Systematic Choice of Initial Points in Local Search: Extensions and Application to Neural Networks. 213-217 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#MorrisW91 2003-11-20 Factorization of de Bruijn digraphs by cycle-rooted trees. 269-275 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#KawaiFS01 http://dx.doi.org/10.1016/S0020-0190(00)00157-5 2003-11-20 On Estimating the Complexity of Logarithmic Decompositions. 321-324 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#BezemL88 2003-11-20 Program Development: From Enumeration to Backtracking. 193-197 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#BroyW80 2003-11-20 A Storage Scheme for Height-Balanced Trees. 231-232 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Brown78 2003-11-20 Some Observations on Random 2-3 Trees. 57-59 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Brown79 2003-11-20 An Improved BL Lower Bound. 37-39 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Brown80 2003-11-20 Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2. 281-287 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Middendorf93 2003-11-20 Computing the Relative Entropy Between Regular Tree Languages. 283-289 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Calera-RubioC98 http://dx.doi.org/10.1016/S0020-0190(98)00172-0 2003-11-20 Logic Programming with External Procedures: Introducing S-Unification. 159-165 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#LeszcylowskiBM88 2006-11-06 Improved bounds for dictionary look-up with one error. 57-59 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BrodalV00 http://dx.doi.org/10.1016/S0020-0190(00)00079-X 2003-11-20 On Simon's String Searching Algorithm. 95-99 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Hancart93 2003-11-20 Finitely Generated (Omega)o-Languages. 171-175 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#LatteuxT86 2003-11-20 Bifaithful Starry Transductions. 1-4 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#LatteuxT88 2003-11-20 A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. 243-248 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#TiwariT94 2003-11-20 Horner's Rule and the Computation of Linear Recurrences. 237-240 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#GriesPS87 2003-11-20 A Type Soundness Proof for Variables in LCF ML. 141-146 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#VolpanoS95 http://dx.doi.org/10.1016/0020-0190(95)00146-4 2003-11-20 LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. 1-12 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Minoux88 2003-11-20 A Fast Error Evaluation Algorithm for Polynomial Approximation. 18-21 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#ChinS77 2003-11-20 Efficient algorithm for transversal of disjoint convex polygons. 141-144 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ChinW02 http://dx.doi.org/10.1016/S0020-0190(01)00322-2 2003-11-24 Erratum to: "Efficient algorithm for transversal of disjoint convex polygons". 53 2003 85 Inf. Process. Lett. 1 http://www.sciencedirect.com/science/article/B6V0F-475BCSD-8/2/7cfb809b62cd32d8c92e89c824327de0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#ChinW03 2003-11-20 Minimum Vertex Distance Between Separable Convex Polygons. 41-45 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#ChinW84 2003-11-20 The symmetry number problem for trees. 73-79 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#ChinY01 http://dx.doi.org/10.1016/S0020-0190(00)00174-5 2003-11-20 Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane. 206-209 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#IriMM81 2003-11-20 The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). 11-17 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#TinhoferS86 2003-11-20 An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference. 151-158 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#BennaceurP93 2003-11-20 On Homomorphic Images of Transition Graphs. 14-15 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Nieminen75 2003-11-20 An Adaptive Algorithm for Finding a Covering Hypersphere. 7-10 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#WanW89 2003-11-20 Veto is Impossible in Secret Sharing Schemes. 293-295 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#ObanaK96 http://dx.doi.org/10.1016/0020-0190(96)00052-X 2003-11-20 A Short Proof of the Lexical Addressing Algorithm. 1-5 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Wand90 2003-11-20 An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons. 229-236 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Wang01 http://dx.doi.org/10.1016/S0020-0190(00)00229-5 2003-11-20 Some New Results on Isotonic Array Grammars. 129-131 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Wang80 2003-11-20 A New Hierarchy of Two-Dimensional Array Languages. 223-226 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Wang82 2003-11-20 Obtaining Lazy Evaluation with Continuations in Scheme. 93-97 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Wang90 2003-11-20 On the Complexity of the Extreme Points Decision Problem. 101-106 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Wang91 2003-11-20 An Improved Parallel Algorithm for Computing the Generalized Inverse A+. 243-251 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Wang92 2003-11-20 A New Routing Algorithm for Cyclic Shifts on BRGC Hypercubes. 165-169 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Wang94 2003-11-20 Some Results on Selectivity and Self-Reducibility. 81-87 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Wang95 http://dx.doi.org/10.1016/0020-0190(95)00073-L 2003-11-20 NP-Hard Sets are Superterse Unless NP is Small. 1-6 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Wang97 http://dx.doi.org/10.1016/S0020-0190(96)00189-5 2003-11-20 On Syntactic Nuclei of Rational Languages. 221-226 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Wang98 http://dx.doi.org/10.1016/S0020-0190(98)00120-3 2003-11-20 On the Complexity of Quality of Service Routing. 111-114 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Wang99 http://dx.doi.org/10.1016/S0020-0190(98)00206-3 2003-11-20 A Loopless Algorithm for Generating Binary Tree Sequences. 189-194 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Baronaigien91 2003-11-20 A Multi-Stack Method for the Fast Generation of Permutations with Minimal Length Increasing Subsequences. 123-126 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Baronaigien99 http://dx.doi.org/10.1016/S0020-0190(98)00208-7 2003-11-20 Padded Lists: Set Operations in Expected Theta(log log N) Time. 161-166 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Franklin79 2003-11-20 Edge Intersection on the Hypercube Computer. 257-262 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#NarayanaswamiF92 2003-11-20 <sup>n</sup>Efficiently. 205-210 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#NarayanaswamiL94 2003-11-20 Distributed similarity search algorithm in distributed heterogeneous multimedia databases. 35-42 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#LeeKLCC00 http://dx.doi.org/10.1016/S0020-0190(00)00068-5 2003-11-20 Representation of Binary Trees on Associative Memories. 1-5 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Minsky73 2003-11-20 Optimal Speedup of Las Vegas Algorithms. 173-180 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#LubySZ93 2003-11-24 Simulating finite automata with context-free grammars. 339-344 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00316-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#DomaratzkiPS02 2003-11-20 Generalized Closed World Assumptions is Pi^0_2-Complete. 289-291 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#ChomickiS90 2003-11-20 On a Setup Optimization Problem for Interval Orders. 51-55 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#ShararyZ92 2003-11-20 An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p). 94-95 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#CalmetL80 2003-11-20 Load Imbalance in DASD Dynamic Reconnection. 111-119 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Brandwajn88 2003-11-20 The Homogeneous Set Sandwich Problem. 31-35 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#CerioliEFK98 http://dx.doi.org/10.1016/S0020-0190(98)00076-3 2003-11-20 A variant of Reiter's hitting-set algorithm. 45-51 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Wotawa01 http://dx.doi.org/10.1016/S0020-0190(00)00166-6 2003-11-20 The Generation of Random Permutations on the Fly. 207-212 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#BrassardK88 2003-11-20 Nonserial Dynamic Programming Formulations of Satisfiability. 323-326 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Fernandez-Baca88 2003-11-20 Semantics of a Declarative Language. 147-151 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#MintsT86 2003-11-20 Corrigendum: Semantics of a Declarative Language. 139 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#MintsT87 2003-11-20 A New Approach to Optimal Cache Scheduling. 303-310 1989 30 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Vogt89 2003-11-20 The Average Height of a Node in the BANG Abstract Directory Tree. 55-61 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#TaylorHS97 http://dx.doi.org/10.1016/S0020-0190(96)00187-1 2003-11-20 Broadcast Scheduling in Packet Radio Networks by Hopfield Neural networks. 271-276 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#WeiC97 http://dx.doi.org/10.1016/S0020-0190(97)00108-7 2003-11-20 Worst-Case Performance of Some Heuristics for Steiner's Problem in Directed Graphs. 99-105 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Voss93 2003-11-20 Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems. 161-167 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Wein91 2006-06-12 Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair. 311-316 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#ChoeC86 2003-11-20 On Finding All Unilaterally Connected Components of a Digraph. 8-10 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Arjomandi76 2003-11-24 Worst case analysis of a greedy algorithm for graph thickness. 333-337 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00432-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KawanoY03 2003-11-25 A type system for the push-enter model. 205-211 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00282-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#ChoiH03 2003-11-20 A Controlled Quantification in Parsing of Montague Grammar. 207-216 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#ChoiK86 2003-11-20 Hybrid Join: An Improved Sort-Based Join Algorithm. 51-56 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ChoiK89 2004-09-10 Dynamic Suffix Tree and Two-Dimensional Texts Management. 213-220 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#ChoiL97 http://dx.doi.org/10.1016/S0020-0190(97)00018-5 2003-11-20 Counter Machines. 193-197 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Wojna99 http://dx.doi.org/10.1016/S0020-0190(99)00116-7 2003-11-20 On the evolution of the worst-case OBDD size. 1-7 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#GroplPS01 http://dx.doi.org/10.1016/S0020-0190(00)00148-4 2003-11-20 A Note on the Complexity of a Partition Algorithm. 117-120 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#LifschitzP83 2003-11-20 A Communication-Privacy Tradeoff for Modular Addition. 205-210 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#ChorK93 2003-11-20 Yet Another Distributed Depth-First-Search Algorithm. 301-305 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Cidon88 2003-11-20 Numerical Methods for Solving Integral Equations of Potential Problems. 121-124 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#WolfM75 2003-11-20 Numerical Solution of Integral Equations for Potential Problems by a Variational Principle. 136-139 1976 4 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#WolfM76 2003-11-20 Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis. 163-169 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Babaoglu87 2003-11-20 An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. 147-151 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Larmore90 2003-11-20 Linear complexity of the Naor-Reingold pseudo-random function. 95-99 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Shparlinski00 http://dx.doi.org/10.1016/S0020-0190(00)00133-2 2003-11-20 <sup><sup>2</sup></sup>. 109-113 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Shparlinski02 http://dx.doi.org/10.1016/S0020-0190(01)00315-5 2003-11-20 Absence of Individual Starvation Using Weak Semaphores. 159-162 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Udding86 2003-11-20 The Area-Time Complexity of the VLSI Counter. 397-400 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Vrto87 2003-11-20 A Proof of the Determinacy Property of the Data Flow Schema. 13-16 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#WooSA84 2003-11-20 Orienting Graphs to Optimize Reachability. 229-235 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#HakimiSY97 http://dx.doi.org/10.1016/S0020-0190(97)00129-4 2003-11-20 Symmetric Matrix-Vector Product on a Ring of Processors. 239-248 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#GriggMR90 2006-01-23 A New Approach to Choosing Initial Points in Local Search. 67-72 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#WongM89 2003-11-20 Recognizing Strict 2-Threshold Graphs in O(m) Time. 193-198 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#PetreschiS95a http://dx.doi.org/10.1016/0020-0190(95)00030-G 2003-11-20 A Counterexample to the Generalized Aanderaa-Rosenberg Conjecture. 154-155 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Illies78 2003-11-20 Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem. 119-121 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Wilf84 2003-11-20 Representing Matrices as Quadtrees for Parallel Processors. 195-199 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Wise85 2003-11-20 Stop-and-Copy and One-Bit Reference Counting. 243-249 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Wise93 2003-11-20 ECT - An Extensible-Contractable Translator System. 97-99 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#SolntseffY72 2003-11-20 A Note on Presburger Arithmetic with Array Segments, Permutation and Equality. 33-35 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Rosier86 2003-11-20 An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs. 163-169 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#JaumardM86 2003-11-20 On the Complexity of the Maximum Satisfiability Problem for Horn Formulas. 1-4 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#JaumardS87 2003-11-20 A Generalized Notion of Semantic Independence. 5-9 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#FranzleSW95 http://dx.doi.org/10.1016/0020-0190(94)00168-X 2003-11-20 Approximate Center Points in Dense Point Sets. 271-278 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Verbarg97 http://dx.doi.org/10.1016/S0020-0190(97)00017-3 2003-11-20 An Improvement to Immediate Error Detection in Strong LL(1) Parsers. 211-212 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#MauneyF81 2003-11-20 A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. 197-203 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#CattellDF96 http://dx.doi.org/10.1016/0020-0190(95)00190-5 2003-11-20 Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion. 215-219 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#CusickS96 http://dx.doi.org/10.1016/S0020-0190(96)00164-0 2003-11-20 On finding medians of weighted discrete points. 103-106 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Chung00 http://dx.doi.org/10.1016/S0020-0190(00)00049-1 2003-11-20 Indexed Extendible Hashing. 1-6 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Chung92 2003-11-20 Efficient Huffman Decoding. 97-99 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Chung97 http://dx.doi.org/10.1016/S0020-0190(96)00204-9 2003-11-20 Output-Sensitive Peeling of Convex and Maximal Layers. 255-259 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Nielsen96 http://dx.doi.org/10.1016/0020-0190(96)00116-0 2003-11-20 Approximation the Pathwidth of Outerplanar Graphs. 17-23 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GovindanLY98 http://dx.doi.org/10.1016/S0020-0190(98)00139-2 2003-11-20 Some Characterizations of Finitely Specifiable Implicational Dependency Families. 153-158 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Taghva86 2003-11-20 Multidimensional Tries Used for Associative Searching. 150-157 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Orenstein82 2003-11-20 Deciding k-colorability in expected polynomial time. 1-6 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Krivelevich02 http://dx.doi.org/10.1016/S0020-0190(01)00187-9 2003-11-20 A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems. 301-303 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#DrysdaleJ89 2003-11-20 On-Line Computation of Transitive Closures of Graphs. 95-97 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#IbarakiK83 2003-11-20 Some Problems Concerning Keys for Relation Schemes and Relations in the Relational Datamodel. 179-184 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#DemetrovicsT93 2003-11-20 Comments on ``A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases''. 45-52 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Wong89 2003-11-20 The Contour Problem for Rectilinear Polygons. 229-236 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Wood84 2003-11-20 A Note Concerning Top Down Program Development and Restricted Exit Control Structures. 8-12 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#CherniavskyKH79 2003-11-20 On Gallery Watchmen in Grids. 99-102 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Ntafos86 2003-11-20 The Robber Route Problem. 59-63 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Ntafos90 2003-11-20 A Note on a Conjecture Concerning Symmetric Resilient Functions. 139-143 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#GopalakrishnanHS93 2003-11-20 Erratum: Evading the Drift in Floating-Point Addition. 164 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#ReiserK75a 2004-12-07 A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C. 108-112 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Roussopoulos73 2003-11-20 Traversing Graphs in a Paging Environment, BFS or DFS? 143-147 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Jiang91 2003-11-20 I/O-and CPU-Optimal Recognition of Strongly Connected Components. 111-115 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Jiang93 2003-11-20 General Programs for Management Systems. 17-20 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Merrett71 2003-11-20 Relations as Programming Language Elements. 29-33 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Merrett77 2003-11-20 QT Logic: Simpler and More Expressive Than Predicate Calculus. 251-255 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Merrett78 2003-11-20 Recovering distributed objects. 143-150 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#JamesS01 http://dx.doi.org/10.1016/S0020-0190(00)00211-8 2003-11-24 Packing triangles in bounded degree graphs. 175-180 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00274-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#CapraraR02 2003-11-20 Improving a Family of Approximation Algorithms to Edge Color Multigraphs. 11-15 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#CapraraR98 http://dx.doi.org/10.1016/S0020-0190(98)00138-0 2003-11-20 Checker for Data Structures which Sort Elements. 245-249 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Wierzbowska97 http://dx.doi.org/10.1016/S0020-0190(97)00167-1 2004-09-09 The NPO-Completeness of the Longest Hamiltonian Cycle Problem. 119-123 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#WuCL98 http://dx.doi.org/10.1016/S0020-0190(98)00003-9 2003-11-20 An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. 63-67 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#WuCT99 http://dx.doi.org/10.1016/S0020-0190(98)00194-X 2003-11-20 Reduction of Page Swaps on the Two Dimensional Transforms in a Paging Environment. 137-140 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Itano79 2003-11-20 Linear Decision Trees are too Weak for Convex Hull Problem. 138-141 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Jaromczyk81 2003-11-20 A Simple Linear-Time Algorithm for the Recognition of Bandwidth-2 Biconnected Graphs. 103-107 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#MakedonSW93 2003-11-20 Fault-Tolerant Routings in a kappa-Connected Network. 171-175 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ImaseM88 2003-11-20 Init and Anf Operating on omega-Languages. 265-269 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Freund83 2003-11-20 A Syntax-Free Semantics for the APL Operators. 128-131 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#ElgotPS82 2003-11-20 Application of Exponential Hetero-Associative Memory on Frequency Classifier. 305-311 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#WuWT90 2003-11-20 An in Situ Distributive Sort. 265-270 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Handley86 2003-11-20 A Space Efficient Distributive Sort. 75-78 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Handley91 2003-11-20 An Almost-Constant Round Interactive Zero-Knowledge Proof. 81-87 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Burmester92 2003-11-20 Finding Succinct Ordered Minimal Perfect Hash Functions. 283-288 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#SeidenH94 2003-11-20 Degree Constrained Tree Embedding Into Points in the Plane. 211-214 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#TamuraT92 2003-11-20 On Approximating the Minimum Independent Dominating Set. 197-200 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Irving91 2003-11-20 On characterizing the existence of partial one-way permutations. 165-171 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#RotheH02 http://dx.doi.org/10.1016/S0020-0190(01)00269-1 2003-11-20 A Notion of Information Related to Computation. 207-215 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#ZenzoBM97 http://dx.doi.org/10.1016/S0020-0190(97)00171-3 2003-11-20 A Decomposition Strategy for the Vertex Cover Problem. 299-304 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#BertolazziS89 2003-11-20 An Algorithm for Dynamic Data Allocation in Distributed Systems. 113-119 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#WolfsonJ95 http://dx.doi.org/10.1016/0020-0190(94)00182-X 2003-11-20 On Multiset Orderings. 57-63 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#JouannaudL82 2003-11-20 On a generalized modularization theorem. 65-71 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#DimitrakosM00 http://dx.doi.org/10.1016/S0020-0190(00)00037-5 2003-11-20 Identity Assignment in Uniform Synchronous Rings. 257-262 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#WuuH94 2003-11-20 Optimal Policy for Database Backup and Recovery. 55-58 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#HatzopoulosK81 2003-11-20 Homogeneous grammars with a reduced number of non-context-free productions. 253-257 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#MedunaK02 http://dx.doi.org/10.1016/S0020-0190(01)00224-1 2003-11-20 Algorithms counting monotone Boolean functions. 203-209 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#FidytekMSS01 http://dx.doi.org/10.1016/S0020-0190(00)00230-1 2003-11-20 Code migration and program maintainability A categorical perspective. 249-254 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#GarciaH01 http://dx.doi.org/10.1016/S0020-0190(00)00224-6 2004-01-09 Using Total Monotonicity for Two Optimization Problems on the Plane. 13-17 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#GarciaT96 http://dx.doi.org/10.1016/S0020-0190(96)00139-1 2003-11-25 Axiomatizing functional dependencies in the Higher-Order Entity-Relationship Model. 133-137 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00267-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HartmannHLS03 2003-11-20 Graph 2-Isomorphism is NP-Complete. 68-72 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Yao79a 2003-11-20 The Path-Partition Problem in Block Graphs. 317-322 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#YanC94 2003-11-20 A Fuzzy Clustering Algorithm for Graph Bisection. 259-263 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#YanH94 2003-11-20 Counting k-Subsets and Convex k-gons in the Plane. 149-151 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#RoteWZW91 2003-11-20 Minimal Visibility Graphs. 49-53 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#CampbellH91 2003-11-20 Commutativity, Non-Commutativity, and Bilinearity. 46-49 1976 5 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Probert76 2003-11-20 A concept-based query evaluation with indefinite fuzzy triples. 209-214 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Yang00 http://dx.doi.org/10.1016/S0020-0190(00)00066-1 2003-11-20 New Enumeration Results About the Optical Orthogonal Codes. 85-87 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Yang91 2003-11-20 New Binary Sequences with Perfect Staircase Profile of Linear Complexity. 27-29 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Yang93 2003-11-20 A Better Subgraph of the Minimum Weight Triangulation. 255-258 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Yang95 http://dx.doi.org/10.1016/0020-0190(95)00164-5 2003-11-20 A Data-Parallel Algorithm for Minimum-Width Tree Layout. 21-28 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Yang98 http://dx.doi.org/10.1016/S0020-0190(98)00081-7 2003-11-20 On the Average Number of Maxima in a Set of Vectors. 63-65 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Buchta89 2003-11-20 On Saving Space in Parallel Computation (Note). 327-329 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Hagerup88 2003-11-20 Hybridsort Revisited and Parallelized. 35-39 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Hagerup89 2003-11-20 On a Compaction Theorem of Ragde. 335-340 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Hagerup92 2003-11-20 The Parallel Complexity of Integer Prefix Summation. 59-64 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Hagerup95 http://dx.doi.org/10.1016/0020-0190(95)00119-W 2003-11-25 A notion of cross-perfect bipartite graphs. 143-147 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Dawande03 2003-11-20 Complexity of homomorphisms to direct products of graphs. 175-178 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#BukiS02 http://dx.doi.org/10.1016/S0020-0190(01)00225-3 2003-11-20 Prefix-Free Languages as omega-Generators. 61-65 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Litovsky91 2003-11-20 A Note on Well Quasi-Orderings for Powersets. 155-160 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Jancar99 http://dx.doi.org/10.1016/S0020-0190(99)00149-0 2003-11-20 Worst case examples for operations on OBDDs. 91-96 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Wegener00 http://dx.doi.org/10.1016/S0020-0190(00)00053-3 2003-11-20 A simplified correctness proof for a well-known algorithm computing strongly connected components. 17-19 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Wegener02 http://dx.doi.org/10.1016/S0020-0190(01)00306-4 2003-11-20 Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic. 81-83 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Wegener82 2003-11-20 Relating Monotone Formula Size and Monotone Depth of Boolean Functions. 41-42 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Wegener83 2003-11-20 Optimal Search With Positive Switch Cost is NP-Hard. 49-52 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Wegener85 2003-11-20 Efficient Simulation of Circuits by Erew Prams. 99-102 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Wegener90 2003-11-20 Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions. 85-87 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Wegener93 2003-11-20 On the Complexity of Encoding in Analog Circuits. 49-52 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Wegener96 http://dx.doi.org/10.1016/S0020-0190(96)00137-8 2003-11-20 Stack Implementation of Shallow Binding in Languages with Mixed Scoping. 143-154 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Prini79 2003-11-20 Towards Optimal Distributed Election on Chordal Rings. 265-270 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#KalamboukisM91 2003-11-20 VLSI Layouts of Complete Graphs and Star Graphs. 39-45 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#YehP98 http://dx.doi.org/10.1016/S0020-0190(98)00133-1 2003-11-20 The Weighted Perfect Domination Problem. 295-299 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#YenL90 2003-11-20 Shared Authentication Token Secure Against Replay and Weak Key Attacks. 77-80 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#YenL97 http://dx.doi.org/10.1016/S0020-0190(97)00046-X 2003-11-20 DFS-Traversing Graphs in a Paging Environment, LRU or MRU? 193-196 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Jiang91a 2003-11-20 Optimal Vertex Ordering of Graphs. 149-154 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#JiangB99 http://dx.doi.org/10.1016/S0020-0190(99)00148-9 2003-11-20 A Note on the Space Complexity of Some Decision Problems for Finite Automata. 25-31 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#JiangR91 2003-11-20 Parallel / Sequential Array Automata. 43-46 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#RosenfeldM73 2003-11-20 A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. 111-118 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#CapraraKP00 http://dx.doi.org/10.1016/S0020-0190(00)00010-7 2003-11-20 Square Rooting by Iterative Multiply-Additions. 267-269 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#ItoTY96 http://dx.doi.org/10.1016/S0020-0190(96)00167-6 2003-11-20 A Hash-Based Join Algorithm for a Cube-Connected Parallel Computer. 269-275 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#OmiecinskiT89 2003-11-20 Hierarchical Broadcast Networks. 303-305 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Fraigniaud98 http://dx.doi.org/10.1016/S0020-0190(98)00179-3 2003-11-20 Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. 47-53 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#KirousisST96 http://dx.doi.org/10.1016/0020-0190(95)00198-0 2003-11-20 An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m). 111-114 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#ItohT89 2003-11-20 A network-flow-based lower bound for the minimum weighted integer coloring problem. 45-50 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#XueL00 http://dx.doi.org/10.1016/S0020-0190(00)00121-6 2003-11-20 ²) algorithm for single connectedness". 263 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Khuller00 http://dx.doi.org/10.1016/S0020-0190(00)00054-5 2003-11-20 On Computing Graph Closures. 249-255 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Khuller89 2003-11-20 Coloring Algorithms for K_5-Minor Free Graphs. 203-208 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Khuller90 2003-11-20 An O(|V|2) algorithm for single connectedness. 105-107 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Khuller99 http://dx.doi.org/10.1016/S0020-0190(99)00135-0 2003-11-20 Programmed Deallocation Without Dangling Reference. 179-187 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#CioniK84 2003-11-20 Shortest Path Computations in Source-Deplanarized Graphs. 71-75 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#FredericksonHT93 2003-11-20 n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom. 303-307 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#RazborovW93 2003-11-20 Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. 209-215 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#KucherovR95 http://dx.doi.org/10.1016/0020-0190(94)00188-5 2003-11-20 A New Method to Solve Non-Linear Equations. 75-79 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#RoyAGR94 2003-11-20 A Family of Rules for Recursion Removal. 174-177 1976 5 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#PartschP76 2005-02-16 An Optimal Parallel Circle-Cover Algorithm. 3-6 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#SarkarS89 2003-11-25 Minimum feedback vertex sets in shuffle-based interconnection networks. 191-196 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00504-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#KralovicR03 2003-11-20 Generation and Ranking of k-ary Trees. 44-48 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Zaks82 2003-11-20 A Faster Parallel Algorithm for k-Connectivity. 265-269 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#IwamaIO97 http://dx.doi.org/10.1016/S0020-0190(97)00015-X 2003-11-20 The Readers and Writers Problem Avoided. 159-162 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Kessels80 2003-11-20 An Exercise in Proving Self-Stabilization with a Variant Function. 39-42 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Kessels88 2003-11-20 The Complexity of Symmetric Functions in Bounded-Depth Circuits. 217-219 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#BrustmannW87 2003-11-25 Improvement of the Miyazaki-Takaragi threshold digital signature scheme. 183-186 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#WuHLH03 2003-11-20 A Fast Compacting Garbage Collector. 167-169 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Zave75 2003-11-20 A Series Expansion Involving the Harmonic Numbers. 75-77 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Zave76 2003-11-20 An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility. 359-365 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#KimPCSC95 http://dx.doi.org/10.1016/0020-0190(94)00220-S 2003-11-20 Time Efficient Deadlock Resolution Algorithms. 149-154 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#TerekhovC99 http://dx.doi.org/10.1016/S0020-0190(98)00203-8 2003-11-20 Hypothetical Reasoning in Logic Programming: A Semantic Approach. 285-291 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#BrogiLM90 2003-11-20 On rewrite constraints and context unification. 35-40 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#NiehrenTT00 http://dx.doi.org/10.1016/S0020-0190(00)00036-3 2003-11-20 Average-Case Scalable On-Line Algorithms for Fault Replacement. 131-136 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Pruhs94 2003-11-20 A Fast Algorithm for Copying Binary Trees. 62-63 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Clark75 2003-11-20 A Linear Time Algorithm for Graph Partition Problems. 19-24 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ClarkSS92 2003-11-20 NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path. 243-248 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#VenemaSS96 http://dx.doi.org/10.1016/S0020-0190(96)00172-X 2003-11-20 Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems. 307-312 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#KarlssonO88 2003-11-20 Algorithms for transitive closure. 289-296 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#KoubkovaK02 http://dx.doi.org/10.1016/S0020-0190(01)00245-9 2003-11-20 HCB-Tree: A Height Compressed B-Tree for Parallel Processing. 213-220 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#PramanikK88 2003-11-20 The Maximum k-Colorable Subgraph Problem for Chordal Graphs. 133-137 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#YannakakisG87 2003-11-20 Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. 168-173 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#OvermarsL81a 2003-11-20 Fault Diameter of Star Graphs. 243-251 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#RouskovS93 2003-11-20 An Approximation Result for a Duo-Processor Task Scheduling Problem. 195-200 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#DellOlmoGS97 http://dx.doi.org/10.1016/S0020-0190(96)00196-2 2003-11-20 Security of Tseng-Jan's group signature schemes. 187-189 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#LiHCCTC00 http://dx.doi.org/10.1016/S0020-0190(00)00110-1 2003-11-20 An Algorithm to Find Polygon Similarity. 105-206 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#BoreddyM89 2003-11-20 An O(NP) Sequence Comparison Algorithm. 317-323 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#WuMMM90 2003-11-20 The Tree Representation of the Graph Used in Binary Image Processing. 55-59 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#YuLW91 2003-11-20 An Efficient Finite-State Machine Implementation of Huffman Decoders. 271-275 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#IyengarC97 http://dx.doi.org/10.1016/S0020-0190(97)00176-2 2003-11-20 On Approximating the Memory-Constrained Module Allocation Problem. 205-208 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Roupin97 http://dx.doi.org/10.1016/S0020-0190(97)00008-2 2003-11-20 Sequential and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs. 7-11 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#YuTC93 2003-11-20 A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. 255-261 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#DaiIK97 http://dx.doi.org/10.1016/S0020-0190(97)00175-0 2003-11-20 An Approximation Algorithm for the General Routing Problem. 333-339 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Jansen92 2003-11-20 A Simple Optimal Parallel Algorithm for the Minimum Coloring Problem on Interval Graphs. 47-51 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#YuY93a 2003-11-20 A New Distributed Breadth-First-Search Algorithm. 329-334 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#ZhuC87 2003-11-20 A Unified Linear-Time Algorithm for Computing Distance Maps. 129-133 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Hirata96 http://dx.doi.org/10.1016/0020-0190(96)00049-X 2003-11-20 Constructing Simply Recursive Programs from a Finite Set of Good Examples. 225-230 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Hirata97 http://dx.doi.org/10.1016/S0020-0190(97)00185-3 2003-11-20 Shortest Path and Closure Algorithms for Banded Matrices. 317-322 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#AllisonDY91 2003-11-20 The Communication Complexity for Decentralized Evaluation of Functions. 177-182 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Yuan90 2003-11-20 Topological Properties of Supercube. 241-245 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Yuan91 2003-11-20 Logic Program Semantics and Circumscription of Autoepistemic Theories. 159-164 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Yuan94 2003-11-20 Evolutionary computing. 1-6 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#EibenS02 http://dx.doi.org/10.1016/S0020-0190(02)00204-1 2003-11-20 A New Variation on Hypercubes with Smaller Diameter. 275-280 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ChedidC93 2003-11-20 Relativized Worlds with an Infinite Hierarchy. 309-313 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Fortnow99 http://dx.doi.org/10.1016/S0020-0190(99)00034-4 2003-11-20 Finding a Target Subnetwork in Sparse Networks with Random Faults. 297-303 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#FraigniaudKP93 2003-11-24 On-line restricted assignment of temporary tasks with unknown durations. 67-72 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00350-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#ArmonAER03 2003-11-20 A Secure and Useful `Keyless Cryptosystem'. 35-38 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Yung85 2003-11-20 Two Pyramid Machine Algorithms for Sdge Detection in Noisy Binary Images. 197-202 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#GangolliT83 2003-11-20 In-Place Sorting with Fewer Moves. 31-37 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#KatajainenP99 http://dx.doi.org/10.1016/S0020-0190(99)00038-1 2003-11-25 Differential and linear cryptanalysis for 2-round SPNs. 277-282 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00333-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#ChunKLSY03 2003-11-20 Lower bounds for approximate polygon decomposition and minimum gap. 137-141 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#GudmundssonHL02 http://dx.doi.org/10.1016/S0020-0190(01)00203-4 2003-11-20 A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. 295-299 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#SteigerS95 http://dx.doi.org/10.1016/0020-0190(94)00201-9 2003-11-20 A note concerning the closest point pair algorithm. 193-195 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Richards02 http://dx.doi.org/10.1016/S0020-0190(01)00268-X 2003-11-20 Shape Distribution of Height-Balanced Trees. 17-20 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Richards83 2003-11-20 Data Compression and Gray-Code Sorting. 201-205 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Richards86 2003-11-20 On the Space Complexity of Recursive Algorithms. 267-271 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#GurariI79 2003-11-20 On-Line Construction of the Convex Hull of a Simple Polyline. 11-12 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Melkman87 2003-11-20 Some Remarks on Subclass Containment Problems for Several Classes of DPDA's. 9-12 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Oyamaguchi84 2005-09-16 Robust, Centralized Certifier Based Concurrency Control for Distributed Databases. 105-110 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#ReddyBP82a 2003-11-20 On the Size of Projections: I. 18-21 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#GelenbeG82 2003-11-20 A General Method for Avoiding Cycling in a Network. 251-253 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Golumbic87 2003-11-20 Enclosures: An Access Control Mechanism with Applications in Parallel Programming and Other Areas of System Programming. 125-135 1976 5 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#DelcourD76 2003-11-20 Strictness Analysis of the Untyped lambda-Calculus. 121-125 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Mishra88 2003-11-20 Computability of Affine Non-Conditional Recurrent Systems. 291-295 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#SaouterV99 http://dx.doi.org/10.1016/S0020-0190(99)00024-1 2003-11-20 An Algorithm for Finding Clique Cut-Sets. 31-32 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Whitesides81 2003-11-20 Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. 111-117 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Frieze87 2003-11-20 On the Random Construction of Heaps. 103-109 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Frieze88 2003-11-20 Maintaining a Topological Order Under Edge Insertions. 53-58 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Marchetti-SpaccamelaNR96 http://dx.doi.org/10.1016/0020-0190(96)00075-0 2003-11-20 On Undecidability of Propositional Temporal Logics on Trace Systems. 147-153 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Penczek92 2003-11-20 A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. 43-50 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#FreundK00 http://dx.doi.org/10.1016/S0020-0190(00)00065-X 2003-11-20 Further Comments on the Subtree Isomorphism for Ordered Trees. 255-256 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Grossi91a 2003-11-25 Ring embedding in faulty pancake graphs. 271-275 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00510-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#HungHLH03 2006-07-12 Simple and Efficient String Matching with k Mismatches. 113-120 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#GrossiL89 2003-11-20 <sup>p</sup><sub>2</sub>. 209-211 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Schoning83 2003-11-20 On Random Reductions from Sparse Sets to Tally Sets. 239-241 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Schoning93 2003-11-20 Edit distance of run-length encoded strings. 307-314 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ArbellLM02 http://dx.doi.org/10.1016/S0020-0190(02)00215-6 2003-11-20 Lazy Update: An Efficient Implementation of LRU Stacks. 81-84 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#BarrigaA95 http://dx.doi.org/10.1016/0020-0190(95)00003-U 2003-11-20 Grammatical Interface for Even Linear Languages Based on Control Sets. 193-199 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Takada88 2003-11-20 On the Equity of Mutual Exclusion Algorithms in Distributed Systems. 19-22 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Greenwood95 http://dx.doi.org/10.1016/0020-0190(95)00107-N 2003-11-20 A fast algorithm for computing large Fibonacci numbers. 243-246 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Takahashi00 http://dx.doi.org/10.1016/S0020-0190(00)00112-5 2003-11-20 Prefixes of Infinite Words and Ambiguous Context-Free Languages. 211-216 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#AutebertFG87 2003-11-20 Semantics-Directed Compilation of Nonlinear Patterns. 315-322 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Danvy91 2003-11-20 Exact Learning when Irrelevant Variables Abound. 233-239 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#GuijarroLR99 http://dx.doi.org/10.1016/S0020-0190(99)00063-0 2003-11-20 A Simple Randomized Parallel Algorithm for Maximal f-Matchings. 83-87 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#GarridoJLR96 http://dx.doi.org/10.1016/0020-0190(95)00179-4 2003-11-20 A Context-Free Syntax of ALGOL 68. 141-148 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#BranquartCDL72 2003-11-20 An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm. 25-27 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Iwano89 2003-11-20 lambda_beta' - A - lambda-Calculus with a Generalized beta-Reduction Rule. 45-53 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Oberoi95 http://dx.doi.org/10.1016/0020-0190(94)00225-N 2003-11-20 A Note on the Monotone Complexity of 2-REF. 117-123 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Clote96 http://dx.doi.org/10.1016/0020-0190(96)00002-6 2003-11-20 Programmed Simulation of Race Hazards in Sequential Circuits. 11-13 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#ZissosD71 2003-11-20 Approximating Matchings in Parallel. 115-118 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#FischerGHP93 2003-11-20 Edge-Disjoint Branching in Directed Multigraphs. 24-27 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Shiloach79 2003-11-20 Another Look at the Degree Constrained Subgraph Problem. 89-92 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Shiloach81 2003-11-20 An Undecidable Fragment of the Theory of Set Constraints. 147-151 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Charatonik98 http://dx.doi.org/10.1016/S0020-0190(98)00152-5 2003-11-20 Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems. 37-41 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Krivanek86 2003-11-20 On the complexity of one-shot translational separability. 187-194 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#SchwarzerS02 http://dx.doi.org/10.1016/S0020-0190(01)00333-7 2003-11-20 A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks. 199-202 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Raynal87 2003-11-20 Prime Numbers as a Tool to Design Distributed Algorithms. 53-58 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Raynal89 2003-11-20 A Size-Depth Trade-Off for the Analog Computation of Boolean Functions. 251-254 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#TuranV96 http://dx.doi.org/10.1016/0020-0190(96)00120-2 2003-11-20 Concerning the Size of Logical Clocks in Distributed Systems. 11-16 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Charron-Bost91 2003-11-20 Decomposing a Star Graph Into Disjoint Cycles. 125-129 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#QiuMA91 2003-11-20 Unification of Kinded Infinite Trees. 323-328 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Vasconcelos95 http://dx.doi.org/10.1016/0020-0190(95)00100-Q 2003-11-20 Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems. 91-95 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Kruijer79 2003-11-20 A Constructive Proof of Vizing's Theorem. 131-133 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#MisraG92 2003-11-20 Optimal Chain Partitions of Trees. 24-26 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#MisraT75 2004-06-08 The Diameter of the Cube-Connected Cycles. 157-160 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#FrisHL97 http://dx.doi.org/10.1016/S0020-0190(97)00013-6 2003-11-20 Aliasing Among Pointers in EUCLID. 76-79 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Schwartz79 2003-11-20 Finding the Minimum Distance Between Two Convex Polygons. 168-170 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Schwartz81 2003-11-20 An Inproved Algorithm for Retrieving Fuzzy Information from Two Systems. 63-66 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Ait-BouziadK98 http://dx.doi.org/10.1016/S0020-0190(97)00220-2 2003-11-20 The Tree-to-Tree Editing Problem. 184-186 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Selkow77 2003-11-20 New Bounds for the Clique Number of a Graph. 173-174 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Selkow78 2003-11-20 On Budget-Constrained Flow Improvement. 291-297 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#SchwarzK98 http://dx.doi.org/10.1016/S0020-0190(98)00070-2 2003-11-20 A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics. 73-78 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#BonnierNN91 2003-11-20 Improved bounds for asymmetric communication protocols. 205-209 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#LaberH02 http://dx.doi.org/10.1016/S0020-0190(01)00332-5 2003-11-20 Some Pursuit-Evasion Problems on Grids. 241-247 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Dawes92 2003-11-20 Genetic Algorithm for Feature Selection for Parallel Classifiers. 163-168 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Kuncheva93 2003-11-20 Expected Complexity of Fast Search with Uniformly Distributed Data. 4-7 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#LewisBB81 2003-11-20 Optimal Packing and Covering in the Plane are NP-Complete. 133-137 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#FowlerPT81 2003-11-20 Exact Solutions for the Construction of Optimal Length Test Sequences. 275-280 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#RodriguesU93 2003-11-20 Selftype is a Special Case. 221-224 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Sakkinen91 2003-11-20 Application of a stochastic name-passing calculus to representation and simulation of molecular processes. 25-31 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#PriamiRSS01 http://dx.doi.org/10.1016/S0020-0190(01)00214-9 2003-11-20 An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. 145-151 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#KishoreS00 http://dx.doi.org/10.1016/S0020-0190(00)00101-0 2003-11-20 The Generalized Supplementary Magic-Sets Transformation for Stratified Datalog. 31-41 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#MeskesN93 2003-11-20 A Proof Rule for Multiple Coroutine Systems. 141-143 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Pritchard76 2003-11-20 A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order. 337-341 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Pritchard95 http://dx.doi.org/10.1016/0020-0190(95)00165-4 2003-11-20 An Old Sub-Quadratic Algorithm for Finding Extremal Sets. 329-334 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Pritchard97 http://dx.doi.org/10.1016/S0020-0190(97)00084-7 2003-11-20 Point Representation and Hashing of an Interval. 201-203 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#BarkleyL89 2003-11-20 A String-Matching Algorithm for the CREW PRAM. 257-259 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#AlmeidaB93 2003-11-20 On Learning from Queries and Counterexamples in the Presence of Noise. 279-284 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Sakakibara91 2003-11-20 Head-Strictness is Not a Monotonic Abstract Property. 195-198 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Kamin92 2003-11-20 A Note on Inferring Uniquely Terminating Code Languages. 217-222 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#EmeraldST99 http://dx.doi.org/10.1016/S0020-0190(99)00065-4 2003-11-20 A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds. 241-248 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GuruswamiR98 http://dx.doi.org/10.1016/S0020-0190(98)00169-0 2003-11-20 <sup>2</sup><sup>0</sup><sub>1</sub>-hard. 27-33 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Talbot00 http://dx.doi.org/10.1016/S0020-0190(00)00030-2 2003-11-20 Some Properties of a Centroid of a Free Tree. 18-20 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#KangA75 2003-11-20 A Parallel Bucket Sort. 57-61 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Chlebus88 2003-11-20 Parallel Iterated Bucket Sort. 181-183 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Chlebus89 2003-11-20 Voronoi Diagrams of Rigidly Moving Sets of Points. 217-223 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#HuttenlocherKK92 2003-11-20 A Priority Queue for the All Pairs Shortest Path Problem. 189-193 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#MoffatT84 2003-11-20 Supporting Random Access in Files of Variable Length Records. 71-77 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#MoffatZ93 2003-11-20 VLSI Design With Multiple Active Layers. 109-111 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Thompson85 2003-11-20 An Attribute Evaluation of Context-Free Languages. 91-98 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#TokudaW94 2003-11-20 An Efficient Semantic Evaluator for Warped LC(1) Attributed Grammars. 269-276 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#TokudaW95 http://dx.doi.org/10.1016/0020-0190(94)00204-C 2003-11-20 On the Classification of Binding Mechanisms. 51-55 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#MorrisonABD90 2003-11-20 Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three. 1-6 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#DielissenK91 2003-11-20 A Homomorphism Theorem for Data Base Mappings. 91-96 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Spyratos82 2003-11-20 Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource. 43-51 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#BaruahGPSAJ97 http://dx.doi.org/10.1016/S0020-0190(97)00149-X 2003-11-25 An efficient algorithm for Horn description. 177-182 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#HebrardZ03 2003-11-20 A Note on Fairness in I/O Automata. 245-250 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#RomijnV96 http://dx.doi.org/10.1016/0020-0190(96)00122-6 2003-11-20 On Fast Computation of Distance Between Line Segments. 55-61 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Lumelsky85 2003-11-24 <sub>2, n</sub>: A lower bound. 303-305 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00433-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#BiedlCL03 2003-11-20 Error Diagnosis and Recovery in One Pass Compilers. 113-115 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Turner77 2003-11-20 Simple Computation of LALR(1) Lookahead Sets. 233-238 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#BermudezL89 2003-11-20 Unity Properties and Sequences of States, Some Observations. 307-311 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#UdinkK93 2003-11-20 Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space. 183-189 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#MehlhornN90 2003-11-20 Optimal Dynamization of Decomposable Searching Problems. 93-98 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#MehlhornO81 2003-11-20 An Eades-McKay Algorithm for Well-Formed Parentheses Strings. 255-259 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#BultenaR98 http://dx.doi.org/10.1016/S0020-0190(98)00171-9 2003-11-20 Convex Hull of a Finite Set of Points in Two Dimensions. 296-298 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Bykat78 2005-09-14 On Polygon Similarity. 23-25 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Bykat79 2003-11-20 A Communication Concept for Distributed Systems. 111-114 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#KorczynskiW82 2003-11-20 The One-Dimensional Weighted Voronoi Diagram. 119-123 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Aurenhammer86 2003-11-20 A Fast Backtrack Algorithm for Graph Isomorphism. 105-110 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Mittal88 2003-11-20 A Note on Unification Type Zero. 91-93 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Baader88 2003-11-20 On the Complexity of Boolean Unification. 215-220 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Baader98 http://dx.doi.org/10.1016/S0020-0190(98)00106-9 2003-11-20 Asymptotic Estimates for the Higher Moments of the Expected Behavior of Straight Insertion Sort. 179-182 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Doberkat82 2003-11-20 Optimal Slope Selection via Expanders. 115-122 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#KatzS93 2003-11-20 Provable security for 13 round Skipjack-like structure. 243-246 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#HongSLLK02 http://dx.doi.org/10.1016/S0020-0190(01)00276-9 2003-11-20 Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra. 15-21 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Stojmenovic91 2003-11-20 A Note on Bounded-Reversal Multipushdown Machines. 179-180 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Chrobak84 2003-11-20 A Short Certificate of the Number of Universal Optimal Strategies for Stopping Simple Stochastic Games. 17-24 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#YanbeS96 http://dx.doi.org/10.1016/0020-0190(95)00181-6 2003-11-20 Finding Lowest Common Ancestors in Arbitrarily Directed Trees. 307-310 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#NykanenU94 2003-11-20 On the Enlargement of the Class of Regular Languages by the Shuffle Closure. 51-54 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Jedrzejowicz83 2003-11-20 Nesting of Shuffle Closure is Important. 363-368 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Jedrzejowicz87 2003-11-20 Infinite Hierarchy of Expressions Containing Shuffle Closure Operator. 33-37 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Jedrzejowicz88 2003-11-20 Infinite Hierarchy of Shuffle Expressions Over a Finite Alphabet. 13-17 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Jedrzejowicz90 2003-11-20 A Formal System for Parallel Programs in Discrete Time and Space. 204-210 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Kawai80 2003-11-20 Local Authentication in Insecure Environments. 171-174 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Kawai87 2003-11-20 Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs. 165-171 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#SrinivasanMNRC95 http://dx.doi.org/10.1016/0020-0190(95)94093-8 2003-11-20 An Observation on Associative One-Way Functions in Complexity Theory. 239-244 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#RabiS97 http://dx.doi.org/10.1016/S0020-0190(97)00186-5 2003-11-20 Chordal Graph Recognition is in NC. 239-241 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Edenbrandt87 2003-11-20 Speeding Lamport's Fast Mutual Exclusion Algorithm. 137-142 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#MerrittT93 2003-11-20 Semantics in Problem Representation and Search. 141-145 1976 5 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#GuidaS76 2003-11-20 Multi-Problem-Solving: Knowledge Representation and System Architecture. 204-214 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#GuidaS81 2003-11-20 Layer - A Language Construction for Concurrent Structure Program Design. 113-117 1976 4 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Chrobot76 2003-11-20 A Processor Efficient MIS Algorithm on Random Graphs. 157-163 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#YangDL94 2003-11-25 It was fun. 7-12 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00380-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Turski03 2003-11-20 On Starvation and Some Related Issues. 171-174 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Turski91 2003-11-20 Sharing Special Purpose Resources in a Multiprocessor Environment. 255-260 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Pombortsis90 2003-11-20 Analysis of Hierarchical Bus-Based Multicomputer Architectures. 265-270 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Pombortsis92 2003-11-20 On Computing the Time Complexity of Transitive Closure Algorithms. 39-42 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Coffy73 2003-11-20 PRAMs with Variable Word-Size. 217-222 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#VaidyanathanHV92 2003-11-20 Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors. 31-36 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#VaidyanathanHV93 2003-11-20 Efficient Management of Multiple Outstanding Timeouts. 139-145 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#AlvarezF95 http://dx.doi.org/10.1016/0020-0190(95)00015-5 2003-11-20 The Parallel Complexity of Two Problems on Concurrency. 61-70 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#AlvarezG91 2003-11-20 An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths. 253-258 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Derigs85 2003-11-20 On the Loopless Generation of Binary Tree Sequences. 113-117 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Vajnovszki98 http://dx.doi.org/10.1016/S0020-0190(98)00155-0 2003-11-20 Very Fast and Simple Approximate String Matching. 65-70 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#NavarroB99 http://dx.doi.org/10.1016/S0020-0190(99)00121-0 2003-11-20 I-Serializability: Generalized Correctness for Transaction-Based Environments. 221-227 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#EbertV97 http://dx.doi.org/10.1016/S0020-0190(97)00124-5 2003-11-20 Syntax-Directed Unit Conversion. 100-102 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Cohen73 2003-11-20 Interpretation of Non-Deterministic Algorithms in Higher-Level Languages. 104-109 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Cohen75 2003-11-20 A Note on a Fast Algorithm for Sparse Matrix Multiplication. 247-248 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Cohen83 2003-11-20 The Convergence Span of Greedy Load Balancing. 181-182 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Cohen94 2004-06-08 A Unified Approach to Domination Problems on Interval Graphs. 271-274 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#RamalingamR88a http://dx.doi.org/10.1016/0020-0190(88)90091-9 2003-11-20 Enumeration of Binary Trees. 125-127 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#BapirajuR94 2003-11-20 Analysis of an Asynchronous PRAM Algorithm. 253-256 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Ragde91 2003-11-20 Substad: For Fast Substitution in LISP, with an Application on Unification. 58-62 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Champeaux78 2003-11-20 On the Efficient Use of Semaphore Primitives. 199-205 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#KeedyF85 2006-09-28 Matrix Multiplication for Finite Algebraic Systems. 189-192 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#RosenkrantzH88 2003-11-20 Safety Without Stuttering. 177-180 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#AlpernDS86 2003-11-20 Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms. 293-294 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ManacherM92 2003-11-20 Low Exponent Attack Against Elliptic Curve RSA. 77-83 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#KurosawaOT95 http://dx.doi.org/10.1016/0020-0190(94)00179-3 2003-11-20 Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation. 31-34 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#ManacherZ79 2003-11-20 Communication Algorithms in k-Ary n-Cube Interconnection Networks. 43-48 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#AshirSA97 http://dx.doi.org/10.1016/S0020-0190(96)00188-3 2003-11-20 Online Channel Allocation in FDMA Networks with Reuse Constraints. 295-302 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#FederS98 http://dx.doi.org/10.1016/S0020-0190(98)00126-4 2003-11-20 Optimal Speed-Up Algorithms for Template Matching on SIMD Hypercube Multiprocessors with Restricted Local Memory. 29-37 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#HorngCF91 2006-01-10 A Set of Combinators for Abstraction in Linear Space. 183-188 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#CastanDL87 2003-11-24 Minimizing the sum of the k largest functions in linear time. 117-122 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00370-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#OgryczakT03 2003-11-20 The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. 79-81 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#BroderDFRU95 http://dx.doi.org/10.1016/0020-0190(95)00101-H 2003-11-20 Evolutionary induced decision trees for dangerous software modules prediction. 31-38 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#PodgorelecK02 http://dx.doi.org/10.1016/S0020-0190(01)00284-8 2003-11-20 Nondominated k-Coteries for Multiple Mutual Exclusion. 247-252 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#NeilsenM94 2003-11-20 Erratum to "Nondominated k-coteries for Multiple Mutual Exclusion". 319 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#NeilsenM96 http://dx.doi.org/10.1016/S0020-0190(96)00199-8 2003-11-20 A Finite 5-Pebble-Automaton Can Search Every Maze. 199-204 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Szepietowski82 2003-11-20 There are no Fully Space Constructible Functions Between log log n and log n. 361-362 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Szepietowski87 2003-11-20 Remarks on Languages Acceptable in log n Space. 201-203 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Szepietowski88 2003-11-20 Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space. 73-78 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Szepietowski89 2003-11-20 The Element Distinctness Problem on One-Tape Turing Machines. 203-206 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Szepietowski96 http://dx.doi.org/10.1016/0020-0190(96)00108-1 2003-11-20 Weak and Strong One-Way Space Complexity Classes. 299-302 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Szepietowski98 http://dx.doi.org/10.1016/S0020-0190(98)00176-8 2006-02-08 A Storage Allocation Method with Invalidating Dangling References. 305-310 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Martinek87 http://dx.doi.org/10.1016/0020-0190(87)90204-3 2003-11-20 A Parallel Median Algorithm. 137-139 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#ColeY85 2003-11-20 n-Reconstructability of Context-Free Grammars. 58-62 1976 5 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Mandrioli76 2003-11-20 The Optimal Effectiveness Metric for Parallel Application Analysis. 223-229 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#LukeBL98 http://dx.doi.org/10.1016/S0020-0190(98)00058-1 2003-11-25 Voronoi Diagram for services neighboring a highway. 283-288 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00505-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#AbellanasHSIMKLP03 2003-11-20 Tree-Like Parse and Polynomial Subclasses of Search Problems. 49-54 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Kriauciukas86 2003-11-20 A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs. 165-167 1976 5 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Gabow76a 2004-06-08 A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. 259-263 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#GabowT88 http://dx.doi.org/10.1016/0020-0190(88)90089-0 2003-11-20 Almost all Boolean Functions Have no Linear Symmetries. 291-292 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Clausen92 2003-11-20 Efficient Parallel Algorithms for Linear Recurrence Computation. 31-35 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#GreenbergLPG82 2003-11-20 The Bandwidth Allocation Problem in the ATM Network Model is NP-Complete. 179-182 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#VedanthamI98 http://dx.doi.org/10.1016/S0020-0190(98)00226-9 2003-11-20 Optimal Parallel Algorithms on Circular-Arc Graphs. 147-156 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#RaoR89a 2003-11-20 A Dual Algorithm for the Satisfiability Problem. 85-89 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Tanaka91 2003-11-20 Infinite Words and Biprefix Codes. 293-295 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Pirillo94 2003-11-20 Corrigendum to "Upward separation for FewP and related classes". 89 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#RaoRW00 http://dx.doi.org/10.1016/S0020-0190(00)00035-1 2003-11-20 Upward Separation for FewP and Related Classes. 175-180 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#RaoRW94 2003-11-25 On what exactly goes on when software is developed step-by-step, II: The sequel. 45-51 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00390-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Maibaum03 2003-11-20 A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. 141-145 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#CookL88 2003-11-20 A Feasibly Constructive Lower Bound for Resolution Proofs. 81-85 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#CookP90 2003-11-20 Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching. 27-32 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#LingasK89 2003-11-20 Finding a Homomorphism Between Two Words is NP-Complete. 86-88 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#EhrenfeuchtR79a 2003-11-20 On the Subword Complexity of m-Free D0L Languages. 121-124 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#EhrenfeuchtR83a 2003-11-20 A rely-guarantee discipline for open distributed systems design. 55-63 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#DuarteM00 http://dx.doi.org/10.1016/S0020-0190(00)00038-7 2003-11-20 The Role of Virtual Memory in the Handling of Application Files. 1-3 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Stacey71 2003-11-20 Metric Graphs Elastically Embeddable in the Plane. 309-315 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#NievergeltD95 http://dx.doi.org/10.1016/0020-0190(95)00103-J 2003-11-20 Low discrepancy sets yield approximate min-wise independent permutation families. 29-32 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#SaksSZZ00 http://dx.doi.org/10.1016/S0020-0190(99)00163-5 2003-11-20 Computing Dominators in Parallel. 217-221 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#PawagiGR87 2003-11-20 Almost all monotone Boolean functions are polynomially learnable using membership queries. 211-213 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#ShmulevichKA01 http://dx.doi.org/10.1016/S0020-0190(00)00225-8 2006-02-17 Optimal Location of Facilities on a Network with an Unreliable Node or Link. 71-74 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#EiseltGL96 http://dx.doi.org/10.1016/0020-0190(96)00024-5 2003-11-20 Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency. 9-13 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Rayward-SmithR80 2003-11-20 Finding Nearest Neighbors. 63-65 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Yuval76a 2003-11-20 An efficient algorithm for solving the homogeneous set sandwich problem. 17-22 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#TangYW01 http://dx.doi.org/10.1016/S0020-0190(00)00145-9 2003-11-20 On a Generalization of Binary Search. 230-233 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Leipala79 2003-11-20 On Optimal Multilevel Indexed Sequential Files. 191-195 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Leipala82 2003-11-20 Improvements on the Accelerated Integer GCD Algorithm. 31-36 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#SedjelmaciL97 http://dx.doi.org/10.1016/S0020-0190(96)00185-8 2003-11-20 A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees. 231-236 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Trevisan96 http://dx.doi.org/10.1016/0020-0190(96)81422-0 2003-11-20 O(n^(1/2)) Algorithms for the Maximal Elements and ECDF Searching Problem on a Mesh-Connected Parallel Computer. 303-306 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Dehne86 2003-11-20 Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. 151-156 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#HemaspaandraR98 http://dx.doi.org/10.1016/S0020-0190(97)00219-6 2003-11-20 Optimal Incremental Simple Multi-Pass Attribute Evaluation. 289-295 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Alblas89 2003-11-20 Contiguous Segmentation with Limited Compacting. 57-62 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Nawrocki83 2003-11-20 Conflict Detection and Resolution in a Lexical Analyzer Generator. 323-328 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Nawrocki91 2004-01-09 An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays. 3-9 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GarciaJT98 http://dx.doi.org/10.1016/S0020-0190(98)00137-9 2003-11-20 Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem. 283-287 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#HsiaoTC91 2003-11-20 An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs. 229-235 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#HsiaoTC92 2003-11-20 On (Greek D)D_P²-Immunity. 25-28 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Balcazar86 2003-11-20 A note on a question of Peled and Wilke regarding stutter-invariant LTL. 261-263 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Etessami00 http://dx.doi.org/10.1016/S0020-0190(00)00113-7 2003-11-20 Failure-Equivalent Transformation of Transition Systems to Avoid Internal Actions. 333-343 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#LuoBDW92 2003-11-20 A Note on the Commutative Closure of Star-Free Languages. 71-74 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#MuschollP96 http://dx.doi.org/10.1016/0020-0190(95)00187-5 2003-11-20 On the Identification of the Convex Hull of a Finite Set of Points in the Plane. 18-21 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Jarvis73 2003-11-20 Correctness of an Extended Operator-Precedence Parsing Algorithm. 265-273 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#HorspoolL87 2003-11-20 On Distributed Search. 129-133 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#HermanC85 2003-11-20 Stabilizing Phase-Clocks. 259-265 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#HermanG95 http://dx.doi.org/10.1016/0020-0190(95)00050-M 2003-11-20 A Monte Carlo Study of Parwise Comparison. 25-29 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#HermanK96 http://dx.doi.org/10.1016/0020-0190(95)00185-9 2003-11-20 Available stabilizing heaps. 115-121 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#HermanM01 http://dx.doi.org/10.1016/S0020-0190(00)00208-8 2003-11-20 Error-detecting codes and fault-containing self-stabilization. 41-46 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#HermanP00 http://dx.doi.org/10.1016/S0020-0190(99)00164-7 2003-11-20 Order Statistics on a Hypercube. 129-132 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#ChandranR88 2003-11-25 A spectral lower bound for the treewidth of a graph and its consequences. 195-200 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00286-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#ChandranS03 2003-11-20 An Optimal Parallel Algorithm for Merging Using Multiselection. 81-87 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#DeoJM94 2006-07-12 Generalizations of Line Graphs and Applications. 14-17 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#DeoKP77 2003-11-20 Approximate Parametric Searching. 1-4 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Toledo93 2003-11-20 A Classification of Extensible Programming Languages. 91-96 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Solntseff72 2003-11-20 On a Notational Device for the Description of Pointer-Free Operations on Structured Data. 158-159 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Solntseff74 2003-11-20 Expression Evaluation with Minimum Average Working Storage. 111-114 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Chroust72 2003-11-20 An Application of the Planar Separator Theorem to Counting Problems. 317-322 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#RaviH87 2003-11-20 A note on synchronized extension systems. 7-9 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#TipleaM01 http://dx.doi.org/10.1016/S0020-0190(00)00167-8 2003-11-20 Lower Bounds for Planar Orthogonal Drawings of Graphs. 35-40 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#TamassiaTV91 2004-06-08 The Complexity of Ultrametric Partitions on Graphs. 265-270 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Krvanek88 http://dx.doi.org/10.1016/0020-0190(88)90090-7 2003-11-20 Server Problems and Resistive Spaces. 193-196 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#DengM91 2003-11-20 The Identification of Parallel Micro-Operations. 180-184 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#JacksonD74 2003-11-20 3-SAT=SAT for a Class of Normal Modal Logics. 281-287 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Demri95 http://dx.doi.org/10.1016/0020-0190(95)00060-P 2003-11-20 Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete. 1-5 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Denis99 http://dx.doi.org/10.1016/S0020-0190(98)00185-9 2003-11-20 On maximal repeats in strings. 165-169 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Raffinot01 http://dx.doi.org/10.1016/S0020-0190(01)00152-1 2003-11-20 A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. 307-312 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#KleinS90 2003-11-20 A Formula for the Number of Spanning Trees of a Multi-Star Related Graph. 295-298 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#YanMC98 http://dx.doi.org/10.1016/S0020-0190(98)00175-6 2003-11-20 A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. 55-58 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#GarridoKL96 http://dx.doi.org/10.1016/0020-0190(96)00040-3 2003-11-25 Operational semantics: Concepts and their expression. 27-32 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00383-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Jones03 2003-11-20 A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. 110-112 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Jones77 2003-11-20 Partial Functions and Logics: A Warning. 65-67 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Jones95 http://dx.doi.org/10.1016/0020-0190(95)00042-B 2003-11-20 Hiding resources that can fail: An axiomatic perspective. 3-13 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#PhilippouSLCS01 http://dx.doi.org/10.1016/S0020-0190(01)00212-5 2003-11-20 Consensus Under Unreliable Transmission. 243-248 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#YanWC99 http://dx.doi.org/10.1016/S0020-0190(99)00015-0 2003-11-20 A Fast Algorithm for Finding the Compact Sets. 339-342 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Zivkovic91 2003-11-20 A Data Structure for Dynamic Range Queries. 209-213 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#LuekerW82 2003-11-20 Set constraints and topology. 145-150 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Seynhaeve01 http://dx.doi.org/10.1016/S0020-0190(01)00157-0 2003-11-20 Algebra of Two-Level Cause-Effect Structures. 325-330 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Ustimenko96 http://dx.doi.org/10.1016/0020-0190(96)00128-7 2003-11-20 Bracket-Languages are Recognizable in Logarithmic Space. 168-170 1976 5 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Mehlhorn76 2003-11-20 Colored Cause-Effect Structures. 219-225 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Ustimenko98 http://dx.doi.org/10.1016/S0020-0190(98)00174-4 2003-11-20 A Faster Approximation Algorithm for the Steiner Problem in Graphs. 125-128 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Mehlhorn88 2003-11-20 Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications. 295-302 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Yang91a 2003-11-20 An Incremental LL(1) Parsing Algorithm. 67-72 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Yang93a 2003-11-20 Motion Estimation Based on Modified Fourier Spectrum. 311-313 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Mahmoud91 2003-11-20 On Rotations in Fringe-Balanced Binary Trees. 41-46 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Mahmoud98 http://dx.doi.org/10.1016/S0020-0190(97)00184-1 2003-11-20 Scalability and the Isomorphism Problem. 137-143 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#GoldsmithH96 http://dx.doi.org/10.1016/0020-0190(95)00204-9 2003-11-20 A Note on the all Nearest-Neighbor Problem for Convex Polygons. 193-194 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#YangL79 2003-11-20 A Sound and Complete Query Evaluation for Implicit Predicate which is a Semantic Descriptor of Unknown Values. 283-289 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#YangL91 2003-11-20 A Note on Error-Correcting Codes for Authentication and Subliminal Channels. 141-143 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#YangL97 http://dx.doi.org/10.1016/S0020-0190(97)00053-7 2003-11-20 An Optimal Algorithm for Realizing a Delaunay Triangulation. 245-250 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Lambert97 2003-11-20 Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs. 307-313 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#LuoKCN91 2003-11-20 Sorting Permutations by Block-Interchanges. 165-169 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Christie96 http://dx.doi.org/10.1016/S0020-0190(96)00155-X 2003-11-20 On the Complexity of Vector Computations in Binary Tree Machines. 120-124 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#TolleS81 2003-11-20 The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays. 123-125 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Rayward-Smith87 2003-11-20 On adaptive deterministic gossiping in ad hoc radio networks. 89-93 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#GasieniecL02 http://dx.doi.org/10.1016/S0020-0190(01)00312-X 2003-11-20 A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. 213-219 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Zerovnik89 2003-11-20 The Complexity of Minimizing Wire Lengths in VLSI Layouts. 263-267 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#BhattC87 2003-11-20 A Method for Proving Programming Languages non Context-Free. 151-153 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Sokolowski78 2003-11-20 The Domatic Number Problem on Some Perfect Graph Families. 51-56 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#KaplanS94 2003-11-20 Nonisomorphic Graphs with the Same T-Polynomial. 133-134 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Hattori86 2003-11-20 Lexical Ambiguity in Tree Adjoining Grammars. 65-69 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#DeyBT90 2003-11-20 On the Minimum Label Spanning Tree Problem. 81-85 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#KrumkeW98 http://dx.doi.org/10.1016/S0020-0190(98)00034-9 2003-11-20 An Algorithm for Uniform Random Sampling of Points In and On a Hypersphere. 17-21 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#GuralnikZW85 2003-11-20 A Stable Minimum Storage Sorting Algorithm. 162-164 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Dewar74 2003-11-20 About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. 31-34 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Metivier83 2003-11-20 Spanners of de Bruijn and Kautz Graphs. 231-236 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#HarbaneP97 http://dx.doi.org/10.1016/S0020-0190(97)00075-6 2003-11-20 Proof System for Weakest Prespecification. 309-313 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Orlowska88 2003-11-20 Revisiting a Result of Ko. 189-194 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#CintioliS97 http://dx.doi.org/10.1016/S0020-0190(97)00197-X 2003-11-20 Eliminating Disjunctions of Leads-to Properties. 189-194 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Calvert94 2003-11-20 Random List Permutations in Place. 271-275 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Ressler92 2003-11-20 Scheduling Complete Intrees on Two Uniform Processors with Communication Delays. 255-263 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#BlazewiczBGT96 http://dx.doi.org/10.1016/0020-0190(96)00062-2 2003-11-20 On Expected Costs of Deadlock Detection. 229-231 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#JammelS80 2003-11-20 Erratum: A Decidability Theorem for a Class of Vector-Addition Systems. 164 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Crespi-ReghizziM75a 2003-11-20 Parallel Implementation of a Genetic-Programming Based Tool for Symbolic Regression. 299-307 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#SalhiGR98 http://dx.doi.org/10.1016/S0020-0190(98)00056-8 2003-11-20 Optimal Merging and Sorting on the Erew Pram. 181-185 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#HagerupR89 2003-11-20 A Guided Tour of Chernoff Bounds. 305-308 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#HagerupR90 2003-11-20 Improved Nonconservative Sequential and Parallel Integer Sorting. 57-63 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#HagerupS90 2003-11-20 A Simpler Derivation of Schema Hazard in Genetic Algorithms. 77-78 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Chakraborty95 http://dx.doi.org/10.1016/0020-0190(95)00116-T 2003-11-20 Scheduling Multiprocessor Tasks on Three Dedicated Processors. 275-280 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#BlazewiczDDS92 2003-11-20 Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors. 269-270 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#BlazewiczDDS94 2003-11-20 Structured Implementation of Symbolic Execution: A First Part in a Program Verifier. 97-103 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#GalandL75 2003-11-25 Some optimization problems on weak-bisplit graphs. 305-310 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Vanherpe03 2003-11-20 Remarks on Two-Way Automata with Weak-Counters. 105-107 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Miyano84 2003-11-20 A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem. 75-78 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Miyano88 2003-11-20 The Derivation of a Tighter Bound for Top-Down Skew Heaps. 265-271 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#KaldewaijS91 2003-11-20 Optimal real-time garbage collection for acyclic pointer structures. 151-157 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#KaldewaijV01 http://dx.doi.org/10.1016/S0020-0190(00)00212-X 2003-11-20 Balanced Allocations for Tree-Like Inputs. 329-332 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#BroderFLPR95 http://dx.doi.org/10.1016/0020-0190(95)00123-T 2003-11-20 On the Properties of Combination Set Operations. 195-199 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#OkunoMI98 http://dx.doi.org/10.1016/S0020-0190(98)00067-2 2005-06-28 The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. 199-201 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Plesnik79 2003-11-20 Routing in Times Square Mode. 41-48 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#LodiLP90 2003-11-20 A Comparison of Sixteen Quality Metrics for Object-Oriented Design. 271-275 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#BinkleyS96 http://dx.doi.org/10.1016/0020-0190(96)00059-2 2003-11-20 Private vs. Common Random Bits in Communication Complexity. 67-71 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Newman91 2003-11-20 An Optimal Algorithm for Computing the Repetitions in a Word. 244-250 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Crochemore81 2003-11-20 Auxiliary Variables in Partial Correctness Programming Logics. 131-133 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#McCurley89 2003-11-20 Comments on Convex Hull of a Finite Set of Points in Two Dimensions. 141-142 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#DevaiS79 2003-11-20 Some Properties of Deadlock Detection and Recovery in Readers and Writers Problems. 118-123 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#BoariN76 2003-11-20 Multiple Access to a Tree in the Context of Readers and Writers Problem. 112-121 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#BoariN78 2003-11-20 Efficient minimization of deterministic weak omega-automata. 105-109 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Loding01 http://dx.doi.org/10.1016/S0020-0190(00)00183-6 2003-11-20 On a Problem in Real-Time Computing. 173-177 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Joseph85 2003-11-20 A fast cost scaling algorithm for submodular flow. 123-128 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#IwataMS00 http://dx.doi.org/10.1016/S0020-0190(00)00052-1 2003-11-20 Automatic Content Analysis in an On-Line Environment. 134-140 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#CarrollFG72 2003-11-20 Computing a Poset from its Realizer. 149-154 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#NardelliMS97a http://dx.doi.org/10.1016/S0020-0190(97)00166-X 2003-11-20 On the Problem of Approximating the Number of Bases of a Matroid. 9-11 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#AzarBF94 2003-11-20 PACS, simple-PAC and query learning. 11-16 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#CastroG00 http://dx.doi.org/10.1016/S0020-0190(99)00161-1 2003-11-20 The Space Reduction Method: A Method to Reduce the Size of Search Spaces. 187-192 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#SiklossyT91 2003-11-20 Shortest Path Between Two Simple Polygons. 285-288 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#AsanoAI87 2003-11-20 A self-stabilizing enumeration algorithm. 299-305 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Godard02 http://dx.doi.org/10.1016/S0020-0190(01)00291-5 2003-11-20 On Computing the Closest Boundary Point on the Convex Hull. 311-314 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#AggarwalH89 2003-11-20 A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon. 17-20 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#AggarwalK89 2003-11-20 A Tight Lower Bound for the Train Reversal Problem. 301-304 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#AggarwalL90 2003-11-20 Deferred Data Structure for the Nearest Neighbor Problem. 119-122 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#AggarwalR91 2003-11-20 Computing the Longest Diagonal of a Simple Polygon. 13-18 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#AggarwalS90 2003-11-20 Another Application of Recursion Introduction. 116-119 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Watanabe80 2003-11-20 A Fast Algorithm for Finding all Shortest Paths. 1-3 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Watanabe81 2003-11-20 On Hardness of One-Way Functions. 151-157 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Watanabe88 2005-02-16 Increasing Search Efficiency Using Multiple Heuristics. 33-36 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#ChakrabartiGPS89 2003-11-20 Some Average Measures in m-ary Search Trees. 375-382 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Baeza-Yates87 2003-11-20 Height Balance Distribution of Search Trees. 317-324 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Baeza-Yates91 2005-09-13 Recognizing i-triangulated graphs in O(mn) time. 141-147 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#RousselR00 http://dx.doi.org/10.1016/S0020-0190(00)00138-1 2005-09-13 <i>i</i>-Triangulated Graphs. 57-62 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#RousselR99 http://dx.doi.org/10.1016/S0020-0190(99)00041-1 2003-11-20 A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. 287-290 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Bodlaender88 2003-11-20 Achromatic Number is NP-Complete for Cographs and Interval Graphs. 135-138 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Bodlaender89 2003-11-20 Uniform Multipaging Reduces to Paging. 9-12 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Liberatore98 http://dx.doi.org/10.1016/S0020-0190(98)00080-5 2003-11-20 Alternate Solutions to the Cigarette Smokers' Problem Without Conditionals. 22-24 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Reddi77 2003-11-20 Binary Search with Errors and Variable Cost Queries. 261-270 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Sereno98 http://dx.doi.org/10.1016/S0020-0190(98)00166-5 2003-11-20 An Efficient Algorithm for the All Pairs Suffix-Prefix Problem. 181-185 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#GusfieldLS92 2003-11-20 Garbage Collection in shared-environment Closure Reducers: Space-Efficient Depth First Copying Using a Tailored Approach. 1-7 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Thomas95 http://dx.doi.org/10.1016/0020-0190(95)00131-U 2003-11-20 Simulating Circular Attribute Grammars Through Attribute Reevaluation. 79-81 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#ThomeW89 2003-11-20 Coding distributive lattices with Edge Firing Games. 125-128 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#LatapyM02 http://dx.doi.org/10.1016/S0020-0190(01)00319-2 2003-11-25 Minimal sensor integrity: Measuring the vulnerability of sensor grids. 49-55 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00450-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#KannanSRI03 2003-11-20 On the Storage Space Requirement of Consecutive Retrieval with Redundancy. 101-104 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#EhrichL76 2003-11-20 A Note on Delaunay and Optimal Triangulations. 127-128 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Kirkpatrick80 2003-11-20 The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. 33-36 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Carlsson87a 2003-11-24 Priority algorithms for makespan minimization in the subset model. 153-157 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00264-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Regev02 2003-11-20 An Inductive Number-Theoretic Characterization of NP. 245-247 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Tourlakis84 2003-11-20 An Optimal Parallel Adaptive Sorting Algorithm. 195-200 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#CarlssonC91 2003-11-20 An Optimization Technique for Protocol Conformance Testing Using Multiple Uio Sequences. 7-11 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#ChenLBW90 2003-11-20 On Some Factorizations of Infinite Words by Elements of Codes. 289-294 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#JustinP97 http://dx.doi.org/10.1016/S0020-0190(97)00080-X 2003-11-20 An Improvement on El-Yaniv-Fiat-Karp-Turpin's Money-Making Bi-Directional Trading Strategy. 27-33 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#DannouraS98 http://dx.doi.org/10.1016/S0020-0190(98)00032-5 2003-11-20 The Unsolvability of Some Petri Net Language Problems. 60-63 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Grabowski79 2003-11-20 The Decidability of Persistence for Vector Addition Systems. 20-23 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Grabowski80 2003-11-25 A note on an expressiveness hierarchy for multi-exit iteration. 17-23 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00234-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#AcetoFI03 2003-11-20 On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. 281-287 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#BenoisS86 2003-11-20 A Note on ``Scheduling Unit-Time Tasks with Integer Release Times and Deadlines''. 165-166 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#SteinerY93 2003-11-20 Strong Normalization for Non-Structural Subtyping via Saturated Sets. 157-162 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Rehof96 http://dx.doi.org/10.1016/0020-0190(96)00056-7 2003-11-20 Remarks on Sorting and One-Way Multihead Finite Automata. 215-218 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Kutylowski90 2003-11-20 Rational Search. 89-90 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Reiss79 2003-11-20 Algorithms for Conversion of Minterms to Positive Polarity Reed-Muller Coefficients and Vice Versa. 223-230 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KhanA97 http://dx.doi.org/10.1016/S0020-0190(97)00068-9 2003-11-20 A Decision Procedure for Optimal Polyhedron Partitioning. 75-78 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Chazelle83 2003-11-20 Codeterministic Automata on Infinite Words. 95-98 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#BeauquierP85 2003-11-20 A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems. 151-157 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#DhamdhereK94 2003-11-20 On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. 279-285 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#NagamochiI89 2003-11-20 A Note on Minimizing Submodular Functions. 239-244 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#NagamochiI98 http://dx.doi.org/10.1016/S0020-0190(98)00114-8 2003-11-20 Customizable Garbage Collectors. 115-118 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Jokinen89 2003-11-20 Radix Sort on the Hypercube. 77-81 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Manzini91 2003-11-20 Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results. 231-238 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Manzini94 2003-11-20 On Lexicographic Semi-Commutations. 55-59 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#MetivierO87 2003-11-20 Medians and Centres of Polyominoes. 175-181 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#MetivierS96 http://dx.doi.org/10.1016/0020-0190(96)00005-1 2005-01-14 Fast Correlation Attacks on Nonlinear Filter Generators. 37-42 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#GolicSSD97 http://dx.doi.org/10.1016/S0020-0190(97)00148-8 2003-11-20 An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon. 275-276 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Dublish88 2003-11-20 Some Comments on the Subtree Isomorphism Problem for Ordered Trees. 273-275 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Dublish90 2003-11-20 On the Serializability Theorem for Nested Transactions. 177-183 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#ResendeA94 2003-11-20 Lower bounds on precedence-constrained scheduling for parallel processors. 27-32 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#BaevME02 http://dx.doi.org/10.1016/S0020-0190(01)00303-9 2003-11-24 Translation among CNFs, characteristic models and ordered binary decision diagrams. 191-198 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00374-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#HoriyamaI03 2003-11-20 A Note on Border Rank. 173-178 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Lickteig84 2003-11-20 Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two. 277-279 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Lickteig86 2003-11-20 Optimizing a mail-order with discount and shipping costs. 93-97 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Damaschke02 http://dx.doi.org/10.1016/S0020-0190(01)00248-4 2003-11-20 The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. 1-2 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Damaschke89 2003-11-20 A Parallel Algorithm for Nearly Optimal Edge Search. 233-236 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Damaschke95 http://dx.doi.org/10.1016/0020-0190(95)00139-4 2003-11-20 Randomized Group Testing for Mutually Obscuring Defectives. 131-135 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Damaschke98 http://dx.doi.org/10.1016/S0020-0190(98)00096-9 2003-11-20 Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree. 77-82 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#SteelW93 2003-11-20 A Technique for Developing Loop Invariants. 137-139 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Remmers84 2003-11-20 Approximate Triclique Coloring for Register Allocation. 249-253 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#VenkatesanR96 http://dx.doi.org/10.1016/S0020-0190(96)00174-3 2003-11-20 Batched Search of Index Sequential Files. 267-272 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Manolopoulos86 2003-11-20 Spanners of Underlying Graphs of Iterated Line Digraphs. 245-250 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#HarbaneP97a http://dx.doi.org/10.1016/S0020-0190(97)00071-9 2003-11-20 On Selecting the k Largest with Restricted Quadratic Queries. 193-195 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Gasarch91 2003-11-24 Accelerated diffusion algorithms for dynamic load balancing. 61-67 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00238-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#KaragiorgosM02 2003-11-20 On the Equivalence Covering Number of Splitgraphs. 301-304 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#BlokhuisK95 http://dx.doi.org/10.1016/0020-0190(95)00037-D 2003-11-20 Adaptive Control Using Switched Capacitor Filters. 231-234 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#PlattM88 2003-11-20 Approximating the Minimum-Cost Maximum Flow is P-Complete. 315-319 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#SteinW92 2003-11-20 More on Master Keys for Group Sharing. 125-126 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#DenningMS81 2003-11-20 Finding OR in a noisy broadcast network. 69-75 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#FeigeK00 http://dx.doi.org/10.1016/S0020-0190(00)00002-8 2003-11-20 LR Parsing of Some Ambiguous Grammars. 101-103 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Tarhio82 2003-11-25 On the complexity of finding balanced oneway cuts. 1-5 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00251-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#FeigeY03 2003-11-20 A lower bound on Voronoi diagram complexity. 183-185 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Aronov02 http://dx.doi.org/10.1016/S0020-0190(01)00336-2 2003-11-20 On Sorting in the Presence of Erroneous Information. 213-215 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Bagchi92 2003-11-20 Route Selection with Multiple Metrics. 203-205 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Bagchi97 http://dx.doi.org/10.1016/S0020-0190(97)00144-0 2003-11-20 The generic approximation lemma. 197-201 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#HuttonG01 http://dx.doi.org/10.1016/S0020-0190(00)00220-9 2003-11-20 A Time and Space Efficient Data Structure for String Searching on Large Texts. 217-222 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#ColussiC96 http://dx.doi.org/10.1016/0020-0190(96)00061-0 2003-11-20 The Two Headed Disk: Stochastic Dominance of the Greedy Policy. 273-277 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#SeshadriR96 http://dx.doi.org/10.1016/0020-0190(95)00210-3 2003-11-20 Optimal Checkpointing and Local Recording for Domino-Free Rollback Recovery. 295-304 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#VenkateshRL87 2003-11-20 On the Security of the Lucas Function. 243-247 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#LaihTT95 http://dx.doi.org/10.1016/0020-0190(94)00209-H 2003-11-20 Containment of Butterflies in Networks Constructed by the Line Digraph Operation. 25-30 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#HasunumaS97 http://dx.doi.org/10.1016/S0020-0190(96)00183-4 2003-11-20 Determining Whether a Groupoid is a Group. 120-124 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Tarjan72 2003-11-20 A Note on Finding the Bridges of a Graph. 160-161 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Tarjan74 2003-11-20 A Hierarchical Clustering Algorithm Using Strong Components. 26-29 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Tarjan82 2003-11-20 Updating a Balanced Search Tree in O(1) Rotations. 253-257 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Tarjan83 2003-11-20 Parallelism and the Feedback Vertex Set Problem. 81-85 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#BovetAP88 2003-11-20 A More Efficient Convex Hull Algorithm. 56-57 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#KoplowitzJ78 2003-11-20 <i>r</i>. 21-25 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#DingH98 http://dx.doi.org/10.1016/S0020-0190(98)00025-8 2003-11-20 On the Complexity of Building an Interval Heap. 143-144 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#DingW94 2003-11-20 On Module Assignment in Two-Processor Distributed Systems. 113-117 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#AroraR79 2003-11-20 Analysis of the Module Assignment Problem in Distributed Computing Systems with Limited Storage. 111-115 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#AroraR80 2003-11-20 An Optimal Demand Prepaging Algorithm. 132-136 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#AroraS78 2003-11-20 Guarded Procedure: A Distributed Programming Concept. 199-203 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#AroraS81 2003-11-20 Towards a Theory of (Self) Applicative Communicating Processes: A Short Note. 139-142 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Goeman90 2003-11-20 Determining Uni-Connectivity in Directed Graphs. 9-12 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#BuchsbaumC93 2003-11-20 A Structured Approach for Developing Concurrent Programs in Java. 233-238 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Mizuno99 http://dx.doi.org/10.1016/S0020-0190(99)00020-4 2003-11-20 The joy of formula manipulation. 89-96 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Feijen01 http://dx.doi.org/10.1016/S0020-0190(00)00195-2 2003-11-20 On the limits of efficient teachability. 267-272 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Servedio01 http://dx.doi.org/10.1016/S0020-0190(01)00137-5 2003-11-20 A Note on Scattered Context Grammars. 47-50 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#MilgramR71 2003-11-20 Inverse Morphic Equivalence on Languages. 213-218 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#KarhumakiW84 2003-11-20 Abstract Derivation of Transitive Closure Algorithms. 159-164 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#FeijsO97 http://dx.doi.org/10.1016/S0020-0190(97)00113-0 2003-11-24 Approximating minimum cocolorings. 285-290 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00288-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#FominKN02 2003-11-20 LL(1) Grammars Supporting an Efficient Error Handling. 174-176 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Ghezzi75 2003-11-20 A Recursive Algorithm to Generate Joint Probability Distribution of Arrivals from Exponential Sources During a Random Time Interval. 214-217 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Shanthikumar82 2005-02-02 ARCADE - A System for Research and Education in Computer Architecture. 78-85 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#BrandwajnKH78 2003-11-20 An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion. 325-327 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#OConnor94 2003-11-20 A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions. 347-353 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#OConnor95 http://dx.doi.org/10.1016/0020-0190(94)00211-G 2003-11-20 Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic. 87-90 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Cialdea86 2003-11-20 A New Algorithm for Rectangle Enclosure Reporting. 177-182 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#LagogiannisMT99 http://dx.doi.org/10.1016/S0020-0190(99)00145-3 2003-11-20 Dynamic Behaviour in Updating Process Over BST of Size Two with Probabilistic Deletion Algorithms. 89-100 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Messeguer91 2003-11-20 Characterizing the Shortest Path of an Object Among Obstacles. 257-264 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Feinberg89 2003-11-20 Semi-Unification of Two Terms in Abelian Groups. 61-68 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Rittri94 2003-11-20 Corrigendum: Semi-Unification of Two Terms in Abelian Groups. 235 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Rittri95 http://dx.doi.org/10.1016/0020-0190(95)92011-2 2003-11-20 A Note on Shortest Superstrings with Flipping. 195-199 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#JiangLD92 2003-11-20 A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing. 227-231 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#OhyaIM84 2003-11-20 Heuristics for Partial-Match Retrieval Data Base Design. 132-135 1976 4 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#BentleyB76 2003-11-20 A Note on Euclidean Near Neighbor Searching in the Plane. 133-136 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#BentleyM79 2003-11-20 Analysis of Range Searches in Quad Trees. 170-173 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#BentleyS75 2003-11-20 Divide and Conquer for Linear Expected Time. 87-91 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#BentleyS78 2003-11-20 Message Complexity of the Set Intersection Problem. 169-174 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#RamaraoDM88 2003-11-20 An Almost Optimal Algorithm for Unbounded Searching. 82-87 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#BentleyY76 2003-11-20 Distributing A B+-Tree in a Loosely Coupled Environment. 313-321 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#MatsliachS90 2003-11-20 A Modified Tree-to-Tree Correction Problem. 127-132 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Wilhelm81 2003-11-20 Independent Sets in Graphs with Triangles. 207-210 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#HofmeisterL96 http://dx.doi.org/10.1016/0020-0190(96)00072-5 2003-11-20 Existence of Simple Propositional Formulas. 177-182 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Buning90 2003-11-25 Non-clairvoyant scheduling for weighted flow time. 31-37 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00231-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#KimC03a 2003-11-20 An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. 93-96 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#BunkeC95 http://dx.doi.org/10.1016/0020-0190(95)00005-W 2003-11-20 Achieving Optimal CRCW PRAM Fault-Tolerance. 59-66 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Shvartsman91 2003-11-20 An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory. 223-231 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Shvartsman92 2003-11-20 On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores. 21-23 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#DiekertB91 2003-11-20 Relaxed Barrier Synchronization for the BSP Model of Computation on Message-Passing Architectures. 247-253 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#KimHJ98 http://dx.doi.org/10.1016/S0020-0190(98)00061-1 2003-11-20 Multidisk Partial Match File Design with Known Access Pattern. 33-39 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#KimHK93 2003-11-20 On Temporal Aggregate Processing Based on Time Points. 213-220 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#KimKK99 http://dx.doi.org/10.1016/S0020-0190(99)00110-6 2003-11-20 The Decidability of v-Local Catenativity and of Other Properties of D0L Systems. 33-35 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Culik78 2003-11-20 Some Decidability Results About Regular and Pushdown Translations. 5-8 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Culik79 2003-11-20 Variations of the Firing Squad Problem and Applications. 153-157 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Culik89 2003-11-20 Efficient Stream Distribution Algorithm for Heterogeneous Multimedia Multicast with Link Capacity Constraint. 309-315 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#KimLK97 http://dx.doi.org/10.1016/S0020-0190(97)00138-5 2003-11-20 On Generalized Twisted Cubes. 53-55 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#CullL95 http://dx.doi.org/10.1016/0020-0190(95)00040-J 2003-11-20 Analysis of Fuzzy Operators for High Quality Information Retrieval. 251-256 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#KimLL93 2003-11-20 <sup>m</sup>). 135-139 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#KimLY00 http://dx.doi.org/10.1016/S0020-0190(00)00130-7 2003-11-20 A Simple Lower Bound for Monotone Clique Using a Communication Game. 221-226 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#GoldmannH92 2005-01-19 A Model of Distributed Control: Dependency and Uncertainty. 73-77 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#KimPK89 2003-11-20 Placing two disks in a convex polygon. 33-39 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#KimSY00 http://dx.doi.org/10.1016/S0020-0190(99)00154-4 2003-11-20 Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. 259-263 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#BlazewiczF87 2003-11-20 On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. 277-282 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#JimboM94 2003-11-20 An Optimal Algorithm for Sink-Finding. 109-111 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#KingS82 2003-11-20 Progress Properties for Empty UNITY Programs. 107-109 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#CregutH99 http://dx.doi.org/10.1016/S0020-0190(98)00207-5 2003-11-20 A Modified Version of the Rao-Nam Algebraic-Code Encryption Scheme. 215-217 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#ChengLW98 http://dx.doi.org/10.1016/S0020-0190(98)00156-2 2003-11-20 Reduction of OBDDs in Linear Time. 139-144 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#SielingW93 2003-11-20 The Towers of Hanoi Problem. 243-244 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#BunemanL80 2003-11-20 Magic Semi-Joins. 97-107 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#CeriGTW89 2003-11-20 Notes on Oriented Depth-First Search and Longest Paths. 53-56 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#FraysseixI89 2003-11-20 On-Line Algorithms for the Dominating Set Problem. 11-14 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#KingT97 http://dx.doi.org/10.1016/S0020-0190(96)00191-3 2003-11-20 A Fast VLSI Conversion Between Binary and Residue Systems. 141-145 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#AliaBM84 2003-11-20 On Detecting Spatial Regularity in Noisy Images. 189-195 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#RobinsRS99 http://dx.doi.org/10.1016/S0020-0190(99)00013-7 2003-11-20 An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. 287-290 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#RheeL96 http://dx.doi.org/10.1016/0020-0190(95)00206-5 2003-11-20 Time Bounds on Synchronization in a Periodic Distributed System. 87-93 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#RheeW97 http://dx.doi.org/10.1016/S0020-0190(97)00155-5 2003-11-25 Burrows-Wheeler transform and Sturmian words. 241-246 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00512-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#MantaciRS03 2003-11-20 Place/Transition Nets with Debit Arcs. 25-33 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#StottsG92 2003-11-20 A Dynamic Programming Solution to the n-Queens Problem. 253-256 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#RivinZ92 2003-11-20 Blocking Versus Nonblocking Interprocess Communication: A Note on the Effect on Concurrency. 171-175 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Barbosa90 2003-11-20 ET0L-Grammars and N-Grammars. 11-13 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Penttonen75 2003-11-20 Applying the Minimax Rule Over Graphs Which Are Not Trees. 79-81 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Boffey73 2003-11-20 Some Properties of View-Based Replication Control Algorithms for Distributed Systems. 295-298 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Mukkamala89 2003-11-20 Parallel genetic algorithm with parameter adaptation. 47-54 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#TongchimC02 http://dx.doi.org/10.1016/S0020-0190(01)00286-1 2003-11-20 An Optimal Parallel Algorithm for Sorting Multisets. 141-143 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Rajasekaran98 http://dx.doi.org/10.1016/S0020-0190(98)00103-3 2003-11-20 Lower Bounds on the Area of Finite-State Machines. 1-7 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#FosterG89 2003-11-20 Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem. 287-290 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#FosterV89 2003-11-20 Partitions with Minimum Entropy of Regions in R². 69-73 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Gaines97 http://dx.doi.org/10.1016/S0020-0190(97)00103-8 2003-11-20 A Branching Process Model for Genetic Algorithms. 281-292 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Chakraborty95a http://dx.doi.org/10.1016/0020-0190(95)00113-X 2003-11-20 Using Reliability Analysis to Estimate the Number of Generations to Convergence in Genetic Algorithms. 199-209 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ChakrabortyD93 2003-11-20 An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores. 343-348 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#FriedbergP87 2003-11-20 The Cyclic Towers of Hanoi. 118-119 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Atkinson81 2003-11-20 On Zigzag Permutations and Comparisons of Adjacent Elements. 187-189 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Atkinson85 2003-11-20 Polynomial Complete Problems in Automata Theory. 147-151 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Rystsov83 2003-11-20 The Nonexistence of Some Covering Context-Free Grammars. 187-192 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Ukkonen79 2003-11-20 Upper Bounds on the Size of LR(k) Parsers. 99-103 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Ukkonen85 2003-11-25 Proof of correctness of Ressel's adOPTed algorithm. 303-310 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00227-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#LushmanC03 2003-11-20 An Optimal Bound for Path Weights in Huffman Trees. 107-110 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Kirrinnis94 2003-11-20 On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints. 71-79 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#BaierK98 http://dx.doi.org/10.1016/S0020-0190(98)00038-6 2003-11-20 Denotational Linear Time Semantics and Sequential Composition. 135-143 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#BaierM96 http://dx.doi.org/10.1016/0020-0190(96)00101-9 2003-11-20 Regularity of Normed PA Processes. 9-17 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Kucera99a http://dx.doi.org/10.1016/S0020-0190(99)00125-8 2003-11-20 Deciding Whether Graph G has Page Number One is in NC. 7-10 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#MasuyamaN92 2003-11-20 Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates. 147-150 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Jukna95 http://dx.doi.org/10.1016/0020-0190(95)00137-2 2003-11-20 Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. 267-269 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Jukna99 http://dx.doi.org/10.1016/S0020-0190(99)00027-7 2003-11-20 Structural Tolerance and Delaunay Triangulation. 221-227 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#AbellanasHR99 http://dx.doi.org/10.1016/S0020-0190(99)00107-6 2003-11-20 For completeness, sublogarithmic space is no space. 321-325 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Agrawal02 http://dx.doi.org/10.1016/S0020-0190(01)00296-4 2003-11-20 Distributed Termination Detection in Reducible Communication Graphs. 1-8 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Gianuzzi94 2003-11-20 How to Estimate the Sizes of Domains. 237-243 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Bourret84 2003-11-20 A heuristic to accelerate in-situ permutation algorithms. 119-125 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Keller02 http://dx.doi.org/10.1016/S0020-0190(01)00219-8 2003-11-20 Set-Theoretic Problems of Null Completion in Relational Databases. 261-265 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Keller86 2003-11-20 An Improved Bisection Algorithm. 112-113 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#RickE79 2003-11-20 Space-Optimal Hidden Line Elimination for Rectangles. 195-200 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#KitsiosT96 http://dx.doi.org/10.1016/S0020-0190(96)00161-5 2003-11-20 A Note on Heuristics for Dynamic Organization of Data Structures. 213-216 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#KonnekerV81 2003-11-20 Ranking and unranking permutations in linear time. 281-284 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#MyrvoldR01 http://dx.doi.org/10.1016/S0020-0190(01)00141-7 2004-06-08 Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. 227-236 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#JungM88 http://dx.doi.org/10.1016/0020-0190(88)90084-1 2003-11-20 Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications. 153-156 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Rajcani92 2003-11-20 Generation of Convex Polygons with Individual Angular Constraints. 159-164 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#RoussilleD87 2003-11-20 A New Approach for the Domination Problem on Permutation Graphs. 219-224 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#LiangRDL91 2003-11-20 On Using the Fourier Transform to Learn Disjoint DNF. 219-222 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Khardon94 2003-11-20 Polygon Nesting and Robustness. 23-32 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#BajajD90 2003-11-20 Dynamic Parallel Evaluation of the Cross-Product Set Using Time-Stamps. 273-280 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Gupta92a 2003-11-20 Efficient Simulations by a Biased Coin. 245-248 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Uehara95 http://dx.doi.org/10.1016/0020-0190(95)00171-2 2003-11-20 Collapse of PP with a Semi-Random Source to BPP. 83-87 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Uehara97 http://dx.doi.org/10.1016/S0020-0190(96)00201-3 2003-11-20 Optimal Three-Dimensional Layouts of Complete Binary Trees. 99-104 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#GuptaH87 2003-11-20 On Synthesis of Scheduling Algorithms. 147-150 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#GuptaS84 2003-11-20 Approximate Storage Utilization of B-Trees. 243-246 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#GuptaS86 2005-09-07 Selection in X+Y and Matrices With Sorted Rows and Columns. 13-17 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#MirzaianA85 2003-11-20 Tuning Architecture via Microprogramming. 102-109 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#LuqueR80 2003-11-20 Integer Linear Programming for Microprograms Register Allocation. 81-85 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#LuqueR84 2003-11-20 On Relations Between Intervals. 177-182 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#LigozatB89 2003-11-20 <i>n</i><sup>3</sup>) Time Algorithm for Recognizing Threshold Dimension 2 Graphs. 255-259 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#SterbiniR98 http://dx.doi.org/10.1016/S0020-0190(98)00112-4 2003-11-20 On the Covering of Vertices for Fault Diagnosis in Hypercubes. 99-103 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#KarpovskyCLA99 http://dx.doi.org/10.1016/S0020-0190(98)00199-9 2003-11-20 A Tight Amortized Bound for Path Reversal. 3-5 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#GinatST89 2003-11-20 Non-Elementary Lower Bound for Propositional Duration Calculus. 7-11 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Rabinovich98 http://dx.doi.org/10.1016/S0020-0190(98)00027-1 2003-11-20 A Note on Universal Classes of Hash Functions. 41-45 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Sarwate80 2003-11-20 On the Dynamic Maintenance of Maximal Points in the Plane. 59-64 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Janardan91 2003-11-20 Minimizing Completion Time for a Class of Scheduling Problems. 27-29 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#FaigleS84 2003-11-20 On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. 189-194 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#FaigleS88 2003-11-20 A Tight Lower Bound for the Best-alpha Algorithm. 17-22 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#TorngU99 http://dx.doi.org/10.1016/S0020-0190(99)00082-4 2003-11-20 An Optimal Parallel Algorithm for Maximal Matching. 223-228 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Kelsen94 2003-11-20 Probabilistic Polynomial Time is Closed under Parity Reductions. 91-94 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#BeigelHW91 2003-11-20 An Incremental Reconstruction Method for Dynamic Planar Point Location. 79-83 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Tamassia91 2003-11-20 The Complexity of Strict Serializability Revisited. 407-412 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Kelter87 2003-11-20 The Pitfall Paradox and its Solution with Virtual Objects. 139-143 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Kelter89 2003-11-20 A Recursive Ascent Earley Parser. 87-91 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Leermakers92 2003-11-20 Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems. 233-235 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Rozenberg72a 2003-11-20 Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable. 252 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Rozenberg72b 2003-11-20 More on ET0L Systems versus Random Context Grammars. 102-106 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Rozenberg76a 2003-11-20 On the Triangle Conjecture. 197-200 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Felice82 2003-11-20 A Note on K-Iteration Grammars. 162-164 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#RozenbergW76 2003-11-20 A Bit-String Longest-Common-Subsequence Algorithm. 305-310 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#AllisonD86 2003-11-20 Selection by Distributive Partitioning. 7-8 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#AllisonN80 2003-11-20 <sub>1</sub>Travelling Salesman Problem. 195-199 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#AllisonN84 2003-11-20 Broadcasting in a Hypercube when Some Calls Fail. 115-119 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#FraigniaudP91 2003-11-20 An Algorithm for Fraternal Orientation of Graphs. 271-274 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#UrrutiaG92 2003-11-25 Randomized selection in n+C+o(n) comparisons. 95-100 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00361-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#GerbessiotisS03 2003-11-20 Formal Derivation of an Algorithm for Distributed Phase Synchronization. 207-213 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#BuhaceanuF96 http://dx.doi.org/10.1016/S0020-0190(96)00156-1 2003-11-20 More on BPP and the Polynomial-Time Hierarchy. 237-241 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Canetti96 http://dx.doi.org/10.1016/0020-0190(96)00016-6 2004-01-12 Data Structures in a Real-Time Environment. 151-155 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#LentfertO89 2003-11-20 A Note on Odd and Even Factors of Undirected Graphs. 70-72 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Ebert80 2003-11-20 A Sensitive Transitive Closure Algorithm. 255-258 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Ebert81 2003-11-20 Computing Eulerian Trails. 93-97 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Ebert88 2003-11-20 Total Domination in Interval Graphs Revisited. 17-21 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#RamalingamR88 2003-11-20 New Sequential and Parallel Algorithms for Interval Graph Recognition. 215-219 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#RamalingamR90 2003-11-20 On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. 155-161 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#RamalingamR94 2003-11-20 Improving the Efficiency of Depth-First Search by Cycle Elimination. 5-10 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#DillenburgN93 2003-11-20 Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic. 283-287 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#WaxmanI88 2003-11-20 A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm. 303-307 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Klein94 2003-11-20 An optimal algorithm for reporting visible rectangles. 283-288 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#KitsiosMSTTV02 http://dx.doi.org/10.1016/S0020-0190(01)00228-9 2003-11-20 On a Generalization of the p-Center Problem. 67-71 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Krumke95 http://dx.doi.org/10.1016/0020-0190(95)00141-X 2003-11-20 On Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks. 265-271 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#ViswanathanCS96 http://dx.doi.org/10.1016/0020-0190(96)00011-7 2003-11-20 Self-Adjusting and Split Sequence Hash Tables. 185-188 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Wogulis89 2003-11-20 On the Impact of Sense of Direction on Message Complexity. 23-31 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#FlocchiniMS97 http://dx.doi.org/10.1016/S0020-0190(97)00091-4 2003-11-20 Parallel Complexity of Computing a Maximal Set of Disjoint Paths. 149-151 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Aggarwal92 2003-11-20 A new graph characteristic and its application to numerical computability. 277-282 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#HararyKL01 http://dx.doi.org/10.1016/S0020-0190(00)00153-8 2003-11-20 A Fast Algorithm for Constructing Trees from Distance Matrices. 215-220 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#CulbersonR89 2003-11-20 Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. 124 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Hansen76a 2003-11-24 Cryptanalysis of an optimized protocol for mobile network authentication and security. 339-341 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00431-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#LaihC03 2003-11-20 Quadratic Programming is in NP. 73-77 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Vavasis90 2003-11-25 Number of mutual connections in neighborhoods and its application to self-diagnosable systems. 89-94 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00363-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#YoshidaSK03 2003-11-20 Decomposable Searching Problems. 244-251 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Bentley79 2003-11-20 Complexity Bounds for Equivalence and Isomorphism of Latin Squares. 231-233 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#BohmMS80 2003-11-20 A Probably Optimal Embedding of Hyper-Rings in Hypercubes. 117-122 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#ObokataNI96 http://dx.doi.org/10.1016/0020-0190(96)00045-2 2003-11-20 Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0. 211-216 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#IstrailZ94 2003-11-20 Testing for Class Membership in Multi-Parent Hierarchies. 21-25 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#LambD88 2003-11-20 A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. 205-212 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#LanWS99 http://dx.doi.org/10.1016/S0020-0190(99)00111-8 2003-11-20 A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations. 75-78 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#JanigaK85 2003-11-20 Computing a Median Point of a Simple Rectilinear Polygon. 281-285 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#ChepoiD94 2003-11-20 On an Extension of Dijkstra's Semaphore Primitives. 181-186 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#VantilborghL72 2003-11-20 Mathematical Solution for a Data Processing System. 252-256 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Loizou79 2003-11-20 On a Cycle Finding Algorithm. 33-36 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Loizou80 2003-11-20 Scheduling of Unit-Length Independent Tasks with Execution Constraints. 95-98 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#LangF76 2003-11-20 A Note on Set Union with Arbitrary Deunions. 331-335 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#GalilI91 2003-11-20 Parallel Evaluation of the Determinant and of the Inverse of a Matrix. 41-45 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#GalilP89 2003-11-20 A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. 309-311 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#GalilP90 2003-11-20 Partitioned Encryption and Achieving Simultaneity by Partitioning. 81-88 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#GalilY87 2003-11-20 Convergence of Inconsistency Algorithms for the Pairwise Comparisons. 197-202 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#HolsztynskiK96 http://dx.doi.org/10.1016/0020-0190(96)00113-5 2003-11-20 K_1, 3-Free and W_4-Free Graphs. 221-223 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Kloks96 http://dx.doi.org/10.1016/S0020-0190(96)00163-9 2003-11-20 Total Domination and Transformation. 167-170 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#KratschS97 http://dx.doi.org/10.1016/S0020-0190(97)00115-4 2003-11-20 Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). 81-84 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Willard83 2003-11-20 Storage Requirements in Stochastic Data Acquisition Systems. 217-219 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Brandstetter72 2003-11-25 On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic. 335-338 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00210-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Rizzi03 2003-11-24 On special families of morphisms related to [delta]-matching and don't care symbols. 227-233 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00430-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#ColeILPR03 2003-11-20 A Note on Equations for Commutative Regular Languages. 265-267 1999 70 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#CrvenkovicDE99 http://dx.doi.org/10.1016/S0020-0190(99)00073-3 2003-11-20 Fast Data Transmission and Maximal Dynamic Flow. 127-132 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#XueSR98 http://dx.doi.org/10.1016/S0020-0190(98)00047-7 2003-11-20 A Simplified Proof That Regular Resolution is Exponential. 96-98 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Ben-Ari80 2003-11-20 <sub>k</sub><sup>+</sup>. 71-73 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#XiangU99a http://dx.doi.org/10.1016/S0020-0190(99)00086-1 2003-11-20 Approximate String Matching with don't Care Characters. 235-239 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Akutsu95 http://dx.doi.org/10.1016/0020-0190(95)00111-O 2003-11-20 Efficient loopless generation of Gray codes for k-ary trees. 169-174 2000 76 Inf. Process. Lett. 4-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#XiangUT00 http://dx.doi.org/10.1016/S0020-0190(00)00139-3 2003-11-20 On generating k-ary trees in computer representation. 231-238 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#XiangUT01 http://dx.doi.org/10.1016/S0020-0190(00)00155-1 2003-11-20 Rearrangeable Nonblocking Condition for Multi-log_2 N Multiconnection Networks. 107-112 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#TschaCL93 2003-11-20 Polynomially Solvable Satisfiability Problems. 221-227 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#GalloS88 2003-11-20 Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability. 155-158 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#ApostolicoG84 2006-07-12 Finding Maximum Cliques on Circular-Arc Graphs. 209-215 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#ApostolicoH87 2003-11-20 A speed-up for the commute between subword trees and DAWGs. 159-161 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ApostolicoL02 http://dx.doi.org/10.1016/S0020-0190(01)00327-1 2005-11-18 A McCulloch-Pitts Neural Net to Characterize Even Linear Languages. 201-208 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#SempereL95 http://dx.doi.org/10.1016/0020-0190(95)00153-4 2003-11-20 On Termination and Phase Changes in the Presence of Unreliable Communication. 15-20 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#BaumgartenO86 2003-11-25 Optimal state-space lumping in Markov chains. 309-315 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00343-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#DerisaviHS03 2003-11-20 On a Triangle Counting Problem. 319-321 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#KhullerM90 2003-11-20 The Cover Time of a Regular Expander is O(n log n). 49-51 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Rubinfeld90 2003-11-20 Batch Checking with Applications to Linear Functions. 77-80 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Rubinfeld92 2003-11-20 On Independent Spanning Trees. 321-323 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#KhullerS92 2003-11-20 On the Parallel Complexity of Digraph Reachability. 239-241 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#KhullerV94 2003-11-24 The General Steiner Tree-Star problem. 215-220 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00271-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#KhullerZ02 2003-11-20 The Minimization Method for Some Permutation Functionals. 110-111 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#StoyanS79 2003-11-20 An Approach to the Problems of Routing Optimization in the Regions of Intricate Shape. 39-43 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#StoyanS81 2003-11-20 Yield-Languages of Two-Way Pushdown Tree Automata. 195-199 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Salomaa96 http://dx.doi.org/10.1016/0020-0190(96)00048-8 2003-11-20 Shortest Enclosing Walks and Cycles in Embedded Graphs. 119-125 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Provan89 2003-11-20 A Distributed Method to Bound Rollback Lengths for Fossil Collection in Time Warp Simulators. 191-196 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#YoungW96 http://dx.doi.org/10.1016/0020-0190(96)00107-X 2003-11-20 Depth-First Layout Algorithm for Trees. 187-194 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#MiyaderaAUY98 http://dx.doi.org/10.1016/S0020-0190(98)00068-4 2003-11-25 Maximum number of edges joining vertices on a cube. 95-99 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00257-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Abdel-Ghaffar03 2003-11-20 Notes on Looping Deterministic Two-Way Pushdown Automata. 123-127 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#LadermannP94 2003-11-20 BPP and the Polynomial Hierarchy. 215-217 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Lautemann83 2003-11-20 Fast and Compact Dispatching for Dynamic Object-Oriented Languages. 315-321 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Queinnec97 http://dx.doi.org/10.1016/S0020-0190(97)00192-0 2003-11-20 An Algorithm for the Derivation of Codefinitions in Computer Programs. 85-90 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Laski86 2003-11-25 Finding augmenting chains in extensions of claw-free graphs. 311-316 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00223-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#HertzLS03 2003-11-20 Dominations in Trapezoid Graphs. 309-315 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Liang94a 2003-11-20 Steiner Set and Connected Domination in Trapezoid Graphs. 101-108 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Liang95a http://dx.doi.org/10.1016/0020-0190(95)00118-V 2003-11-20 Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. 215-219 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#LiangB95 http://dx.doi.org/10.1016/0020-0190(95)00145-3 2003-11-20 Finding a Maximum Matching in a Circular-Arc Graph. 185-190 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#LiangR93 2003-11-20 Finding Biconnected Components in O(n) Time for a Class of Graphs. 159-163 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#LiangR96 http://dx.doi.org/10.1016/S0020-0190(96)00153-6 2003-11-20 Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'. 182-183 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Hellman81 2003-11-20 Trapdoor Knapsacks Without Superincreasing Structure. 7-11 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Willett83 2003-11-20 A General Implementation of Relational Recursion with Speedup Techniques for Programmers. 257-262 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ClouatreLM89 2003-11-20 Some Subclasses of Context-Free Languages In NC1. 111-117 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#IbarraJR88 2003-11-20 An improved algorithm for the jump number problem. 87-92 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#McCartin01 http://dx.doi.org/10.1016/S0020-0190(00)00172-1 2003-11-20 The Logic-Termal Equivalence is Polynomial-Time Decidable. 57-62 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Sabelfeld80 2003-11-20 Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable. 147-153 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Sabelfeld81 2003-11-20 A Note on the Parallel Complexity of Computing the Rank of Order n Matrices. 162 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#IbarraMR80 2003-11-20 Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. 227-232 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#IbarraMR81 2003-11-20 A Linear Time Equivalene Test for Read-Twice DNF Formulas. 289-295 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#PillaipakkamnattR93 2003-11-20 Polygonal Intersection Searching. 74-79 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#EdelsbrunnerMK82 2003-11-20 Implementation Approach to Parallel Systems. 244-249 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Czaja78 2003-11-20 A Specification of Parallel Problems. 162-167 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Czaja79 2003-11-20 Parallel System Schemas and Their Relation to Automata. 153-158 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Czaja80 2003-11-20 Cause-Effect Structures. 313-319 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Czaja88 2003-11-20 Finite Processes in Cause-Effect Structures and Their Composition. 305-310 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Czaja89 2003-11-20 plapackJava: Towards an efficient Java interface for high performance parallel linear algebra. 191-197 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Gamess00 http://dx.doi.org/10.1016/S0020-0190(00)00105-8 2003-11-20 Using Random Context Structure Grammars to Represent Chemical Structures. 159-166 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#EhlersS89 2003-11-20 Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems. 249-254 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Sacca96 http://dx.doi.org/10.1016/0020-0190(96)00067-1 2003-11-20 A Predicate Transformer for Progress. 323-330 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Knapp90 2003-11-20 Impossibility Results for Weak Threshold Networks. 85-90 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BuschM97 http://dx.doi.org/10.1016/S0020-0190(97)00096-3 2003-11-20 An Alternative Way to Represent the Cogroup of a Relation in the Context of Nested Databases. 317-324 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#AbiteboulGG89 2003-11-20 The reconstruction of polyominoes from their orthogonal projections. 225-229 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Woeginger01 http://dx.doi.org/10.1016/S0020-0190(00)00162-9 2003-11-20 A Simple Solution to the Two Paths Problem in Planar Graphs. 191-192 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Woeginger90 2003-11-20 On Minimizing the Sum of k Tardinesses. 253-256 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Woeginger91 2003-11-20 Finding the Closest Extreme Vertex to a Fixed Point. 127-128 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Woeginger92 2003-11-20 Scheduling with Time-Dependent Execution Times. 155-156 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Woeginger95 http://dx.doi.org/10.1016/0020-0190(95)00011-Z 2003-11-20 There is no Asymptotic PTAS for Two-Dimensional Vector Packing. 293-297 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Woeginger97 http://dx.doi.org/10.1016/S0020-0190(97)00179-8 2003-11-24 Some non finitely generated monoids of repetition-free endomorphisms. 61-66 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00354-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Richomme03 2006-04-26 Choosing Task Periods to Minimise System Utilisation in Time Triggered Systems. 223-229 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#BurnsD96 http://dx.doi.org/10.1016/0020-0190(96)00060-9 2003-11-20 Decreasing the Bandwidth of a Transition Matrix. 315-320 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Macarie95 http://dx.doi.org/10.1016/0020-0190(94)00218-N 2003-11-20 Solving Combinatorial Search Problems by Intelligent Backtracking. 36-39 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Bruynooghe81 2003-11-20 DB: A LISP-Type Data Base System. 126-134 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#FerrariG79 2003-11-20 Storing information with extractors. 267-274 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Ta-Shma02 http://dx.doi.org/10.1016/S0020-0190(02)00206-5 2003-11-20 A Note on PCP vs. MIP. 135-140 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Ta-Shma96 http://dx.doi.org/10.1016/0020-0190(96)00043-9 2003-11-20 A Note on a Proposed LALR Parser for Extended Context-Free Grammars. 303-305 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Galvez94 2003-11-20 A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System. 127-134 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Lazos75 2003-11-20 Can an operation both update the state and return a meaningful value in the asynchronous PRAM model? 161-166 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Hoepman01 http://dx.doi.org/10.1016/S0020-0190(00)00188-5 2003-11-20 The Subprogram Problem for Software Metric Design. 143-149 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Prather96 http://dx.doi.org/10.1016/S0020-0190(96)00152-4 2003-11-20 On the Inadequacy of Tournament Algorithms for the N-SCS Problem. 169-171 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#BradfordJ91 2003-11-20 Successful Visual Human-Computer Interaction is Undecidable. 13-19 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BottoniLP98 http://dx.doi.org/10.1016/S0020-0190(98)00082-9 2003-11-20 Off-Line Algorithms for the List Update Problem. 75-80 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#ReingoldW96 http://dx.doi.org/10.1016/S0020-0190(96)00144-5 2003-11-20 An Efficient Algorithm for Concurrent Priority Queue Heaps. 151-157 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#HuntMPS96 http://dx.doi.org/10.1016/S0020-0190(96)00148-2 2003-11-20 A Parallel Algorithm for Static Program Slicing. 307-313 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#DanicicHS95 http://dx.doi.org/10.1016/0020-0190(95)00170-0 2003-11-25 A collapse result for constraint queries over structures of small degree. 277-281 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00508-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Libkin03 2003-11-20 Alternation with a Pebble. 7-13 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#GoralcikGK91 2003-11-20 A note on the Consecutive Ones Submatrix problem. 163-166 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#HajiaghayiG02 http://dx.doi.org/10.1016/S0020-0190(01)00325-8 2003-11-20 Some Topological Properties of Star Connected Cycles. 81-85 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#AzevedoBDL96 http://dx.doi.org/10.1016/0020-0190(96)00041-5 2003-11-20 Stable Unmerging in Linear Time and Constant Space. 285-294 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#SaloweS87 2003-11-20 A process algebra for probabilistic and nondeterministic processes. 15-23 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#CazorlaCRP01 http://dx.doi.org/10.1016/S0020-0190(01)00213-7 2003-11-20 Note on Node-Rewriting Graph Grammars. 21-24 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#KreowskiR84 2003-11-20 Parallel Cardinality Stacks and an Application. 295-299 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Kennedy91 2006-02-07 An LC Branch-and-Branch Algorithm for the Module Assignment Problem. 61-71 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ChernCL89 2003-11-20 Stabbing C-Oriented Polygons. 35-40 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Guting83 2003-11-20 Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments. 165-171 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Guting85 2003-11-20 Agreement in the Presence of Faults, on Networks of Bounded Degree. 329-334 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Ben-OrR96 http://dx.doi.org/10.1016/0020-0190(96)00015-4 2003-11-25 A CAT algorithm for generating permutations with a fixed number of inversions. 107-112 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00481-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#EfflerR03 2003-11-20 Computational Limitations on Training Sigmoid Neural Networks. 269-274 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Hoffgen93 2003-11-20 Comments on: Sorting by Distributive Partitioning. 205 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Burton78 2003-11-20 A Linear Space Translation of Functional Programs to Turner Combinators. 201-204 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Burton82 2003-11-20 A Note on Higher-Order Functions Versus Logical Variables. 91-95 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Burton89 2003-11-20 Random duplicate storage strategies for load balancing in multimedia servers. 51-59 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#AertsKE00 http://dx.doi.org/10.1016/S0020-0190(00)00115-0 2003-11-20 Lower Bounds for Two Call Control Problems. 173-178 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Tomkins95 http://dx.doi.org/10.1016/0020-0190(95)00147-5 2003-11-20 An Efficient Distributed Termination Test. 203-208 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Mattern89a 2003-11-20 An Improvement of Algorithms for Solving Interface Equations. 185-190 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Martinelli98 http://dx.doi.org/10.1016/S0020-0190(98)00110-0 2003-11-20 Maintaining Transitive Closure in First Order After Node-Set and Edge-Set Deletions. 193-199 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#DongP97 http://dx.doi.org/10.1016/S0020-0190(97)00066-5 2003-11-20 Conjunctive Query Containment with Respect to Views and Constraints. 95-102 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#DongS96 http://dx.doi.org/10.1016/0020-0190(95)00192-1 2003-11-20 A Deadlock-Free Communication Kernel for Loop Architecture. 157-161 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#PramanikDBF91 2003-11-20 Twenty Questions to a P-Selector. 201-204 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#BuhrmanTB93 2003-11-20 On Modal mu-Calculus and Büchi Tree Automata. 17-22 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Kaivola95 http://dx.doi.org/10.1016/0020-0190(94)00227-P 2003-11-20 A Canonical Form Algorithm for Proving Equivalence of Conditional Forms. 103-106 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Samet78 2003-11-20 Bidirectional Coroutines. 1-6 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Samet85 2003-11-20 Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems. 52-56 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Slisenko82 2003-11-20 A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. 323-327 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#NakayamaM97 http://dx.doi.org/10.1016/S0020-0190(97)00082-3 2003-11-20 Digitizing the Plane with Cells of Nonuniform Size. 369-375 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#SametSW87 2003-11-20 Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. 195-203 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#CrochemoreL97 http://dx.doi.org/10.1016/S0020-0190(97)00107-5 2003-11-20 Parallel Construction of Minimal Suffix and Factor Automata. 121-128 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#CrochemoreR90 2003-11-20 Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. 57-60 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#CrochemoreR91 2003-11-25 Waiting time and complexity for matching patterns with automata. 119-125 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00271-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#CrochemoreS03 2003-11-20 An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem. 159-163 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#SuraweeraB93 2003-11-20 Fairness and Partial Order Semantics. 33-39 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Vogler95 http://dx.doi.org/10.1016/0020-0190(95)00049-I 2003-11-20 On computing a longest path in a tree. 93-96 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#BultermanSZVGF02 http://dx.doi.org/10.1016/S0020-0190(01)00198-3 2003-11-25 An algebraic characterization of independence of Petri net processes. 73-81 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00386-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Winkowski03 2003-11-20 An Algebraic Characterization of the Behaviour of Non-Sequential Systems. 105-109 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Winkowski77 2003-11-20 Protocols of Accessing Overlapping Sets of Resources. 239-243 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Winkowski81 2003-11-20 A Better Lower Bound for On-Line Scheduling. 113-116 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#BartalKR94 2003-11-20 Static and Dynamic Parallel Computation of Connected Components. 63-68 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Ferragina94 2003-11-20 Multiprocessor Interconnection Network Using Pairwise Balanced Combinatorial Designs. 217-222 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Berkovich94 2003-11-20 Edge-chromatic sum of trees and bounded cyclicity graphs. 65-69 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#GiaroK00 http://dx.doi.org/10.1016/S0020-0190(00)00072-7 2003-11-20 Embedding Rectilinear Graphs in Linear Time. 75-79 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Hoffman88 2003-11-20 Synthesis of a Discrete-Time Optimal Filter Algorithm with Reduced Sensitivity to Deviations of a Priori Statistics. 211-215 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#KrepyshevP72 2003-11-20 Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. 11-16 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#KloksK95 http://dx.doi.org/10.1016/0020-0190(95)00027-A 2003-11-20 Automata Networks and Optimization. 339-343 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#GolesM92 2003-11-20 Compror: On-line lossless data compression with a factor oracle. 1-6 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#LefebvreL02 http://dx.doi.org/10.1016/S0020-0190(01)00308-8 2003-11-25 Combinatorial algorithms for feedback problems in directed graphs. 129-136 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00491-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#DemetrescuF03 2003-11-20 A Tight Lower Bound for the Complexity of Path-Planning for a Disc. 165-170 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ODunlaing88 2003-11-20 On the Sample Complexity of Noise-Tolerant Learning. 189-195 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#AslamD96 http://dx.doi.org/10.1016/0020-0190(96)00006-3 2003-11-20 A Fast Method for Interpolation Using Preconditioning. 157-163 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Horowitz72 2003-11-20 Transitive Term Graph Rewriting. 109-114 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Banach96 http://dx.doi.org/10.1016/S0020-0190(96)00150-0 2003-11-20 On Finding Test Data Sets for Loop Free Programs. 106-107 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Cherniavsky79 2003-11-20 On Recurrent and Recursive Interconnection Patterns. 285-289 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Parberry86 2003-11-20 An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits. 363-367 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Parberry87 2003-11-20 A Real-Time Algorithm for the (n²-1)-Puzzle. 23-28 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Parberry95 http://dx.doi.org/10.1016/0020-0190(95)00134-X 2003-11-20 Queue-Mergesort. 253-259 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#GolinD93 2003-11-20 Strongly Sequential and Inductively Sequential Term Rewriting Systems. 1-8 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#HanusLM98 http://dx.doi.org/10.1016/S0020-0190(98)00016-7 2003-11-20 A Counterexample for the Sufficiency of Edge Guards in Star Polygons. 97-99 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#SubramaniyamD91 2003-11-20 There is no Fast Single Hashing Algorithm. 270-273 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#AjtaiKS78 2003-11-24 Tree edit distance with gaps. 123-129 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00369-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Touzet03 2003-11-20 Inverting a Vandermonde Matrix in Minimum Parallel Time. 291-294 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Preparata91 2003-11-25 The hardest linear conjunctive language. 247-253 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00511-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Okhotin03 2003-11-20 Redundancy removal in multicast protocols. 169-173 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#McKellarD00 http://dx.doi.org/10.1016/S0020-0190(00)00021-1 2003-11-20 A Note on Mod and Generalised Mod Classes. 27-31 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#MahajanV95 http://dx.doi.org/10.1016/0020-0190(95)00026-9 2003-11-20 An On-Line String Superprimitivity Test. 345-347 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Breslauer92 2003-11-20 Testing String Superprimitivity in Parallel. 235-241 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Breslauer94 2003-11-20 An n² Algorithm for Determining the Bridges of a Graph. 51-55 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Corneil71 2003-11-20 Walking around fat obstacles. 135-140 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ChewDKK02 http://dx.doi.org/10.1016/S0020-0190(01)00321-0 2003-11-20 A Generalization of Dijkstra's Algorithm. 1-5 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Knuth77 2004-01-02 Cycle Reference Counting with Local Mark-Scan. 31-35 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#MartinezWL90 2003-11-20 Easy Verification of Behavioural Subtyping in Common Cases. 57-58 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Butler95 http://dx.doi.org/10.1016/0020-0190(95)00064-J 2003-11-20 Number-Theoretic Functions Which Are Equivalent to Number of Divisors. 151-153 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#ShallitS85 2003-11-20 Fixed Point Theorems and Semantics: A Folk Tale. 112-116 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#LassezNS82 2003-11-20 State-level and value-level simulations in data refinement. 159-167 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#LealA01 http://dx.doi.org/10.1016/S0020-0190(00)00213-1 2003-11-20 Corrigenda: SLR(k) Covering for LR(k) Grammars. 281 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#LeeC91a 2003-11-20 An LR Parser with Pre-Determined Reduction Goals. 189-196 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#LeeC99a http://dx.doi.org/10.1016/S0020-0190(99)00146-5 2003-11-20 Where-Oblivious is not Sufficient. 263-268 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Kolla83 2003-11-20 <i>k</i>-Nearest Neighbor Query Processing Cost in Multidimensional Data Space. 69-76 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#LeeCC99 http://dx.doi.org/10.1016/S0020-0190(98)00193-8 2003-11-20 A Description of Dynamic Behavior for Compilers Based on Object Oriented Modeling. 163-170 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#LeeCH93 2006-01-17 Approximating the Maximally Balanced Connected Partition Problem in Graphs. 223-230 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Chlebikova96 2003-11-20 Functional Dependencies in Relations with Null Values. 233-238 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#AtzeniM84 2003-11-20 Satisfiability of the Smallest Binary Program. 237-241 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#HanschkeW93 2003-11-20 A New SLDNF-Tree. 57-62 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#MartelliT92 2003-11-20 An efficient algorithm for hyperspherical range query processing in high-dimensional data space. 115-123 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#LeeHK02 http://dx.doi.org/10.1016/S0020-0190(01)00318-0 2003-11-20 Set-based access conflict analysis of concurrent workflow definition. 189-194 2001 80 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#LeeHS01 http://dx.doi.org/10.1016/S0020-0190(01)00162-4 2003-11-20 The Security of Two ID-Based Multisignature Protocols for Sequential and Broadcasting Architectures. 79-81 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#LeeHW99 http://dx.doi.org/10.1016/S0020-0190(99)00044-7 2003-11-20 Path for AND-Parallel Execution of Logic Programs. 191-199 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#LeeKC94 2003-11-20 Phased RGSS: An improved disk array scheduling for continuous media retrieval. 225-231 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#LeeKP01 http://dx.doi.org/10.1016/S0020-0190(01)00178-8 2003-11-20 Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm. 65-71 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#LeeKY02 http://dx.doi.org/10.1016/S0020-0190(01)00249-6 2003-11-20 A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem. 221-222 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#MartelloT92 2003-11-20 A Remark on the Regulation of k1ET0L Systems. 83-85 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Gartner93 2003-11-20 Simple algorithms for searching a polygon with flashlights. 265-270 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#LeePC02 http://dx.doi.org/10.1016/S0020-0190(01)00235-6 2003-11-20 An Upper Bound on Buffer Size for Join Operation Using Nonclusterd Indexes. 85-90 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#LeePK90 2003-11-20 Linear Approximation of Simple Objects. 89-94 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#VaradarajanA97 http://dx.doi.org/10.1016/S0020-0190(97)00049-5 2003-11-20 On the Consecutive Retrieval Property for Generalized Binary Queries. 291-293 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Tazawa84 2003-11-20 A proof method for the correctness of modularized 0CFA. 179-185 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#LeeYP02 http://dx.doi.org/10.1016/S0020-0190(01)00223-X 2003-11-20 On the Complexity of Assembly Partitioning. 229-235 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#KavrakiLW93 2003-11-20 A unified framework for structure identification. 335-339 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ZanuttiniH02 http://dx.doi.org/10.1016/S0020-0190(01)00247-2 2003-11-20 Coverings that preserve sense of direction. 175-180 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BoldiV00 http://dx.doi.org/10.1016/S0020-0190(00)00094-6 2003-11-20 Minimal Sense of Direction and Decision Problems for Cayley Graphs. 299-303 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#BoldiV97 http://dx.doi.org/10.1016/S0020-0190(97)00187-7 2003-11-20 Computing the Full Visibility Graph of a Set of Line Segments. 257-261 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Wismath92 2003-11-20 A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs. 190-192 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Majster-Cederbaum80 2003-11-20 On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. 277-281 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Majster-Cederbaum88 2003-11-20 The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. 15-19 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Majster-Cederbaum89 2003-11-20 Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time. 95-100 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Majster-Cederbaum92 2003-11-20 On Computing the Determinant in Small Parallel Time Using a Small Number of Processors. 147-150 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Berkowitz84 2003-11-20 A Characterization of the Information Content of a Classification. 211-214 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#BaclawskiS96 http://dx.doi.org/10.1016/0020-0190(96)00003-8 2003-11-20 Interpolation-Binary Search. 179-181 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#SantoroS85 2003-11-20 The Program Dependence Graph in Static Program Testing. 103-108 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Korel87 2003-11-20 A Correction to a Unilaterally Connected Components Algorithm. 125- 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Cheston78 2003-11-20 An Undecidable Problem for Context-Free Grammars. 141-142 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Makinen85a 2003-11-20 On Linear Search Heuristics. 35-36 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Makinen88a 2003-11-20 Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars. 125-127 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Makinen92a 2003-11-20 Producing a Top-Down Parse Order with Bottom-up Parsing. 323-326 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#SchmeiserB95 http://dx.doi.org/10.1016/0020-0190(95)00052-E 2003-11-20 WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time. 15-22 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Mogensen94 2003-11-20 Greedy Binary Search Trees are Nearly Optimal. 16-19 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Korsh81 2003-11-20 Growing Nearly Optimal Binary Search Trees. 139-143 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Korsh82 2003-11-20 Counting and Randomly Generating Binary Trees. 291-294 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Korsh93 2003-11-20 Loopless Generation of k-Ary Tree Sequences. 243-247 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Korsh94 2006-09-07 Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees. 165-167 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Eastman81 2003-11-20 A Verification Algorithm for Inheritance Hierarchies in Object-Oriented Databases. 269-279 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#FormicaM97 http://dx.doi.org/10.1016/S0020-0190(97)00062-8 2003-11-20 Short vectors of planar lattices via continued fractions. 121-126 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Eisenbrand01 http://dx.doi.org/10.1016/S0020-0190(00)00186-1 2003-11-20 A Note on Unambiguous Function Classes. 197-203 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Kosub99 http://dx.doi.org/10.1016/S0020-0190(99)00142-8 2003-11-20 Public key signatures in the multi-user setting. 263-266 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#GalbraithMS02 http://dx.doi.org/10.1016/S0020-0190(01)00338-6 2003-11-20 Modelling Causality via Action Dependencies in Branching Time Semantics. 179-184 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#GoltzW96 http://dx.doi.org/10.1016/0020-0190(96)00111-1 2003-11-20 Real estate of names. 169-171 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Leino01 http://dx.doi.org/10.1016/S0020-0190(00)00198-8 2003-11-20 Constructing a Program with Exceptions. 159-163 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Leino95 http://dx.doi.org/10.1016/0020-0190(94)00197-7 2005-04-04 Two Implementations of the Conditional Critical Region Using a Split Binary Semaphore. 67-71 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#KesselsM79 2003-11-20 Distances from Differences of Roots of Polynomials to the Nearest Integers. 143-146 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#GalievPS92 2003-11-20 A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem. 277-279 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Shiraishi89 2003-11-20 Andrei P. Ershov (1931-1988). 1-2 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Kotov89 2003-11-20 A Note on a Signature System Based on Probabilistic Logic. 110-113 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Leiss80 2003-11-20 The Inaccessible Set: A Classification by Query Type of Security Risks in Statistical Database. 275-279 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Leiss86 2003-11-20 On the Degree of Dominator Trees. 199-200 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Leiss88 2005-02-17 The Bit Complexity of the Predecessor Problem. 109-112 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#AfekCH97 http://dx.doi.org/10.1016/S0020-0190(97)00094-X 2003-11-20 Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator. 243-246 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#PeledW97 http://dx.doi.org/10.1016/S0020-0190(97)00133-6 2003-11-20 Universal Traversal Sequences of Length n^O(log n) for Cliques. 241-243 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#KarloffPS88 2003-11-20 A Proof of the Substitution Lemma in de Bruijn's Notation. 63-66 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Ohtsuka93 2003-11-20 A Note on ``A Faster Approximation Algorithm for the Steiner Problem in Graphs''. 177-178 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Floren91 2003-11-20 A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs. 45-49 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#VeeraraghavuluKM92 2003-11-20 Centering a Spanning Tree of a Biconnected Graph. 247-250 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ChestonFHP89 2003-11-25 A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. 143-148 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00486-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Bollig03 2003-11-20 The Implementation of a Distributed Model for Logic Programming Based on Multiple-Headed Clauses. 331-338 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#BrogiCLM92 2003-11-20 <sub>1</sub>norm. 39-44 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Serra-Sagrista00 http://dx.doi.org/10.1016/S0020-0190(00)00119-8 2003-11-20 The Data Refinement Calculator for Z Specifications. 29-33 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Josephs88 2004-01-29 Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. 43-51 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#GibbonsIR88 2003-11-20 A Class of Differential Equations for Testing Variable Step-Size Integration. 103-107 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#WebsterB86 2003-11-20 The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. 113-120 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#FranciosaGN97 http://dx.doi.org/10.1016/S0020-0190(96)00202-5 2003-11-20 The Translation Square Map and Approximate Congruence. 153-159 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Heffernan91 2003-11-20 A Parallel Merging Algorithm. 103-106 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#BarlowES81 2003-11-20 Parallel Multisection for the Determination of the Eigenvalues of Symmetric Quindiagonal Matrices. 117-118 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#BarlowES82 2003-11-20 Illumination of Polygons with Vertex Lights. 9-13 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Estivill-CastroOUX95 http://dx.doi.org/10.1016/0020-0190(95)00129-Z 2003-11-20 Self-Organizing Maps for Drawing Large Graphs. 177-184 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BonabeauH98 http://dx.doi.org/10.1016/S0020-0190(98)00108-2 2003-11-20 A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem. 25-27 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Goldschlager80 2003-11-20 The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE. 61-68 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#RussellS95 http://dx.doi.org/10.1016/0020-0190(94)00185-2 2003-11-24 A simple matching algorithm for regular bipartite graphs. 189-193 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00273-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#MakinoTF02 2003-11-20 Matching Nuts and Bolts Faster. 123-127 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#AlonBF96 http://dx.doi.org/10.1016/0020-0190(96)00104-4 2003-11-20 Abstract Computation Model Used for a Production Compiler. 46-50 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Arnborg74 2003-11-20 Minimizing the total weighted completion time of deteriorating jobs. 81-84 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#BachmanJK02 http://dx.doi.org/10.1016/S0020-0190(01)00196-X 2003-11-24 On the area of hypercube layouts. 41-46 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00218-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#GreenbergG02 2003-11-25 Almost k-wise independence versus k-wise independence. 107-110 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00359-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#AlonGM03 2003-11-20 Minimum Separation for Single-Layer Channel Routing. 210-205 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#GreenbergM92 2003-11-20 On the Efficiency of Polynomial Time Approximation Schemes. 165-171 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#CesatiT97 http://dx.doi.org/10.1016/S0020-0190(97)00164-6 2003-11-20 Clique Transversal and Clique Independence on Comparability Graphs. 181-184 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#BalachandranNR96 http://dx.doi.org/10.1016/0020-0190(96)00054-3 2003-11-20 Asserting the Optimality of Serial SJRPs in Processing Simple Queries in Chain Networks. 255-260 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#GurselS84 2003-11-20 Optimal Superprimitivity Testing for Strings. 17-20 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#ApostolicoFI91 2003-11-20 Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. 141-143 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Toyama87 2003-11-20 Fast Knuth-Bendix Completion with a Term Rewriting System Compiler. 325-328 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Toyama89 2003-11-20 Scheduling Periodic and Sporadic Tasks in a Real-Time System. 177-184 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#ChettoC89 2003-11-20 On Transformations of Algorithms to Multiply 2*2 Matrices. 1-5 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Chatelin86 2003-11-20 A Linear Time Two Tape Merge. 123-125 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#FloydS73 2003-11-20 Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. 339-342 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Dillencourt87 2003-11-20 Realizability of Delaunay Triangulations. 283-287 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Dillencourt90 2003-11-20 A Special Case of the Dynamization Problem for Least Cost Paths. 297-302 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Crippa91 2003-11-20 A Probabilistic Minimum Spanning Tree Algorithm. 44-48 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Rohlf78 2003-11-20 A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing. 229-232 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#IvkovicL96 http://dx.doi.org/10.1016/0020-0190(96)00112-3 2003-11-20 Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time. 45-50 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#IvkovicL97 http://dx.doi.org/10.1016/S0020-0190(97)00092-6 2003-11-20 An efficient external sorting algorithm. 159-163 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#LeuTT00 http://dx.doi.org/10.1016/S0020-0190(00)00098-3 2003-11-20 Variable Abstraction in O(n log n) Space. 343-349 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#KennawayS87 2003-11-20 On a Problem in Storage Optimization. 78-80 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Lozinskii76 2003-11-20 Counting Propositional Models. 327-332 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Lozinskii92 2003-11-20 The Budgeted Maximum Coverage Problem. 39-45 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#KhullerMN99 http://dx.doi.org/10.1016/S0020-0190(99)00031-9 2003-11-20 Locality in Inheritance Networks. 263-268 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Thirunarayan93 2003-11-20 On Termination of the Direct Sum of Term-Rewriting Systems. 65-70 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Rusinowitch87 2003-11-20 Designing Multi-Commodity Flow Trees. 49-55 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#KhullerRY94 2003-11-20 Preserving Liveness: Comments on ``Safety and Liveness from a Methodological Point of View''. 141-142 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#AbadiAAFKLS91 2003-11-20 Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints. 167-170 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Leung79 2003-11-20 Optimal Database Reorganisation: Some Practical Difficulties. 23-27 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Leung82 2003-11-20 Approximate Storage Utilisation of B-Trees: A Simple Derivation and Generalisations. 199-201 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Leung84 2003-11-20 Bin Packing with Restricted Piece Sizes. 145-149 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Leung89 2003-11-20 A Note on Finitely Ambiguous Distance Automata. 329-331 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Leung92 2003-11-20 A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments. 125-126 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#CzyzowiczKU98 http://dx.doi.org/10.1016/S0020-0190(98)00046-5 2003-11-20 Analysis of Algorithms on Problems in General Abelian Groups. 215-220 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Iliopoulos85 2003-11-20 On the Polynomial IO-Complexity. 199-204 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Rolim89 2003-11-20 Mesh Permutation Routing with Locality. 101-105 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#CheungL92 2003-11-20 A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes. 225-228 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#CheungL93 2003-11-20 An O(sqrt(n)) Time Algorithm for the ECDF Searching Problem for Arbitrary Dimensions on a Mesh-of-Processors. 67-70 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#DeheneS88 2003-11-25 On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. 155-159 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Galbiati03 2003-11-20 A 3-Valued Wakeup Protocol. 89-93 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Valois95 http://dx.doi.org/10.1016/0020-0190(95)00078-Q 2003-11-20 A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search. 103-109 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#LakshmananMT87 2003-11-20 Computer Generation of Vertex Graphs. 57-63 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Sridharan74 2003-11-20 Erratum: Computer Generation of Vertex Graphs. 164 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Sridharan75 2003-11-20 Computing two penetration measures for curved 2D objects. 143-148 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Sridharan99 http://dx.doi.org/10.1016/S0020-0190(99)00131-3 2003-11-20 Errata: A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths. 216 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Kral72a 2003-11-20 Notes on the Derivation of Asymptotic Expressions from Summations. 165-169 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Gonnet78 2003-11-20 A Note on the Number of States of the DeRemer's Recognizer. 22-23 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#KralD73 2003-11-20 Improving the Strict Avalanche Characteristics of Cryptographic Functions. 37-41 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#SeberryZZ94 2004-02-19 A Note on Optical Routing on Trees. 295-300 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KumarPRS97 http://dx.doi.org/10.1016/S0020-0190(97)00077-X 2003-11-20 Distributed Termination Detection with Counters. 223-227 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#RonnS90 2003-11-20 Simple Linear Time Recognition of Unit Interval Graphs. 99-104 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#CorneilKNOS95 http://dx.doi.org/10.1016/0020-0190(95)00046-F 2003-11-20 The Immortality Problem for LAG Systems. 311-315 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#SalomaaY90 2003-11-20 A Note on Infinite Trees. 229-232 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Engelfriet72 2003-11-20 On Tree Transducers for Partial Functions. 170-172 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Engelfriet78 2003-11-20 An Elementary Proof of Double Greibach Normal Form. 291-293 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Engelfriet92 2003-11-20 Formal Derivation of a List Processing Program. 124-126 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Hemerik80 2003-11-20 ECLR-Attributed Grammars: A Practical Class of LR-Attributed Grammars. 31-41 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#SassaIN87 2003-11-20 Bounding the Attractor of an IFS. 197-202 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#EdalatSW97 http://dx.doi.org/10.1016/S0020-0190(97)00156-7 2003-11-25 Computation of words satisfying the "rhythmic oddity property" (after Simha Arom's works). 255-261 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00521-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#ChemillierT03 2003-11-20 From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. 207-212 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#MostefaouiRT00 http://dx.doi.org/10.1016/S0020-0190(00)00027-2 2003-11-20 k-Violation Linear Programming. 109-114 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#RoosW94 2003-11-20 An Exercise in Fault-Containment: Self-Stabilizing Leader Election. 281-288 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#GhoshG96 http://dx.doi.org/10.1016/0020-0190(96)00121-4 2003-11-20 Fault-containing self-stabilization using priority scheduling. 145-151 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#GhoshH00 http://dx.doi.org/10.1016/S0020-0190(00)00006-5 2003-11-20 An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. 277-280 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#GhoshM90 2003-11-20 Bidirectional Heuristic Search with Limited Resources. 335-340 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#GhoshM91 2003-11-20 An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. 155-160 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#GhoshM92 2003-11-20 A Lower Bound Technique for the Size of Nondeterministic Finite Automata. 75-77 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#GlaisterS96 http://dx.doi.org/10.1016/0020-0190(96)00095-6 2003-11-20 Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. 69-74 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#KovalyovS97 http://dx.doi.org/10.1016/S0020-0190(97)00154-3 2003-11-20 A Note on Uniformly Limited ETOL Systems with Unique Interpretation. 199-204 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Fernau95 http://dx.doi.org/10.1016/0020-0190(95)00033-9 2003-11-20 Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). 13-15 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#KirsigL87 2003-11-20 A Note on Post's Correspondence Problem. 233 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Pansiot81a 2003-11-20 Meeting Times of Random Walks on Graphs. 259-265 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#BshoutyHW99 http://dx.doi.org/10.1016/S0020-0190(99)00017-4 2003-11-20 Size-Depth Tradeoffs for Boolean Fomulae. 151-155 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#BonetB94 2003-11-20 A Note on the Complete Problems for Complexity Classes. 227-230 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Ambos-Spies86a 2003-11-20 Upper and Lower Bounds for Stochastic Marked Graphs. 291-295 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Rajsbaum94 2003-11-20 Lower Bounds on Type Checking Overloading. 9-13 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Volpano96 http://dx.doi.org/10.1016/0020-0190(95)00184-0 2003-11-20 On Learning width Two Branching Programs. 217-222 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#BshoutyTW98 http://dx.doi.org/10.1016/S0020-0190(97)00204-4 2003-11-20 Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). 237-240 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#AltBMP91 2003-11-20 The shuffle-cubes and their generalization. 35-41 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#LiTHS01 http://dx.doi.org/10.1016/S0020-0190(00)00147-2 2003-11-24 A note on models for non-probabilistic analysis of packet switching networks. 237-240 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00312-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Rosen02 2003-11-20 On Sparse Oracles Separating Feasible Complexity Classes. 291-295 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#HartmanisH88 2003-11-20 Lower Time Bounds for Integer Programming with Two Variables. 101-105 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#LautemannH85 2003-11-20 A Note on Approximate Linear Programming. 53 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Megiddo92 2003-11-20 Counting Convex k-Gons in Planar Point Sets. 191-194 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#RoteW92 2003-11-25 Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. 107-110 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00258-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#LiTTH03 2003-11-20 Haskell Overloading is DEXPTIME-Complete. 57-60 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Seidl94 2003-11-20 Fast and Simple Nested Fixpoints. 303-308 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Seidl96 http://dx.doi.org/10.1016/0020-0190(96)00130-5 2003-11-25 The complexity of economic equilibria for house allocation markets. 219-223 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#FeketeSW03 2003-11-20 On a Correspondence Between Binary Trees and a Certain Type of Permutation. 58-61 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Rotem75 2003-11-20 Performance Analysis of a Main Memory Multi-Directory Hashing Technique. 191-197 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#AnalytiP93 2003-11-25 Exact complexity of Exact-Four-Colorability. 7-12 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00229-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Rothe03 2003-11-20 A Fuzzy Petri Net for Knowledge Representation and Reasoning. 165-171 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#GargAG91 2003-11-20 A Variation on the Zero-One Law. 29-30 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BlassGKL98 http://dx.doi.org/10.1016/S0020-0190(98)00078-7 2003-11-20 A New Privacy Homomorphism and Applications. 277-282 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Ferrer96 http://dx.doi.org/10.1016/S0020-0190(96)00170-6 2003-11-20 On a Graph Partition Problem with Application to VLSI Layout. 87-94 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#SenDG92 2003-11-20 A Note on Shared List Structure in LISP. 312-314 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#ClarkG78 2005-05-20 On the Security of Recent Protocols. 151-155 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#ClarkJ95 http://dx.doi.org/10.1016/0020-0190(95)00136-Z 2003-11-20 Improved Algorithms for Group Testing with Inhibitors. 57-64 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BonisV98 http://dx.doi.org/10.1016/S0020-0190(98)00088-X 2003-11-20 A Generating Function for Entropy. 51 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Sekey75 2003-11-20 The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Family of Algebraic Languages is Proper. 135-140 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Boasson73 2003-11-20 On the Routing Problem in Faulty Supercubes. 39-46 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#SenSB92 2003-11-20 Recognizing Shortest-Path Trees in Linear Time. 77-85 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#PengWL94 2003-11-20 Information Streams Sharing a Finite Buffer: Other Solutions. 16-21 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#CoopriderHCP74 2003-11-20 Generation of all the Balanced Parenthesis Strings in Lexicographical Order. 188-192 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Semba81 2003-11-20 A Linear-Time Algorithm for Finding All Feedback Vertices. 274-276 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#GareyT78 2003-11-20 Hierarchical broadcast and gossip networks. 131-136 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Fertin00 http://dx.doi.org/10.1016/S0020-0190(00)00014-4 2003-11-20 Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy. 169-172 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Larsen98 http://dx.doi.org/10.1016/S0020-0190(98)00007-6 2003-11-25 Determination of the topology of a directed network. 121-131 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00362-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Goldstein03 2003-11-20 On Cahit's Result on Graceful Permutations. 183-184 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#BongiovanniL78 2003-11-20 Performance of Distributive Partitioned Sort in a Demand Paging Environment. 61-64 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#HyslopL87 2003-11-20 Feedback vertex set in hypercubes. 1-5 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#FocardiLP00 http://dx.doi.org/10.1016/S0020-0190(00)00127-7 2003-11-20 ECFSM-Based Probabilistic Protocol Verification. 1-9 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#HuangHL95 http://dx.doi.org/10.1016/0020-0190(95)00056-I 2003-11-20 An Optimal Embedding of Cycles into Incomplete Hypercubes. 213-218 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#HuangHL99 http://dx.doi.org/10.1016/S0020-0190(99)00139-8 2003-11-20 Census Techniques Collapse Space Classes. 79-84 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Hemaspaandra94 2003-11-20 A Sweepline Algorithm to Solve the Two-Center Problem. 171-177 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#HuangHW94 2003-11-20 On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio. 123-129 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#HuangLV97 http://dx.doi.org/10.1016/S0020-0190(97)00114-2 2003-11-24 A fast algorithm for the alpha-connected two-center decision problem. 205-210 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00402-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#HuangTT03 2003-11-20 Two Design Patterns for Data-Parallel Computation Based on Master-Slave Model. 197-204 1999 70 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#HuangWT99 http://dx.doi.org/10.1016/S0020-0190(99)00057-5 2003-11-20 Functional Grammars. 146-150 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Lukaszewicz77 2003-11-20 Universal Grammars. 76-80 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Lukaszewicz82 2003-11-20 A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. 79-83 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#ChrobakLLR97 http://dx.doi.org/10.1016/S0020-0190(97)00099-9 2003-11-20 On the Power of Enumerative Counting. 119-125 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#SalujaS92 2003-11-20 On the Average Height of Trees in Digital Search and Dynamic Hashing. 64-66 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Regnier81 2003-11-24 The finite power problem revisited. 291-294 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00319-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Kirsten02 2003-11-20 Area-Time Tradeoffs for Bilinear Forms Computations in VLSI. 107-109 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#CodenottiL86a 2003-11-20 A VLSI Fast Solver for Tridiagonal Linear Systems. 111-114 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#CodenottiL86b 2003-11-20 Algebraic Techniques in Communication Complexity. 191-195 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#CodenottiMM95 http://dx.doi.org/10.1016/0020-0190(95)00158-9 2003-11-20 Constructing Full Spanning Trees for Cubic Graphs. 8-11 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Storer81 2003-11-20 VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix. 159-163 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#CodenottiRL85 2003-11-20 On Decision Trees for Orthants. 265-268 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Vassiliev97 http://dx.doi.org/10.1016/S0020-0190(97)00073-2 2003-11-25 On computing the semi-sum of two integers. 67-71 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00263-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Ruggieri03 2003-11-24 Comparative performance evaluation of Java threads for embedded applications: Linux Thread vs. Green Thread. 221-225 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00286-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#SungKPCS02 2003-11-20 Approximating Linear Programming is Log-Space Complete for P. 233-236 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Serna91 2003-11-20 Extension of Synthesis Algorithm of Recursive Processes to \mu-Calculus. 97-104 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#KimuraTS96 http://dx.doi.org/10.1016/0020-0190(96)00038-5 2003-11-24 Note on winning positions on pushdown games with [omega]-regular conditions. 285-291 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00445-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Serre03 2003-11-20 A Simple Algorithm for Learning O (log n)-Term DNF. 289-292 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Kushilevitz97 http://dx.doi.org/10.1016/S0020-0190(97)00026-4 2003-11-20 A Straightforward Iterative Algorithm for the Planar Voronoi Diagram. 155-160 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Tipper90 2003-11-20 A Note on Implementing Parallel Assignment Instructions. 91-95 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Sethi73 2003-11-20 Some Results on Addition/Subtraction Chains. 155-160 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Volger85 2003-11-20 Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker. 155-160 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Chrzastowski-WachtelTHR01 http://dx.doi.org/10.1016/S0020-0190(00)00219-2 2003-11-20 Parallel Dictionaries with Local Rules on AVL and Brother Trees. 79-85 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GabarroM98 http://dx.doi.org/10.1016/S0020-0190(98)00142-2 2003-11-20 A general method to speed up fixed-parameter-tractable algorithms. 125-129 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#NiedermeierR00 http://dx.doi.org/10.1016/S0020-0190(00)00004-1 2003-11-20 Checking Functional Consistency in Deductive Databases. 115-120 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#LambrichtsNPPT90 2003-11-20 Improving Bounds for the Number of Correlation Immune Boolean Functions. 209-212 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#ParkLSK97 http://dx.doi.org/10.1016/S0020-0190(97)00010-0 2003-11-20 NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems. 149-155 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#LiangMS96 http://dx.doi.org/10.1016/0020-0190(96)00037-3 2003-11-20 A Note on External Sorting Using Almost Single Input Buffering. 403-405 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Wright87 2003-11-20 Program Inversion in the Refinement Calculus. 95-100 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Wright91 2003-11-20 A Refinement of Replacement Selection. 107-111 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Wright99 http://dx.doi.org/10.1016/S0020-0190(99)00052-6 2003-11-20 Single Character Searching Methods and the shift-or Pattern-Matching Algorithm. 269-275 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Perleberg94 2003-11-20 A Lower Bound for Randomized On-Line Multiprocessor Scheduling. 51-55 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Sgall97 http://dx.doi.org/10.1016/S0020-0190(97)00093-8 2003-11-20 Some Properties of Commutation in Free Partially Commutative Monoids. 1-4 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Duboc85 2003-11-25 k-tuple domination in graphs. 45-50 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00233-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#LiaoC03 2003-11-20 Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings. 63-69 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Apostolico86 2003-11-20 Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem. 235-236 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Apostolico87 2003-11-20 A Lower Bound for On-Line Bin Packing. 76-79 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Liang80 2003-11-20 On the Feedback Vertex Set Problem in Permutation Graphs. 123-129 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Liang94 2003-11-20 Fast Parallel Algorithms for the Approximate Edge-Coloring Problem. 333-338 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Liang95 http://dx.doi.org/10.1016/0020-0190(95)00122-S 2003-11-20 Distributed Subcube Identification Algorithms for Reliable Hypercupes. 315-321 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Latifi91 2003-11-20 On the Fault-Diameter of the Star Graph. 143-150 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Latifi93 2003-11-20 An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons. 69-75 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#LiawL94 2003-11-20 Deadlock-Free Absorption of Barrier Synchronisations. 221-227 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#UtardH95 http://dx.doi.org/10.1016/0020-0190(95)00155-6 2003-11-25 Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor. 73-78 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00255-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#NockEK03 2003-11-20 Combinatorial Properties of Generalized Hypercube Graphs. 41-45 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#DuhCH96 http://dx.doi.org/10.1016/0020-0190(95)00173-5 2003-11-20 A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. 149-154 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#OellermannS95 http://dx.doi.org/10.1016/0020-0190(95)00071-J 2003-11-20 _C₌P. 63-69 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#YamakamiY99 http://dx.doi.org/10.1016/S0020-0190(99)00084-8 2003-11-20 On Two Theorems of Lenstra. 224-228 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Pajunen80 2003-11-20 An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems. 123-128 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Zemel84 2005-04-14 The 4-Star Graph is not a Subgraph of Any Hypercube. 199-203 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#ShenHCSGB93 http://dx.doi.org/10.1016/0020-0190(93)90119-T 2003-11-20 Design and Analysis of a Generalized Multi-Ring Architecture. 17-21 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#KrishnamachariM96 http://dx.doi.org/10.1016/0020-0190(96)00008-7 2003-11-20 A note on on-line scheduling with precedence constraints on identical machines. 149-153 2000 76 Inf. Process. Lett. 4-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Epstein00 http://dx.doi.org/10.1016/S0020-0190(00)00141-1 2003-11-20 Three Results of Comparison Between L Languages with and without Interaction. 7-10 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Ruohonen75 2003-11-20 A Note on Language Equations Involving Morphisms. 209-212 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Ruohonen78 2003-11-20 The Decidability of the F0L-D0L Equivalence Problem. 257-260 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Ruohonen79 2003-11-20 Comments on "A Synchronization Anomaly". 88-89 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Lamport76 2003-11-20 Modulus Division on a Two's Complement Machine. 215-217 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#WarrenFM81 2003-11-20 A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function. 63-67 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#IngemarssonW81 2003-11-20 The Dynamic Simulation of Recursive and Stack Manipulation Programs. 58-63 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Rytter81a 2003-11-20 Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata. 142-144 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Rytter81b 2003-11-20 A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. 145-146 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Rytter81c 2003-11-20 Time Complexity of Unambiguous Path Systems. 102-104 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Rytter82a 2003-11-20 A Simulation Result for Two-Way Pushdown Automata. 199-202 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Rytter83a 2003-11-20 An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages. 81-84 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Rytter86a 2003-11-20 Parallel Algorithms for a Class of Graphs Generated Recursively. 225-231 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#RytterS89 2003-11-20 On the Complexity of the Recognition of Parallel 2D-Image Languages. 225-229 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#RytterS91 2003-11-20 Structured Operating System Organization. 39-42 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Zelkowitz74 2003-11-20 Protection in a single-address-space environment. 25-32 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Lopriore00 http://dx.doi.org/10.1016/S0020-0190(00)00161-7 2003-11-20 Software-Controlled Cache Coherence Protocol for Multicache Systems. 125-130 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Lopriore89 2003-11-20 A Three-Restricted Normal Form Theorem for ET0L Languages. 97-100 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#YokomoriWL82 2003-11-20 A Note on the Horton-Strahler Number for Random Trees. 155-159 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#DevroyeK94 2003-11-20 A Note on the Horton-Strahler Number for Random Trees. 95-99 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#DevroyeK95 http://dx.doi.org/10.1016/0020-0190(95)00114-R 2003-11-25 Cuckoo hashing: Further analysis. 215-219 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00500-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#DevroyeM03 2003-11-20 A Generalization of Chordal Graphs and the Maximum Clique Problem. 61-66 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#ChmeissJ97 http://dx.doi.org/10.1016/S0020-0190(97)00044-6 2003-11-20 An Approximation Algorithm for the TSP. 77-81 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#BasartH89 2003-11-20 A Parallelization of Miller's n^log n Isomorphism Technique. 223-228 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ColbournST92 2003-11-20 Boundedness is Undecidable for Datalog Programs with a Single Recursive Rule. 281-287 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Abiteboul89 2003-11-20 Formality works. 137-142 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Hoogerwoord01 http://dx.doi.org/10.1016/S0020-0190(00)00210-6 2003-11-20 An Implementation of Mutual Inclusion. 77-80 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Hoogerwoord86 2003-11-20 A Calculational Derivation of the Casop Algorithm. 297-299 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Hoogerwoord90 2003-11-20 Some Upper Bounds for Minimal Trees. 209-213 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Basart91 2003-11-20 Single Jog Minimum Area Joining of Compacted Cells. 167-172 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#LimCC93 2003-11-20 An Optimal Algorithm for Reconstructing a Binary Tree. 113-115 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#KamakotiR92 2003-11-20 Learning classifier systems: New models, successful applications. 23-30 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#HolmesLSW02 http://dx.doi.org/10.1016/S0020-0190(01)00283-6 2003-11-20 <i>k</i>-Term DNF. 75-79 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#CastroGL98 http://dx.doi.org/10.1016/S0020-0190(98)00090-8 2003-11-25 Disjunctive partial deduction of a right-to-left string-matching algorithm. 235-241 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00309-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HernandezR03 2003-11-20 Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities. 267-269 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#BaronU89 2003-11-25 Cryptanalysis of "an identity-based society oriented signature scheme with anonymous signers". 295-298 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00224-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Shao03a 2003-11-20 Bit Complexity of Order Statistics on a Distributed Star Network. 127-132 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#GerstelMZ89 2003-11-20 Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation. 141-145 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#ShawT77 2003-11-20 Interval Analysis, Pagination and Program Locality. 91-96 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#InnesT76 2003-11-20 Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions''. 221-222 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Dunne90 2003-11-20 Recursive Descent Parsing Using Implementation Languages Requiring Definition Before Use. 255-258 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Barnard83 2003-11-20 Processor-Efficient Exponentiation in Finite Fields. 81-86 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Gathen92 2003-11-20 Parallel Implementation of Path Expressions. 291-295 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Czaja78a 2003-11-20 Deadlock and Fairness in Parallel Schemas: A Set-Theoretic Characterization and Decision Problems. 234-239 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Czaja80a 2003-11-20 The Optimum Execution Order of Queries in Linear Storage. 141-145 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#KolliasMP90 2003-11-20 Bounds for the Element Distinctness Problem on one-tape Turing machines. 75-79 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Petersen02 http://dx.doi.org/10.1016/S0020-0190(01)00201-0 2003-11-20 Refined Simulation of Multihead Automata. 229-233 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Petersen94 2003-11-20 On Space Functions Fully Constructed by Two-Dimensional Turing Machines. 9-10 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Petersen95 http://dx.doi.org/10.1016/0020-0190(94)00228-Q 2003-11-20 Tables of Large Graphs with Given Degree and Diameter. 10-13 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#BermondDQ82 2003-11-20 Equivalence of Multistage Interconnection Networks. 45-50 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#BermondFJ87 2003-11-20 A Fully Parallel Algorithm for Residue to Binary Conversion. 1-8 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#BarsiP94 2003-11-20 A Fully Parallel Algorithm for Residue to Binary Conversion. 25-26 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#BarsiP95 http://dx.doi.org/10.1016/0020-0190(95)00034-A 2003-11-20 A Unified Approch for Showing Language Inclusion and Equivalence Between Various Types of omega-Automata. 301-308 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ClarkeDK93 2003-11-20 The D0L-ness for Context-Free Languages is Decidable. 149-151 1976 5 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Linna76 2003-11-20 A Note on Colored Petri Nets. 40-43 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Peterson80 2003-11-20 Myths About the Mutual Exclusion Problem. 115-116 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Peterson81 2003-11-20 On the Modularization Theorem for Logical Specifications. 287-293 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#VelosoM95 http://dx.doi.org/10.1016/0020-0190(94)00203-B 2003-11-20 On local modularity variants and -institutions. 247-253 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#VelosoV01 http://dx.doi.org/10.1016/S0020-0190(00)00160-5 2003-11-20 On Methods for Safe Introduction of Operations. 231-238 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#VelosoV97 http://dx.doi.org/10.1016/S0020-0190(97)00161-0 2004-06-18 A Characterization of Systems Derived From Terminating Concurrent Histories. 148-152 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Barnden80 2003-11-20 The Denotational Semantics of Sequential Machines. 1-3 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Gordon80 2003-11-20 Eliminating the Flag in Threaded Binary Search Trees. 209-214 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Gordon86 2003-11-20 Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. 175-179 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#BarthR94 2003-11-20 A Tight Lower Bound on the Size of Visibility Graphs. 61-64 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#ShenE87 2003-11-20 A Note on Minimal Visibility Graphs. 101 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ShenH93 2003-11-20 Scheduling on a Hypercube. 323-328 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#ShenR91 2003-11-20 Optimal Parallel Selection in Sorted Matrices. 117-122 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#ShenR96 http://dx.doi.org/10.1016/0020-0190(96)00100-7 2003-11-24 Restricted rotation distance between binary trees. 333-338 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00315-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Cleary02 2003-11-25 A combinatorial characterization of treelike resolution space. 295-300 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00345-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#EstebanT03 2003-11-20 Efficient Edge Domination Problems in Graphs. 221-228 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#GrinsteadSSH93 2003-11-20 A Well-Characterized Approximation Problem. 301-305 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#HastadPS93 2003-11-20 Scheduling periodic tasks on uniform multiprocessors. 97-104 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Baruah01 http://dx.doi.org/10.1016/S0020-0190(01)00148-X 2003-11-20 Liu and Layland's schedulability test revisited. 157-161 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#DevillersG00 http://dx.doi.org/10.1016/S0020-0190(00)00016-8 2003-11-20 Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. 157-164 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#DevillersG95 http://dx.doi.org/10.1016/0020-0190(95)00132-V 2003-11-20 Realization of Petri Nets Without Conditional Statements. 105-107 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#DevillersL73 2003-11-20 A General Mechanism for Avoiding Starvation with Distributed Control. 156-158 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#DevillersL78 2003-11-20 Efficient Allocation of Chain-Like Task on Chain-Like Network Computers. 241-245 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#SheuC90 2003-11-20 Efficient Parallel k Selection Algorithm. 313-316 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#SheuT90 2003-11-20 Simulations Between Two Reconfigurable Mesh Models. 137-142 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#ShiRW95 http://dx.doi.org/10.1016/0020-0190(95)00082-N 2003-11-20 A Technique for Reducing Comparison Times in Certain Applications of the Merging Method of Sorting. 127-128 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Barnett73 2003-11-20 An Algorithm for Coalescing Operations with Precedence Constraints in Real-Time Systems. 129-133 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#LiuCL93 2003-11-20 Systolic Partitioning Algorithms. 13-18 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Megson93 2003-11-20 A Generalized Model for Understanding Evasiveness. 205-208 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#AggarwalCK89 2003-11-20 An Efficient Selection Algorithm on the Pyramid. 37-47 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#AggarwalJG95 http://dx.doi.org/10.1016/0020-0190(94)00160-Z 2003-11-20 Lower Bounds for Robust Secret Sharing Schemes. 317-321 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BlundoS97 http://dx.doi.org/10.1016/S0020-0190(97)00135-X 2003-11-25 A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults. 271-278 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Shih03a 2003-11-20 Propositional Description of Finite Cause-Effect Structures. 111-117 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#HolenderskiS88 2003-11-25 A note on finding all homogeneous set sandwiches. 147-151 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00265-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HabibLP03 2003-11-20 An O(log n) Algorithm for Computing General Order-k Fibonacci Numbers. 68-75 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#WilsonS80 2003-11-20 An O(n log n+m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs. 129-134 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#ShihH89 2003-11-20 Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines. 275-281 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#LiuYC99 http://dx.doi.org/10.1016/S0020-0190(99)00026-5 2003-11-20 An Improved LALR(k) Parser Generation for Regular Right Part Grammars. 123-129 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ShinC93 2003-11-20 Characterization of Idempotent Transformation Monoids. 163-166 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Beaudry89 2003-11-20 Generating Words in a Context-Free Language Uniformly at Random. 95-99 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Mairson94 2003-11-20 Optimum Ordered Bi-Weighted Binary Trees. 67-70 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Shing83 2003-11-20 Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems. 158-161 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#UmeoMS82 2003-11-20 Representations and Complete Semiring Morphisms. 293-298 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Kuich95 http://dx.doi.org/10.1016/0020-0190(95)00169-7 2003-11-20 Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs. 229-232 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Mitchell79 2003-11-20 A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. 229-233 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#DellOlmoKST98 http://dx.doi.org/10.1016/S0020-0190(97)00216-0 2003-11-25 Inequality of finite behaviors of rational weight finite automata is in R. 139-145 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00264-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Litow03 2003-11-20 On Iterated Integer Product. 269-272 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Litow92 2003-11-20 The Influence of Graph Structure on Generalized Dimension Exchange. 347-353 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Litow95 http://dx.doi.org/10.1016/0020-0190(95)00062-H 2003-11-20 A Linear Algorithm of a Deadlock Avoidance for Nonpreemptible Resources. 87-94 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Klupsz84 2003-11-20 On the Real-Number Representation with Variable-Length Exponent Field. 1-6 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#AkinariH94 2003-11-20 Consecutive Retrieval Property-Revisited. 15-20 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#DeogunG99 http://dx.doi.org/10.1016/S0020-0190(98)00186-0 2003-11-20 Optimal Routing in Toroidal Networks. 285-291 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#JerebicT92 2005-02-16 Increasing Search Efficiency Using Multiple Heuristics. 275-275 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ChakrabartiGPS89a 2003-11-20 On a characterization of the standard Gray code by using its edge type on a hypercube. 231-237 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#KobayashiS02 http://dx.doi.org/10.1016/S0020-0190(01)00237-X 2003-11-20 Occam's Razor. 377-380 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#BlumerEHW87 2003-11-20 Good and Semi-Strong Colorings of Oriented Planar Graphs. 171-174 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#RaspaudS94 2003-11-20 On the Complexity of Interactive Proofs with Bounded Communication. 205-214 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#GoldreichH98 http://dx.doi.org/10.1016/S0020-0190(98)00116-1 2003-11-20 The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. 45-49 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#GoldreichP90 2003-11-20 On Universal Learning Algorithms. 131-136 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#GoldreichR97 http://dx.doi.org/10.1016/S0020-0190(97)00117-8 2003-11-20 A Framework to Animate String Algorithms. 241-244 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Baeza-YatesF96 http://dx.doi.org/10.1016/0020-0190(96)00117-2 2003-11-20 Fast and Practical Approximate String Matching. 21-27 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Baeza-YatesP96 http://dx.doi.org/10.1016/0020-0190(96)00083-X 2003-11-20 Fast Two-Dimensional Pattern Matching. 51-57 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Baeza-YatesR93 2003-11-20 Optimal bounded disorder. 151-157 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Baeza-YatesS02 http://dx.doi.org/10.1016/S0020-0190(01)00326-X 2003-11-24 On the linear complexity profile of explicit nonlinear pseudorandom numbers. 13-18 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00335-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#MeidlW03 2003-11-20 A Deficiency of Natural Deduction. 233-234 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Wiltink87 2004-06-08 A New Computation Rule for Prolog. 249-252 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Kumar88 http://dx.doi.org/10.1016/0020-0190(88)90087-7 2003-11-20 Concurrency Control on Extendible Hashing. 35-41 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Kumar89 2003-11-20 Computing the Minimum Cover of Functional Dependencies. 157-159 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Shock86 2003-11-20 On the Relationship Between the LL(k) and LR(k) Grammars. 97-101 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Nijholt82a 2004-07-26 An Application of Ramp Schemes to Broadcast Encryption. 131-135 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#StinsonW99 http://dx.doi.org/10.1016/S0020-0190(98)00204-X 2003-11-20 A note on closure properties of logspace MOD classes. 91-93 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#HertrampfRV00 http://dx.doi.org/10.1016/S0020-0190(00)00091-0 2003-11-20 Complete Operator Precedence Conditions. 60-62 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Williams77 2003-11-20 Cubic Map Configurations. 180-185 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Williams80 2003-11-20 A Systematic Test for Extended Operator Precedence. 187-190 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Williams81 2003-11-20 Is an Exit Statement Sufficient? 47-51 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Williams83 2003-11-20 Overlap Closures do not Suffice for Termination of General Term Rewriting Systems. 9-11 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Zhang91 2003-11-20 The Pre-NTS Property is Undecidable for Context-Free Grammars. 181-184 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Zhang92 2003-11-20 A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer. 145-148 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Zhang97 http://dx.doi.org/10.1016/S0020-0190(97)00006-9 2003-11-20 ²) algorithm for computing the min-transitive closure of a weighted graph. 215-220 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Kundu00 http://dx.doi.org/10.1016/S0020-0190(00)00064-8 2003-11-20 A Linear Algorithm for the Hamiltonian Completion Number of a Tree. 55-57 1976 5 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Kundu76