2003-11-20 Sorting Tree, Nestling Tree and Inverse Permutation. 94-96 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Kundu77 2003-11-20 An Intermediate-Value Theorem for Optimum Tree Valuation. 141-145 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Kundu79 2003-11-20 Analysis of the Worst Case Space Complexity of a PR Quadtree. 263-267 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#PemmarajuS94 2003-11-20 Branching Bisimilarity is an Equivalence Indeed! 141-147 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Basten96 http://dx.doi.org/10.1016/0020-0190(96)00034-8 2003-12-03 Optimal Value for the Newton-Raphson Division Algorithm. 141-144 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ParkerH92 2003-11-20 Constructing Sorting Networks from k-Sorters. 157-162 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#ParkerP89 2003-11-20 On the Deterministic Complexity of Factoring Polynomials over Finite Fields. 261-267 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Shoup90 2003-11-20 Smoothness and Factoring Polynomials Over Finite Fields. 39-42 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Shoup91 2003-11-20 Scaling multiple addition and prefix sums on the reconfigurable mesh. 277-282 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#TrahanV02 http://dx.doi.org/10.1016/S0020-0190(01)00299-X 2003-11-20 Updating Timestamp Interval for Dynamic Adjustment of Serialization Order in Optimistic Concurrency Control-Time Interval (OCCTI) Protocol. 189-193 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#KonanaLR97 http://dx.doi.org/10.1016/S0020-0190(97)00121-X 2003-11-20 The Complexity of Symmetrizing Matrices. 108-109 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Colbourn79 2003-11-20 The Duodirun Merging Algorithm: A New Fast Algorithm for Parallel Merging. 167-168 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Zheng83 2003-11-20 On Key Agreement Protocols Based on Tamper-Proof Hardware. 49-54 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Zheng95 http://dx.doi.org/10.1016/0020-0190(94)00174-W 2003-11-20 A Note on `A Cryptosystem for Multiple Communication'. 179-181 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Meijer81 2003-11-20 Constructor Equivalent Term Rewriting Systems. 131-137 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#DurandS93 2003-11-20 Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof. 137-145 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#DurandS94 2003-11-20 A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem. 229-234 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#LikasS95 http://dx.doi.org/10.1016/0020-0190(94)00189-6 2003-11-20 Parallel Tree-Contraction and Fibonacci Numbers. 267-271 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#PlandowskiRS96 http://dx.doi.org/10.1016/0020-0190(96)00118-4 2003-11-20 A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. 201-206 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#McCallumA79 2003-11-20 Real Scaled Matching. 185-190 1999 70 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#AmirBL99 http://dx.doi.org/10.1016/S0020-0190(99)00060-5 2003-11-20 The Complexity of Finding Uniform Emulations on Fixed Graphs. 137-141 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Bodlaender88a 2003-11-25 A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. 87-91 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00474-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#GaurGK03 2003-11-20 An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems. 183-188 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#KrishnamurtiG99 http://dx.doi.org/10.1016/S0020-0190(99)00151-9 2003-11-20 Bit-Optimal Election in Synchronous Rings. 53-56 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#BodlaenderT90 2003-11-20 Alphabet Dependence in Parameterized Matching. 111-115 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#AmirFM94 2003-11-20 A Linear Algorithm for the Domination Number of a Tree. 41-44 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#CockayneGH75 2003-11-20 Deriving Graphical Representations of Process Networks from Algebraic Expressions. 289-294 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Bolognesi93 2003-11-20 Approximate swapped matching. 33-39 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#AmirLP02 http://dx.doi.org/10.1016/S0020-0190(01)00302-7 2003-11-20 Online timestamped text indexing. 253-259 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#AmirLU02 http://dx.doi.org/10.1016/S0020-0190(01)00275-7 2003-11-20 Onion Polygonizations. 165-173 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#AbellanasGHHSU96 http://dx.doi.org/10.1016/0020-0190(95)00193-X 2003-11-20 An Algorithm for the Most Economic Link Addition in a Tree Communication Network. 171-175 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#CockayneRT79 2003-11-20 A Modification of the Greedy Algorithm for Vertex Cover. 23-25 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Clarkson83 2003-11-20 Linear Programming in O(n * (3_d)_2) Time. 21-24 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Clarkson86 2003-11-20 Comments on the All Nearest-Neighbor Problem for Convex Polygons. 105-107 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#FournierK79 2003-11-20 Under the spell of Leibniz's dream. 53-61 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Dijkstra01 http://dx.doi.org/10.1016/S0020-0190(00)00204-0 2003-11-20 Computing Kernels in Directed Bichromatic Graphs. 5-11 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KargerB97 http://dx.doi.org/10.1016/S0020-0190(97)00035-5 2003-11-20 Information Streams Sharing a Finite Buffer. 179-180 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Dijkstra72 2003-11-20 Making a Fair Roulette From a Possibly Biased Coin. 193 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Dijkstra90 2003-11-20 Heuristics for a Calculational Proof. 141-143 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Dijkstra95 http://dx.doi.org/10.1016/0020-0190(94)00196-6 2003-11-20 ``Everywhere'' in Predicate Algebra and Modal Logic. 237-243 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Dijkstra96 http://dx.doi.org/10.1016/0020-0190(96)00055-5 2003-11-20 Sequential Calculus. 123-130 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#KargerH95 http://dx.doi.org/10.1016/0020-0190(94)00205-D 2003-11-20 Logic VS. Complexity Theoretic Properties of the Graph Accessibility Problem for Directed Graphs of Bounded Degree. 143-146 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Meinel90 2003-11-25 How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. 137-141 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00483-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#BornHW03 2003-11-20 Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. 281-284 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#MadlenerO87 2003-11-20 A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. 165-167 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#MandoiuZ00 http://dx.doi.org/10.1016/S0020-0190(00)00095-8 2003-11-20 Computing the Average Distance of an Interval Graph. 311-314 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Dankelmann93 2003-11-20 Pruned Three-Dimensional Toroidal Networks. 179-183 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#KwaiP98 http://dx.doi.org/10.1016/S0020-0190(98)00164-1 2003-11-20 Variables and scopes considered formally. 33-38 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Hehner01 http://dx.doi.org/10.1016/S0020-0190(00)00163-0 2003-11-20 Bunch Theory: A Simple Set Theory for Computer Science. 26-30 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Hehner81 2003-11-20 Real-Time Programming. 51-56 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Hehner89 2003-11-20 The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank. 137-141 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Simon91 2003-11-20 A Note on Lexicographic Breadt First Search for Chordal Graphs. 249-251 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Simon95 http://dx.doi.org/10.1016/0020-0190(95)00024-7 2003-11-20 Pattern Matching for Permutations. 277-283 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#BoseBL98 http://dx.doi.org/10.1016/S0020-0190(97)00209-3 2003-11-20 Dynamic Programming on Linear Pipelines. 333-341 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Myoupo91 2003-11-20 Corrigenda: Dynamic Programming on Linear Pipelines. 289 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Myoupo92 2003-11-20 Towards an Understanding of Unbounded Variables in Asynchronous Systems. 7-17 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Singh92 2003-11-20 Real-Time Leader Election. 57-61 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Singh94 2003-11-20 Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits. 275-282 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Sinha98 http://dx.doi.org/10.1016/S0020-0190(98)00182-3 2003-11-20 A Space-Saving Technique for Assigning Algol 68 Multiple Values. 97-99 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Meertens76 2003-11-20 On the minimum size of visibility graphs. 223-230 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#OlaverriHNT02 http://dx.doi.org/10.1016/S0020-0190(01)00227-7 2003-11-20 A Generalization of the Method of Finite Differences. 55-59 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#HolnapySB73 2003-11-20 Liveness, Fairness, and Recurrence in Petri Nets. 269-27 1999 70 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#KindlerA99 http://dx.doi.org/10.1016/S0020-0190(99)00074-5 2003-11-20 Mutex Needs Fairness. 31-39 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KindlerW97 http://dx.doi.org/10.1016/S0020-0190(97)00033-1 2003-11-20 On the Complexity of Test Case Generation for NP-Hard Problems. 135-140 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Sanchis90 2003-11-20 Strong NP-Hardness of Moving Many Discs. 55-59 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#SpirakisY84 2003-11-20 Author's Reply to Warren Burton's Comments on Distributive Partitioning Sorting. 206 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Dobosiewicz78a 2003-11-20 Generating all maximal models of a Boolean expression. 157-162 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#KavvadiasSS00 http://dx.doi.org/10.1016/S0020-0190(00)00023-5 2003-11-25 WMT - from a personal perspective. 3-6 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00388-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Madey03 2003-11-20 Selecting Small Ranks in EREW PRAM. 183-186 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#RamnathR99 http://dx.doi.org/10.1016/S0020-0190(99)00113-1 2003-11-20 On Two-Processor Scheduling and Maximum Matching in Permutation Graphs. 321-327 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#RamnathS96 http://dx.doi.org/10.1016/0020-0190(96)00018-X 2003-11-20 A Note on the Construction of Marked Graphs. 211-215 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#ThirusanguR95 http://dx.doi.org/10.1016/0020-0190(95)00076-O 2003-11-20 A faster off-line algorithm for the TCP acknowledgement problem. 71-73 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#NogaSW02 http://dx.doi.org/10.1016/S0020-0190(01)00199-5 2003-11-20 Self-Stabilizing Depth-First Search. 297-301 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#CollinD94 2003-11-20 On the isomorphism of expressions. 97-102 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#RamnathZ00 http://dx.doi.org/10.1016/S0020-0190(00)00050-8 2003-11-20 On Finding a Cycle Basis with a Shortest Maximal Cycle. 55-58 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#ChickeringGH95 http://dx.doi.org/10.1016/0020-0190(94)00231-M 2003-11-20 Election in a Complete Network with a Sense of Direction. 185-187 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#LouiMW86 2003-11-20 Election in a Complete Network with a Sense of Direction. 327 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#LouiMW88 2003-11-20 A Note on the Complexity of the Chromatic Number Problem. 66-67 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Lawler76 2003-11-20 A Note on Cyclic Closure Operations. 15-16 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#InoueT79 2003-11-20 A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata. 245-248 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#InoueT80 2003-11-20 Some Considerations About NPRIORITY(1) Without ROM. 215-219 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#InoueT88 2003-11-25 Optimal search for rationals. 23-26 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00455-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#KwekM03 2003-11-20 A Fully Distributed (Minimal) Spanning Tree Algorithm. 55-62 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#LavalleeR86 2003-11-20 Hamming Weights of Correlation Immune Boolean Functions. 149-153 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#MaitraS99 http://dx.doi.org/10.1016/S0020-0190(99)00091-5 2003-11-20 Fast Computation of the Euclidian Distance Maps for Binary Images. 181-184 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#KolountzakisK92 2005-06-08 Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs. 195-200 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#ZhouM03 2003-11-20 A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form. 63-69 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Warners98 http://dx.doi.org/10.1016/S0020-0190(98)00144-6 2003-11-20 Simple Bounds on the Convergence Rate of an Ergodic Markov Chain. 81-87 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#PilarskiK93 2003-11-20 A New Method for Implementing LR(k) Tables. 171-176 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#AnconaG81 2003-11-25 Reducing the blocking in two-phase commit with backup sites. 39-47 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00449-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#ReddyK03 2003-11-20 An O(log N) Algorithm to Solve Linear Recurrences on Hypercubes. 319-325 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#ReddyL94 2003-11-20 <i>m</i>Gates. 87-90 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Grolmusz98 http://dx.doi.org/10.1016/S0020-0190(98)00093-3 2003-11-20 Range Searching in Low-Density Environments. 121-127 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#SchwarzkopfV96 http://dx.doi.org/10.1016/S0020-0190(96)00154-8 2003-11-20 Dynamic Programming on Two-Dimensional Systolic Arrays. 97-104 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#LoukaT88 2003-11-20 Palindromes in the Fibonacci Word. 217-221 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Droubay95 http://dx.doi.org/10.1016/0020-0190(95)00080-V 2003-11-20 Generating Polynomial Orderings. 85-93 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Steinbach94 2005-03-15 Towards the Minimum Set of Primitive Relations in Temporal Logic. 121-126 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#ZhuLS87 2003-11-20 Some Remarks on One-Pebble Rectangular Array Acceptors. 80-84 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Nakamura81 2003-11-20 The Complexity of the Reliable Connectivity Problem. 245-252 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#KavadiasKS91 2003-11-20 Multitolerant Barrier Synchronization. 29-36 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#KulkarniA97 http://dx.doi.org/10.1016/S0020-0190(97)00143-9 2003-11-20 Efficient Algorithms for the Temporal Precedence Problem. 71-81 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#RanjanPG98 http://dx.doi.org/10.1016/S0020-0190(98)00141-0 2003-11-20 Polyominos and Perfect Graphs. 57-61 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Maire94 2003-11-20 Factoring Numbers in O(log n) Arithmetic Steps. 28-31 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Shamir79 2003-11-20 Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems. 77-79 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Shamir83 2003-11-20 Partial Evaluation of Queries for Bit-Sliced Signature Files. 305-311 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#KocberberC96 http://dx.doi.org/10.1016/S0020-0190(96)00176-7 2003-11-20 A Grid Embedding into the Star Graph for Image Analysis Solutions. 255-260 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#NassifB96 http://dx.doi.org/10.1016/S0020-0190(96)00165-2 2003-11-20 A Remark on NP-Completeness of Picture Matching. 241-243 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#TucciCC91 2003-11-20 A Family of Codes Commutatively Equivalent to Prefix Codes. 1-4 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#MauceriR81 2003-11-20 A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. 315-322 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#NakanoRN97 http://dx.doi.org/10.1016/S0020-0190(97)00083-5 2003-11-20 Priority Processes Used for Scheduling Within a Tree Structured Operating System. 187-190 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Varney72 2003-11-20 Parallel Hashing Algorithms. 8-13 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#GotoIG77 2003-11-20 Clouds over a public key cryptosystem based on Lyndon words. 239-242 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#VascoS01 http://dx.doi.org/10.1016/S0020-0190(01)00170-3 2003-11-20 An Observation Concerning Constraint-Based Compaction. 119-122 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Maley87 2003-11-20 On enumeration of catastrophic fault patterns. 209-212 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#MaityRN02 http://dx.doi.org/10.1016/S0020-0190(01)00231-9 2003-11-20 The shortest path in parallel. 213-217 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Sanders01 http://dx.doi.org/10.1016/S0020-0190(00)00203-9 2003-11-20 Random Permutations on Distributed, External and Hierarchical Memory. 305-309 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Sanders98 http://dx.doi.org/10.1016/S0020-0190(98)00127-6 2003-11-20 Simple Algorithms for Traversing a Tree Without an Auxiliary Stack. 143-145 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Dwyer73 2003-11-24 Reporting intersections among thick objects. 87-92 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00347-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Vigneron03 2003-11-20 Local Search, Reducibility and Approximability of NP-Optimization Problems. 73-79 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#AusielloP95 http://dx.doi.org/10.1016/0020-0190(95)00006-X 2003-11-20 Maximum weight independent sets and cliques in intersection graphs of filaments. 181-188 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Gavril00 http://dx.doi.org/10.1016/S0020-0190(00)00025-9 2003-11-20 Algorithms for maximum weight induced paths. 203-208 2002 81 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Gavril02 http://dx.doi.org/10.1016/S0020-0190(01)00222-8 2003-11-20 An Algorithm for Testing Chordality of Graphs. 110-112 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Gavril75 2003-11-20 Testing for Equality Between Maximum Matching and Minimum Node Covering. 199-202 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Gavril77 2003-11-20 An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. 285-290 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Gavril93 2003-11-20 Practical Variations of Shellsort. 37-43 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#IncerpiS87 2003-11-20 A Complete Axiomatization of Full Acyclic Join Dependencies. 133-139 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Malvestuto98 http://dx.doi.org/10.1016/S0020-0190(98)00148-3 2003-11-20 Stabilizing Unison. 171-175 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#GoudaH90 2003-11-24 The Minkowski sum of a simple polygon and a segment. 179-184 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00403-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#PustylnikS03 2003-11-20 Identifying Periodic Occurrences of a Template with Applications to Protein Structure. 11-18 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#FischettiLSS93 2003-11-20 A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. 1-7 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Manku96 http://dx.doi.org/10.1016/0020-0190(96)00088-9 2003-11-20 Binary Search Networks: A New Method for Key Searching. 59-65 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#YubaH87 2003-11-20 The Demand Operation in the Schematic Protection Model. 213-219 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Sandhu89a 2003-11-20 A Partitioning Algorithm for Minimum Weighted Euclidean Matching. 59-62 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#DyerF84 2003-11-20 Construction of Halvers. 303-307 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Manos99 http://dx.doi.org/10.1016/S0020-0190(99)00032-0 2003-11-20 A Note on the Approximation of the MAX CLIQUE Problem. 1-5 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#CrescenziFS91 2004-09-28 An Optimization Problem Related to Neural Networks. 155-157 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Janssen91 2003-11-20 Packing Items from a Triangular Distribution. 351-362 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#KrauseLV87 2003-11-20 Fast Composition of Sparse Maps. 183-185 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Sharir82 2003-11-20 The Shortest Watchtower and Related Problems for Polyhedral Terrains. 265-270 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Sharir88 2003-11-20 A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder. 187-190 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Sharir89 2003-11-20 Excess in Arrangements of Segments. 245-247 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Sharir96 http://dx.doi.org/10.1016/0020-0190(96)00065-8 2003-11-20 Allocation Techniques for Distributed Reduction Data Elements. 137-142 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#WeemsS94 2003-11-24 Scheduling time-constrained multicast messages in circuit-switched tree networks. 109-116 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00226-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Kwon02a 2003-11-20 Approximation algorithms for general parallel task scheduling. 143-150 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#KwonC02 http://dx.doi.org/10.1016/S0020-0190(01)00210-1 2003-11-20 List Scheduling Bounds for UET Systems With Resources. 28-31 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Lloyd80 2003-11-20 Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources. 40-45 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Lloyd81 2003-11-20 On a Simple Deadlock Recovery Problem. 175-178 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Lloyd83 2003-11-20 A Fast Algorithm for Finding Interlocking Sets. 47-50 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Lloyd89 2003-11-20 A conservative scheme for parallel interval narrowing. 141-146 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#GranvilliersH00 http://dx.doi.org/10.1016/S0020-0190(00)00048-X 2003-11-20 An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images. 295-300 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#FujiwaraMF95 http://dx.doi.org/10.1016/0020-0190(95)00041-A 2003-11-20 Limitations of the Chase. 154-156 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#GoodmanS81 2003-11-20 A Characterization of Multivalued Dependencies Equivalent to a Join Dependency. 261-266 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#GoodmanT84 2003-11-20 Static Filtering on Stratified Programs. 237-244 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ChangCH93a 2003-11-20 The Complexity of Finding Arborescences in Hypergraphs. 161-164 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Woeginger92a 2003-11-20 A Case for a Forward Predicate Transformer. 196-198 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Francez77 2003-11-20 Cooperating Proofs for Distributed Programs with Multiparty Interactions. 235-242 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Francez89 2003-11-20 Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. 57 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Francez90 2003-11-20 On the Equal-Subset-Sum Problem. 299-302 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#WoegingerY92 2003-11-20 Uniform Inevitability is Tree Automaton Ineffable. 77-79 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Emerson87 2003-11-20 Sensitivity vs. Block Sensitivity (an Average-Case Study). 151-157 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Bernasconi96 http://dx.doi.org/10.1016/0020-0190(96)00105-6 2003-11-20 On the Complexity of Balanced Boolean Functions. 157-163 1999 70 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Bernasconi99 http://dx.doi.org/10.1016/S0020-0190(99)00061-7 2003-11-20 An Inproved Upper Bound on the Non-3-Colourability Threshold. 17-23 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#DunneM98 http://dx.doi.org/10.1016/S0020-0190(97)00193-2 2003-11-20 A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. 73-76 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#GrigoriadisK86 2003-11-20 On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions. 167-173 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Flammini94 2003-11-20 A New Safety Test for Deadlock Avoidance. 115-120 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Cellary79 2003-11-20 An O(|V|³) Algorithm for Finding Maximum Flows in Networks. 277-278 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#MalhotraKM78 2003-11-20 Modelling and Animating Information Systems Dynamics. 123-127 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Tsalgatidou90 2003-11-20 Syntactic Error Repair Using Repair Patterns. 189-196 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#YunCH93 2003-11-20 A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees. 273-276 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Seiferas88 2003-11-20 Are There Interactive Protocols for CO-NP Languages? 249-251 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#FortnowS88 2003-11-20 On the Power of Two-Local Random Reductions. 303-306 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#FortnowS92 2003-11-20 Storage-Efficient Data Structure for Large Lookup Dictionaries. 201-206 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#MalhotraSK96 http://dx.doi.org/10.1016/0020-0190(96)00028-2 2003-11-20 An Improved Data-Dependency-Based Backtracking Scheme for Prolog. 185-189 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#MalhotraTK89 2003-11-20 Approximation algorithms for the TSP with sharpened triangle inequality. 133-138 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BockenhauerHKSU00 http://dx.doi.org/10.1016/S0020-0190(00)00089-2 2003-11-20 A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. 41-48 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#MukherjeeC02 http://dx.doi.org/10.1016/S0020-0190(01)00305-2 2003-11-20 Pipelining Tree-Structured Algorithms on Simd Architectures. 79-84 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#BarnardS90 2003-11-20 Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study. 241-245 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#FrankGW98 http://dx.doi.org/10.1016/S0020-0190(97)00222-6 2003-11-24 Efficient generation of plane trees. 167-172 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00240-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Nakano02 2003-11-24 A simple proof of the uniform consensus synchronous lower bound. 47-52 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00333-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KeidarR03 2003-11-20 A Bounded-Space Tree Traversal Algorithm. 215-219 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#HirschbergS93 2003-11-20 Improved Update/Query Algorithms for the Interval Valuation Problem. 307-310 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#HirschbergV87 2003-11-20 Simple LPO Constraint Solving Methods. 65-69 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Nieuwenhuis93 2003-11-20 Characteristic Inequalities for Binary Trees. 201-207 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#PriscoP95 http://dx.doi.org/10.1016/0020-0190(94)00193-3 2003-11-20 On Binary Search Trees. 249-253 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#PriscoS93 2003-11-20 Some Observations Concerning Alternating Turing Machines Using Small Space. 1-9 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#ChangIRB87 2003-11-20 Sooner is Safer Than Later. 135-141 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Henzinger92 2003-11-20 Distributed Termination Detection with Roughly Synchronized Clocks. 105-108 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#MayoK94 2003-11-20 A Note on Linear Precedence Functions. 81 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Shyamasundar76 2003-11-20 Recursion and Stacks. 115-116 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Mayoh72 2003-11-20 Models of Programs and Processes. 211-214 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Mayoh83 2003-11-20 On Computing a Conditional Edge-Connectivity of a Graph. 195-199 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#EsfahanianH88 2003-11-20 The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors. 141-147 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Kubale87 2003-11-20 A Note on the Complexity of Local Search Problems. 69-75 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Fischer95 http://dx.doi.org/10.1016/0020-0190(94)00184-Z 2003-11-20 On a Language Without Star. 27-30 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Latteux83 2003-11-20 Modelling a Fast Parallel Thinning Algorithm for Shared Memory SIMD Computers. 257-261 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#MahapatraP91 2003-11-20 Approximating Functions by Their Poisson Transform. 127-130 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Poblete86 2003-11-20 On the geometry of similarity search: Dimensionality curse and concentration of measure. 47-51 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Pestov00 http://dx.doi.org/10.1016/S0020-0190(99)00156-8 2003-11-20 Noiselike Transforms of omega-Events. 105-108 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Feyock76 2003-11-20 Disjoint Hamiltonian Cycles in Recursive Circulant Graphs. 259-264 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Micheneau97 http://dx.doi.org/10.1016/S0020-0190(97)00020-3 2003-11-20 Algorithms for Deciding the Containment of Polygons. 261-265 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Barrera96 http://dx.doi.org/10.1016/0020-0190(09)60016-8 2003-11-20 Modeling B-Tree Insertion Activity. 5-18 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#DriscollLF87 2003-11-20 A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem. 11-13 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Paschos92 2003-11-20 A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs. 77-86 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#KatajainenNT87 2003-11-20 Detecting Cycles Through Three Fixed Vertices in a Graph. 29-33 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#FleischnerW92 2003-11-20 An Architecture for Symbolic Processing. 217-222 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#BaleanuT87 2003-11-20 Amplification of slight probabilistic advantage at absolutely no cost in space. 113-118 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#MacarieS99 http://dx.doi.org/10.1016/S0020-0190(99)00129-5 2003-11-20 Weakest Precondition Semantics for Time and Concurrency. 301-308 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#ScholefieldZ92 2003-11-20 On scheduling send-graphs and receive-graphs under the LogP-model. 83-92 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#ZimmermannT02 http://dx.doi.org/10.1016/S0020-0190(01)00257-5 2003-11-20 Further Comments on Bykat's Convex Hull Algorithm. 209-212 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#OvermarsL80 2003-11-20 Some Principles for Dynamizing Decomposable Searching Problems. 49-53 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#OvermarsL81 2003-11-20 Seek Distances in Two-Headed Disk Systems. 205-209 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#MurshedK96 http://dx.doi.org/10.1016/0020-0190(95)00191-3 2003-11-20 A Remark on Matrix Rigidity. 283-285 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#ShokrollahiSS97 http://dx.doi.org/10.1016/S0020-0190(97)00190-7 2003-11-20 XCRIBL - A Hardcopy Scan Line Graphics System for Document Generation. 246-251 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#ReddyBEJNRW72 2003-11-20 Integrity Aspects of Quasi Serializability. 23-28 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#ElmagarmidD91 2003-11-20 A Parallel O(log n) Algorithm for the Drawing of Algebraic Curves in an n*n Square. 221-226 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#SommerhalderW86 2003-11-20 On the Determinacy Problem for Two-Way Pushdown Automata. 323-324 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Petersen94a 2003-11-20 A Note on Simplification Orderings. 212-215 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Dershowitz79 2003-11-20 The Schorr-Waite Marking Algorithm Revisited. 141-143 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Dershowitz80 2003-11-20 The Intersection Searching Problem for c-Oriented Polygons. 201-204 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#TanHI91 2003-11-20 Fast Decoding of the Huffman Codes. 237-241 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Sieminski88 2003-11-20 Learning unions of high-dimensional boxes over the reals. 213-220 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#BeimelK00 http://dx.doi.org/10.1016/S0020-0190(00)00024-7 2003-11-20 A Note on Vector Grammars. 32-33 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Jantzen79 2003-11-20 A Note on a Special One-Rule Semi-Thue System. 135-140 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Jantzen85 2003-11-20 Optimal Simulation of Multidimensional Reconfigurable Meshes by Two-Dimensional Reconfigurable Meshes. 267-273 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#VaidyanathanT93 2003-11-20 The Unwind Property for Programs with Bounded Memory. 233-238 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Kfoury85 2003-11-20 A note on the x-coordinate of points on an elliptic curve in characteristic two. 261-263 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Smart01 http://dx.doi.org/10.1016/S0020-0190(01)00169-7 2003-11-20 Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. 191-198 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Lingas89 2003-11-20 Bit Complexity of Matrix Products. 237-242 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Lingas91 2003-11-20 On a Problem Connected with Topological Sorting. 103-104 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Yuval73 2003-11-20 Finding Near Neighbors in K-Dimensional Space. 113-114 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Yuval75 2003-11-20 An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications. 155-156 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Yuval76 2003-11-20 Theil's Estimator. 6-7 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Yuval77 2003-11-20 A Simple Proof of Strassen's Result. 285-286 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Yuval78 2006-07-12 A Modified Branch-and-Bound Strategy. 65-69 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#TangW73 2003-11-25 Distributed algorithm to detect strong conjunctive predicates. 243-249 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00295-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#ChandraK03 2003-11-20 k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer. 207-212 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#HsiaoS85 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#HsiaoT92 2003-11-25 A lower bound for the hitting set size for combinatorial rectangles and an application. 75-78 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00475-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Chandran03 2004-07-16 On approximating planar metrics by tree metrics. 213-219 2001 80 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#KonjevodRS01 http://dx.doi.org/10.1016/S0020-0190(01)00161-2 2003-11-20 Relating Minimal Models and Pre-Requisite-Free Normal Defaults. 129-133 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#LoboS92 2003-11-20 Four Types of Noise in Data for PAC Learning. 157-162 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Sloan95 http://dx.doi.org/10.1016/0020-0190(95)00016-6 2003-11-20 Remarks on the Equivalence of c-e Structures and Petri Nets. 165-169 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Raczunas93 2003-11-20 Direct Determination of a `Seed' Binary Matrix. 47-50 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Bounas85 2003-11-20 The Greedy and Delaunay Triangulations are Not Bad in the Average Case. 25-31 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Lingus86 2003-11-20 A Measure in Which Boolean Negation is Exponentially Powerful. 125-128 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Skyum83 2003-11-20 A Simple Algorithm for Computing the Smallest Enclosing Circle. 121-125 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Skyum91 2003-11-20 Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness. 109-113 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#BiancoBDD93 2003-11-20 Detecting Embedded Horn Structure in Propositional Logic. 109-111 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ChandruH92 2003-11-20 A Study on Interleaving Versus Segmentation. 319-324 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ChangTVC98 http://dx.doi.org/10.1016/S0020-0190(98)00022-2 2003-11-20 Split Sequence Hash Search. 131-136 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#LodiL85 2003-11-20 Complexity of Sorting by Distributive Partitioning. 100 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#JackowskiKS79 2003-11-20 Sorting a Linked List with Equal Keys. 205-208 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Wegner82 2003-11-20 Improved Solutions to the Steiner Triple Covering Problem. 67-69 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#OdijkM98 http://dx.doi.org/10.1016/S0020-0190(97)80440-1 2003-11-20 Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. 129-135 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#LevcopoulosK96 http://dx.doi.org/10.1016/0020-0190(95)00200-6 2003-11-20 A Note on Adaptive Parallel Sorting. 187-191 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#LevcopoulosP89 2003-11-20 Splitsort - An Adaptive Sorting Algorithm. 205-211 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#LevcopoulosP91 2003-11-20 An Abstract Interpretation Framework for Optimizing Dynamic Modular Logic Languages. 163-170 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#CiampoliniLM96 http://dx.doi.org/10.1016/0020-0190(96)00051-8 2003-11-20 Parallel Priority Queues. 33-40 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#PinottiP91 2003-11-20 On the Union of 0L Languages. 59-63 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#DassowPS93 2003-11-20 Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. 83-84 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#BarrowB76 2003-11-20 On the Complexity of Finite Random Functions. 295-296 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Feige92 2003-11-20 On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems. 119-123 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#BovetV92 2003-11-20 A polynomial algorithm for the strong Helly property. 55-57 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#BrettoUZ02 http://dx.doi.org/10.1016/S0020-0190(01)00186-7 2003-11-20 _TQ Over a Commutative Ring. 46-49 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Makarov79 2003-11-20 Using Duality for the Synthesis of an Optimal Algorithm Involving Matrix Multiplication. 48-49 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Makarov81 2003-11-20 A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 102 Multiplications. 115-117 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Makarov86 2003-11-20 On the Synthesis of Fast Algorithms for Signal Processing. 267-272 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Makarov90 2003-11-20 Addendum to ``A Fully Parallel Algorithm for Residue to Binary Conversion''. 121 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#BarsiP95a http://dx.doi.org/10.1016/0020-0190(95)00149-7 2003-11-20 Congruent Weak Bisimulation with Dense Real-Time. 55-61 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Ho-StuartZF93 2003-11-20 Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. 103-110 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#BreslauerCDH97 http://dx.doi.org/10.1016/S0020-0190(97)00032-X 2003-11-20 Parallel Computation and Conflicts in Memory Access. 93-96 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Kucera82 2003-11-20 Graphs with Small Chromatic Numbers are Easy to Color. 233-236 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Kucera89 2003-11-20 Computing OR on a Randomized Fixed Adversary CRCW PRAM. 165-166 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Kucera97 http://dx.doi.org/10.1016/S0020-0190(97)00102-6 2003-11-20 On Finite Representations of Infinite-State Behaviours. 23-30 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Kucera99 http://dx.doi.org/10.1016/S0020-0190(99)00029-0 2003-11-20 On local modularity and interpolation in entailment systems. 203-211 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#VelosoFV02 http://dx.doi.org/10.1016/S0020-0190(01)00271-X 2003-11-20 A Halving Technique for the Longest Stuttering Subsequence Problem. 71-75 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Mirzaian87 2003-11-20 Phrase Structures, Non-Determinism and Backtracking. 139-143 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Allison78 2003-11-20 Stable Marriages by Coroutines. 61-65 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Allison83 2003-11-20 Direct Semantics and Exceptions Define Jumps and Coroutines. 327-330 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Allison89 2003-11-20 Lazy Dynamic-Programming Can Be Eager. 207-212 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Allison92 2003-11-20 Using Hirschberg's Algorithm to Generate Random Alignments of Strings. 251-255 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Allison94 2003-11-20 A Note on the Construction of Data Structure ``DEAP''. 315-317 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#CarlssonCS89 2003-11-20 On the Traveling Salesman Problem with a Relaxed Monge Matrix. 231-237 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BurkardD98 http://dx.doi.org/10.1016/S0020-0190(98)00119-7 2003-11-20 Recognizing Hamming Graphs in Linear Time and space. 91-95 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#ImrichK97 http://dx.doi.org/10.1016/S0020-0190(97)00095-1 2003-11-20 Generalized Hex and Logical Characterizations of Polynomial Space. 147-152 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Arratia-QuesadaS97 http://dx.doi.org/10.1016/S0020-0190(97)00116-6 2003-11-20 Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies. 95-99 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#MukhopadhyayaS92 2006-03-14 An Attack on a Recursive Authentication Protocol. A Cautionary Tale. 7-10 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#RyanS98 http://dx.doi.org/10.1016/S0020-0190(97)00180-4 2003-11-20 ^2.7799) Complexity for n*n Approximate Matrix Multiplication. 234-235 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#BiniCRL79 2003-11-20 Stacking Without Really Stacking When Reducing Categorical Expressions. 21-22 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Karlgren71 2003-11-24 A logical characterization of data languages. 75-85 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00229-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Bouyer02 2003-11-20 An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph. 61-65 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#GazitM88 2003-11-20 Algorithms for Parsimonious Complete Sets in Directed Graphs. 335-339 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#MelkmanS96 http://dx.doi.org/10.1016/0020-0190(96)00123-8 2003-11-20 A Note on the Relative Performance of Two Disk Scanning Policies. 15-17 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Coffman73 2003-11-20 Bipartite Graphs, Upward Drawings, and Planarity. 317-322 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#BattistaLR90 2003-11-20 A Note on Weak Operator Precedence Grammars. 213-218 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Sudborough77 2003-11-20 A Note on Weak Operator Precedence Grammars. 213-218 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Sudborough78 2003-11-20 Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs. 153-159 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GordonK98 http://dx.doi.org/10.1016/S0020-0190(98)00153-7 2003-11-20 Approximation algorithms for terrain guarding. 99-105 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Eidenbenz02 http://dx.doi.org/10.1016/S0020-0190(01)00255-1 2003-11-20 Fault Tolerant Token Ring Embedding in Double Loop Networks. 201-207 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#SungLCH98 http://dx.doi.org/10.1016/S0020-0190(98)00066-0 2003-11-20 A Compression Method for Clustered Bit-Vectors. 308-311 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Teuhola78 2003-11-20 Constrained Visibility Representations of Graphs. 1-7 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#BattistaTT92 2003-11-20 The Incompleteness of Misra and Chandy's Proof Systems. 93-96 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Nguyen85 2003-11-20 Circuits for Computing the GCD of Two Polynomials Over an Algebraic Number Field. 129-134 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Langemyr91 2003-11-20 A Structure Theorem for Maximum Internal Matchings in Graphs. 289-294 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#BarthaG91 2003-11-20 Realization of an Arbitrary Permutation on a Hypercube. 237-243 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#ShenHL94 2003-11-20 A Note on Extending Equivalence Theories of Algorithms. 54-56 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Kobayashi74 2003-11-20 Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness. 37-42 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Kobayashi93 2003-11-20 K-M-P String Matching Revisited. 217-223 1997 64 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#ReingoldUG97 http://dx.doi.org/10.1016/S0020-0190(97)00173-7 2003-11-24 Asymptotic analysis of an optimized quicksort algorithm. 73-77 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00351-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Durand03 2003-11-20 The design of conference key distribution system employing a symmetric balanced incomplete block design. 313-318 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ChungCKL02 http://dx.doi.org/10.1016/S0020-0190(01)00240-X 2003-11-20 A Linear Applicative Solution for the Set Union Problem. 43-45 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Meira85 2003-11-20 Strict Combinators. 255-258 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Meira87 2003-11-20 Decomposition - An Approach for Optimizing Queries Including ADT Functions. 327-333 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#ChenYYKOF92 2003-11-20 An Algorithm for Load Balancing in Multiprocessor Systems. 223-228 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#LouiS90 2003-11-25 Bounding restricted rotation distance. 251-256 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#ClearyT03 2003-11-20 Selection of a Large Sum-Free Subset in Polynomial Time. 255-256 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Kolountzakis94 2003-11-25 A constructive count of rotation symmetric functions. 299-304 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#StanicaM03 2003-11-20 Area-Time Tradeoff for Rectangular Matrix Multiplication in VLSI Models. 95-98 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Lotti84 2003-11-20 Improving the nonlinearity of certain balanced Boolean functions with good local and global avalanche characteristics. 167-172 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#StanicaS01 http://dx.doi.org/10.1016/S0020-0190(00)00221-0 2003-11-20 A New Characterization of FD Implication with an Application to Update Anomalies. 131-135 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Vossen88 2003-11-20 Once More on Storage for Consecutive Retrieval. 21-24 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Truszczynski80 2003-11-20 Computing Strictly-Second Shortest Paths. 177-181 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#LalgudiP97 http://dx.doi.org/10.1016/S0020-0190(97)00122-1 2003-11-20 Shortest Paths in the Plane with Convex Polygonal Obstacles. 71-76 1986 23 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Rohnert86 2003-11-20 Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. 175-179 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Rohnert88 2003-11-20 Distributed Evaluation of an Iterative Function for all Object Pairs on an SIMD Hybercube. 341-345 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Ercal91 2003-11-20 Data Algebra and Its Application in Database Design. 47-54 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#VikasB86 2003-11-20 Algorithms for Adaptive Huffman Codes. 159-165 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#CormackH84 2003-11-24 A note on approximation measures for multi-valued dependencies in relational databases. 153-158 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00365-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#GiannellaR03 2003-11-20 Mixed Transitivity for Functional and Multivalued Dependencies in Database Relations. 32-34 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Zaniolo80 2003-11-20 Variations on computing reciprocals of power series. 41-46 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Schonhage00 http://dx.doi.org/10.1016/S0020-0190(00)00044-2 2003-11-20 Global Avalanche Characteristics and Propagation Criterion of Balanced Boolean Functions. 21-24 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#SungCP99 http://dx.doi.org/10.1016/S0020-0190(98)00184-7 2003-11-20 Worst-Case Data Structures for the Priority Queue with Attrition. 69-75 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Sundar89 2003-11-20 Fault Tolerant Routing in the Star and Pancake Interconnection Networks. 315-320 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#GarganoVV93 2003-11-20 A Hierarchy of Tractable Satisfiability Problems. 173-180 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#DalalE92 2003-11-20 Conservativity of Nested Relational Calculi with Internal Generic Functions. 273-280 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#LibkinW94 2003-11-20 On Representation and Querying Incomplete Information in Databases with Bags. 209-214 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#LibkinW95 http://dx.doi.org/10.1016/0020-0190(95)00154-5 2003-11-20 Minimizing Elimination Tree Height Can Increase Fill More Than Linearly. 115-120 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Aspvall95 http://dx.doi.org/10.1016/0020-0190(95)90815-I 2003-11-20 On maximum induced matchings in bipartite graphs. 7-11 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Lozin02 http://dx.doi.org/10.1016/S0020-0190(01)00185-5 2003-11-20 The Logic of ``Initially'' and ``Next'': Complete Axiomatization and Complexity. 221-225 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#SchobbensR99 http://dx.doi.org/10.1016/S0020-0190(99)00022-8 2003-11-20 A Broadcasting Algorithm in Star Graph Interconnection Networks. 237-241 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#SheuLC93 2003-11-20 \tau-Bisimulations and Full Abstraction for Refinement of Actions. 219-222 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#CheriefS91 2003-11-24 Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. 251-259 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00291-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#BrandstadtM02 2003-11-20 A Note on Comparison of Subrecursive Hierarchies. 42-44 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Tsichritzis71 2003-11-20 Protection in Operating Systems. 127-131 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Tsichritzis72 2003-11-20 The Average-Case Parallel Complexity of Sorting. 145-146 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Boppana89 2003-11-20 The Decision-Tree Complexity of Element Distinctness. 329-331 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Boppana94 2003-11-20 The Average Sensitivity of Bounded-Depth Circuits. 257-261 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Boppana97 http://dx.doi.org/10.1016/S0020-0190(97)00131-2 2003-11-20 A Parallel Circle-Cover Minimization Algorithm. 57-60 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#BoxerM89 2003-11-20 Common Intersections of Polygons. 249-254 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#BoxerM90 2003-11-20 Semelectivity is not Sufficient. 137-141 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#DurisV91 2003-11-20 Distributed Algorithms for Multiple Entries to a Critical Section with Priority. 165-172 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#BaldoniC94 2003-11-24 On the minimal information to encode timestamps in distributed computations. 159-166 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00241-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#BaldoniM02 2003-11-20 Fast Gossiping on Square Mesh Computers. 127-130 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#FujitaY93 2003-11-25 Some results on graphs without long induced paths. 167-171 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#LozinR03 2003-11-20 On Weak Persistency of Petri Nets. 94-97 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Yamasaki81 2004-12-10 Minimum Number of Steps for Permutation in a Bubble Memory. 81-83 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#ChungLW80a 2006-11-06 Pseudo-Average Block Sensitivity Equals Average Sensitivity. 93-95 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Venkatesh98 http://dx.doi.org/10.1016/S0020-0190(98)00140-9 2003-11-20 Internal Merge Sorting with Delayed Selection. 137-140 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Erkio80 2003-11-20 A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata. 25-28 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Ibarra74 2003-11-20 Finding Pattern Matchings for Permutations. 293-295 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Ibarra97 http://dx.doi.org/10.1016/S0020-0190(97)00029-X 2003-11-20 Reconstructing Sequential Behavior from Parallel Behavior Projections. 129-135 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Weiser83 2003-11-20 Optimal Parallel Randomized Renaming. 7-10 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#FarachM97 http://dx.doi.org/10.1016/S0020-0190(96)00182-2 2003-11-20 Fast Algorithms for Approximately Counting Mismatches. 53-60 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Karloff93 2003-11-20 On alpha-redundant vertices in P5-free graphs. 119-122 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#BrandstadtLL02 http://dx.doi.org/10.1016/S0020-0190(01)00265-4 2003-11-20 Randomized uniform self-stabilizing mutual exclusion. 203-207 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Durand-Lose00 http://dx.doi.org/10.1016/S0020-0190(00)00056-9 2003-11-20 A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor. 247-254 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#OzgunerA88 2003-11-25 Structure and stability number of chair-, co-P- and gem-free graphs revisited. 161-167 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00487-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#BrandstadtLV03 2003-11-20 Weighted Search in the Plane. 97-100 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#AgarwalaF95 http://dx.doi.org/10.1016/0020-0190(94)00236-R 2003-11-20 Bad Cases for Shaker-Sort. 133-136 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#WeissS88 2003-11-20 More on Shellsort Increment Sequences. 267-270 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#WeissS90 2003-11-20 A restriction of the elastic time algorithm. 243-249 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Quaglia02 http://dx.doi.org/10.1016/S0020-0190(02)00209-0 2003-11-20 Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs. 97-102 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#MadanlalVR96 http://dx.doi.org/10.1016/0020-0190(96)00078-6 2003-11-20 On T0L Languages over Terminals. 69-70 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Solms75 2003-11-20 On the Time and Tape Complexity of Weak Unification. 146-150 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#ErniL81 2003-11-20 Unification in Commutative Rings is Not Finitary. 37-38 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#BurrisL90 2003-11-20 Programs as Proofs: A Synopsis. 105-112 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Constable83 2003-11-20 A Counterexample to the Algorithms for Determining Opaque Minimal Forests. 41-42 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Shermer91 2003-11-20 Another Efficient Algorithm for Convex Hulls in Two Dimensions. 216-219 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Andrew79 2003-11-20 A Linear Algorithm for Bisecting a Polygon. 135-140 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Shermer92 2003-11-20 Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. 125-130 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#NarendranO88 2005-05-23 A Special Arrangement with Minimal Number of Triangles. 273-276 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Alfonsin98 http://dx.doi.org/10.1016/S0020-0190(98)00125-2 2005-05-23 Cyclic Arrangements and Roudneff's Conjecture in the Space. 179-182 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Alfonsin99 http://dx.doi.org/10.1016/S0020-0190(99)00115-5 2003-11-20 Corrigendum: A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m. 341 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#LuCW94a 2003-11-20 Incremental String Matching. 219-227 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Meyer85 2003-11-20 Transformations for Communication Fairness in CSP. 195-198 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Zobel87 2003-11-20 A Note on Binomial Recurrences Arising in the Analysis of Algorithms. 309-311 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ProdingerS93 2003-11-20 A Simple Transfer Lemma for Algebraic Specifications. 80-85 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#BergstraM82 2003-11-20 Process algebra and conditional composition. 41-49 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#BergstraP01 http://dx.doi.org/10.1016/S0020-0190(01)00216-2 2003-11-20 Kleene's Three-Valued Logic and Process Algebra. 95-103 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BergstraP98 http://dx.doi.org/10.1016/S0020-0190(98)00083-0 2003-11-20 Bisimulation is Two-Way Simulation. 285-287 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#BergstraS94 2003-11-20 Two Theorems About the Completeness of Hoare's Logic. 143-149 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#BergstraT82 2003-11-20 One More Polynomial Complete Consecutive Retrieval Problem. 91-93 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Lipski77 2003-11-20 An O(n log n) Manhattan Path Algorithm. 99-102 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Lipski84 2003-11-20 Minimal Sense of Direction in Regular Networks. 331-338 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Flocchini97 http://dx.doi.org/10.1016/S0020-0190(97)00031-8 2003-11-20 On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory. 39-42 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Lipton96 http://dx.doi.org/10.1016/0020-0190(95)00209-X 2003-11-20 A Note on Scheduling Multiprocessor Tasks with Precedence Constraints on Parallel Processors. 119-122 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Amoura97 http://dx.doi.org/10.1016/S0020-0190(97)00119-1 2003-11-20 Scheduling on a Single Processor with Variable Speed. 189-193 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#AlidaeeA96 http://dx.doi.org/10.1016/S0020-0190(96)00132-9 2003-11-20 A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming. 313-319 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Esparza92 2003-11-20 Examples of Formal Grammars with Weights. 74-78 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#MizumotoTT73 2003-11-20 Matrix Multiplication by Diagonals on a Vector/Parallel Processor. 41-45 1976 5 2 Inf. Process. Lett. http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#MadsenRK76 2003-11-25 Reachability and confluence are undecidable for flat term rewriting systems. 265-270 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00310-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Jacquemard03 2003-11-20 Average Number of Messages for Distributed Leader-Finding in Rings of Processors. 167-176 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Lavault89 2003-11-20 Improved Matrix Triangularisation Using a Double Pipeline Systolic Array. 103-109 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#MegsonG90 2003-11-20 Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs. 147-153 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#SnelickJKL95 http://dx.doi.org/10.1016/0020-0190(95)00012-2 2003-11-20 The Automated Solution of Logic Puzzles. 317-324 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#ValentineD87 2003-11-20 A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs. 279-282 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#LeungRHTG95 http://dx.doi.org/10.1016/0020-0190(95)00097-V 2003-11-20 Gödelization in the lambda calculus. 13-16 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Goldberg00 http://dx.doi.org/10.1016/S0020-0190(00)00071-5 2003-11-20 Processor-Efficient Implementation of a Maximum Flow Algorithm. 179-185 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Goldberg91 2003-11-20 A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. 249-256 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Goldberg92 2003-11-20 An O(N) Algorithm for Finding Periodicity of a Sequence Using Hash Coding. 69-71 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#HikitaG77 2003-11-20 A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. 121-123 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#AspvallPT79 2003-11-20 A Systolic Array for the Longest Common Subsequence Problem. 191-198 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#RobertT85 2003-11-20 A Linear Selection Algorithm for Sets of Elements with Weights. 159-162 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Reiser78 2003-11-20 Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. 181-186 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#DiksDKPR98 http://dx.doi.org/10.1016/S0020-0190(98)00055-6 2003-11-20 A Generalized Deadlock Predicate. 181-188 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#OHallaronR86 2003-11-20 Another Note on Recursive Ascent. 263-266 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Roberts89 2003-11-20 A Note on the Representation of Finite Tree Automata. 239-240 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Reisig79 2003-11-20 Optimization of Argument Evaluation Order. 391-395 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#FraserH87 2003-11-20 A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. 57-66 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#ArnoldC88 2003-11-24 On disjunction of literals in triggers of statecharts transitions. 305-310 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00314-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Maggiolo-SchettiniT02 2003-11-20 Efficient construction of vote-tags to allow open objection to the tally in electronic elections. 211-215 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#RieraRB00 http://dx.doi.org/10.1016/S0020-0190(00)00107-1 2003-11-20 A Limitation of Vector Timestamps for Reconstructing Distributed Computations. 87-91 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Fidge98 http://dx.doi.org/10.1016/S0020-0190(98)00143-4 2003-11-20 Turing Complexity of the Ordinals. 167-170 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Dehornoy86 2003-11-20 Optimal Time Bounds for Some Proximity Problems in the Plane. 55-60 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#AggarwalERT92 2003-11-20 Unit-Length Embedding of Binary Trees on a Square Grid. 167-173 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Gregori89 2003-11-20 ACO algorithms with guaranteed convergence to the optimal solution. 145-153 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Gutjahr02 http://dx.doi.org/10.1016/S0020-0190(01)00258-7 2003-11-20 Enumeration of Articulation Pairs of a Planar Graph. 173-179 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Laumond85 2003-11-20 Obstacle Growing in a Nonpolygonal World. 41-50 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Laumond87 2003-11-20 Connectivity of Plane Triangulations. 87-96 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Laumond90 2003-11-20 A Note on a New Data Structure for in-the-Past Queries. 95-96 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Field87 2003-11-20 Sorting with Efficient Use of Special-Purpose Sorters. 13-15 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#AtallahFK88 2003-11-20 Finding the Convex Hull of a Sorted Point Set in Parallel. 173-179 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Goodrich87 2003-11-20 On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. 233-239 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#BolligLW96 http://dx.doi.org/10.1016/0020-0190(96)00119-6 2003-11-20 Bits and Relative Order From Residues, Space Efficiently. 123-127 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#DietzMS94 2003-11-20 A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph. 105-110 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#PhillipsPK98 http://dx.doi.org/10.1016/S0020-0190(98)00094-5 2003-11-20 Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates. 31-34 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Dancik96 http://dx.doi.org/10.1016/0020-0190(95)00182-4 2003-11-24 A note on optimal metering schemes. 319-326 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00321-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#BlundoCM02 2003-11-20 The Min-Max Spanning Tree Problem and Some Extensions. 10-14 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Camerini78 2003-11-20 A Generalization of Binomial Queues. 109-114 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Fagerberg96 http://dx.doi.org/10.1016/0020-0190(95)00194-8 2003-11-20 Finding a Shortest Hamiltonian Path Inside a Simple Polygon. 207-210 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Alsuwaiyel96 http://dx.doi.org/10.1016/0020-0190(96)00103-2 2003-11-20 Decidability of the consistency problem for regular symbolic picture description languages. 119-124 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#CostagliolaDFG01 http://dx.doi.org/10.1016/S0020-0190(01)00154-5 2003-11-20 On the Power of Built-In Relations in Certain Classes of Program Schemes. 77-82 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#ChauhanS99 http://dx.doi.org/10.1016/S0020-0190(98)00196-3 2003-11-20 Probability of Shares in Secret Sharing Schemes. 169-175 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#BlundoSG99 http://dx.doi.org/10.1016/S0020-0190(99)00153-2 2003-11-20 Visual cryptography for grey level images. 255-259 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BlundoSN00 http://dx.doi.org/10.1016/S0020-0190(00)00108-3 2003-11-20 On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. 255-259 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#DAmoreF92 2003-11-20 On Secret Sharing Schemes. 25-32 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#BlundoSV98 http://dx.doi.org/10.1016/S0020-0190(97)00194-4 2003-11-20 A Note on Undefined Expression Values in Programming Logics. 331-333 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Tennent87 2003-11-20 An Improved Algorithm for the Fixed-Radius Neighbor Problem. 193-198 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Chazelle83a 2003-11-20 A Note on Time-Space Tradeoffs for Computing Continuous Functions. 215-217 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Abelson79 2003-11-20 A Lower Bound for Area-Universal Graphs. 101-105 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#BilardiCDM94 2003-11-20 A Transformation of Marked Graphs. 26-29 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Henhapl73 2003-11-20 Limitations of Fast Consistency Conditions for Distributed Shared Memories. 243-248 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#AttiyaF96 http://dx.doi.org/10.1016/0020-0190(96)00007-5 2003-11-20 The Undecidability of Self-Embedding for Term Rewriting Systems. 61-64 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Plaisted85 2003-11-20 Average Case Analysis of Region Search in Balanced k-d Trees. 219-223 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Filho79 2003-11-20 Optimal Choice of Discriminators in a Balanced k-d Binary Search Tree. 67-70 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Filho81 2003-11-20 A Fast Maximum Finding Algorithm on Broadcast Communication. 81-89 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#ShiauY96 http://dx.doi.org/10.1016/S0020-0190(96)00143-3 2003-11-20 A Faster Algorithm for the Maximum Weighted Tardiness Problem. 39-44 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#FieldsF90 2006-05-12 On Kolmogorov Complexity in the Real Turing Machine Setting. 81-86 1998 67 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#MontanaP98 http://dx.doi.org/10.1016/S0020-0190(98)00089-1 2003-11-20 On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs. 237-243 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#NoshitaMM78 2003-11-20 Information Streams Sharing a Finite Buffer: Protection Problems. 151-159 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#AncilottiB81 2003-11-20 ₅graphs. 201-204 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Fouquet02 http://dx.doi.org/10.1016/S0020-0190(01)00329-5 2003-11-20 Efficient Implementation of the Ada Overloading Rules. 120-123 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#WallisS80 2003-11-24 A compact execution history for dynamic slicing. 145-152 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00322-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#DhamdhereGG03 2003-11-20 A Note on the Path Length of Red-Black Trees. 287-292 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#CameronW92 2003-11-20 An efficient decoding technique for Huffman codes. 305-308 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ChowdhuryKK02 http://dx.doi.org/10.1016/S0020-0190(01)00243-5 2003-11-20 Grammatical Unification. 150-158 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#MuluszynskiN82 2003-11-20 Lower Bounds for Arithmetic Problems. 83-87 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Meidanis91 2003-11-20 Enumerating the Kernels of a Directed Graph with no Odd Circuits. 149-153 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#SzwarcfiterC94 2003-11-20 The Complexity of Vector-Products. 149-154 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#DobkinL76 2003-11-20 Commutation Relations of Slices Characterize Some Synchronization Primitives. 7-9 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#DolevS78 2003-11-20 Extensions to Grid Selector Composition and Compilation in APL. 117-123 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#TreatB84 2003-11-20 Efficient Expansion of Factored Expressions. 69-72 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Guenther90 2003-11-20 Paw-Fee Graphs. 53-54 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Olariu88 2003-11-20 A Simple Linear-Time Algorithm for Computing the RNG and MST of Unimodal Polygons. 243-247 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Olariu89 2003-11-20 A Generalization of Chvátal's Star-Cutset Lemma. 301-303 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Olariu90 2003-11-20 An Optimal Greedy Heuristic to Color Interval Graphs. 21-25 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Olariu91 2004-04-20 Quantum computing and quadratically signed weight enumerators. 173-179 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#KnillL01 http://dx.doi.org/10.1016/S0020-0190(00)00222-2 2003-11-20 Crossvalidation: Minimizing the Entropy of the Future. 73-76 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Christensen75 2003-11-20 A Note on Raymond's Tree Based Algorithm for Distributed Mutual Exclusion. 249-255 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#SatyanarayananM92 2003-11-20 A Note on the Dynamic Storage Allocation Problem. 223-227 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Slusarek85 2003-11-20 An Off-Line Storage Allocation Algorithm. 71-75 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Slusarek87 2003-11-20 <i>k</i>-Dense Corridor Problems. 25-31 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#ShinSC98 http://dx.doi.org/10.1016/S0020-0190(98)00130-6 2003-11-20 Approximation Results for the Minimum Graph Coloring Problem. 19-23 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#DemangeGP94 2003-11-24 The equality problem for Parikh simple algebraic power series. 57-60 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00239-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Honkala02 2003-11-20 An Efficient Functional Implementation of FIFO Queues. 205-206 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Burton82a 2003-11-20 A Robust Variation of Interpolation Search. 198-201 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#BurtonL80 2003-11-20 An Alternative Implementation of Communication Primitives. 231-238 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#SnepscheutU86 2003-11-20 On an Algorithm of Zemlyachenko for Subtree Isomorphism. 141-146 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#DinitzIR99 http://dx.doi.org/10.1016/S0020-0190(99)00054-X 2003-11-20 Improvements on Fast Methods for Generating Normal Random Variables. 27-30 1976 5 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#MarsagliaAP76 2003-11-20 ^1.618Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape. 147-152 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Vitanyi85a 2003-11-20 Routing with Critical Paths. 13-19 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Simonson90 2003-11-20 Efficient Management of Dynamic Tables. 25-30 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#FraenkelRS94 2003-11-20 Lower bounds on the complexity of recognizing SAT by Turing machines. 243-247 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Santhanam01 http://dx.doi.org/10.1016/S0020-0190(00)00227-1 2003-11-20 A Robust Multi-Priority Topology-Independent Transmission Schedule for Packet Radio Networks. 291-295 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Boztas95 http://dx.doi.org/10.1016/0020-0190(95)00098-W 2003-11-20 A Note on Rabin's Nearest-Neighbor Algorithm. 20-23 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#FortuneH79 2003-11-20 On Approximation Algorithms for the Minimum Satisfiability Problem. 23-29 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#MaratheR96 http://dx.doi.org/10.1016/0020-0190(96)00031-2 2003-11-25 Complexity classes and fragments of C. 213-218 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#KristiansenV03 2003-11-24 Efficient extraction of schemas for XML documents. 7-12 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00345-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#MinAC03 2003-11-20 An Algorithm to Generate a Random Cyclic Permutation. 315-317 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Sattolo86 2003-11-20 A Note on the Ambiguity of Context-Free Grammars. 35-36 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Takaoka74 2003-11-20 An On-Line Pattern Matching Algorithm. 329-330 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Takaoka86 2003-11-20 A Decomposition Rule for the Hoare Logic. 205-208 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Takaoka87 2003-11-20 A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. 195-199 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Takaoka92 2003-11-20 Experiments with Trees of the Storage and Retrieval of Future Events. 237-242 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Evans86 2003-11-20 Modular Term Rewriting Systems and the Termination. 1-4 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#KuriharaK90 2006-04-04 Input-Output Modeling and Identification of Linear Automata. 69-75 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Tzafestas72 2003-11-20 A New Distributed Depth-First-Search Algorithm. 147-150 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Awerbuch85 2003-11-20 Labeling a Rectilinear Map More Efficiently. 25-30 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#StrijkK99 http://dx.doi.org/10.1016/S0020-0190(98)00190-2 2003-11-20 Extension of the Banker's Algorithm for Resource Allocation in a Distributed Operating System. 1-8 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#MadduriF84 2003-11-20 Robot localization in a grid. 261-267 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#WongngamnitA01 http://dx.doi.org/10.1016/S0020-0190(00)00154-X 2003-11-24 The particle swarm optimization algorithm: convergence analysis and parameter selection. 317-325 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00447-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Trelea03 2003-11-20 On Bispecial Factors of the Thue-Morse Word. 179-183 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#LucaM94 2003-11-20 On the Factors of the Thue-Morse Word on Three Symbols. 281-285 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#LucaV88 2003-11-20 Factorial Languages Whose Growth Function is Quadratically Upper Bounded. 283-288 1989 30 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#LucaV89 2003-11-20 Counterexample to a Conjecture of Szymanski on Hypercube Routing. 57-61 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Lubiw90 2003-11-20 Detecting masquerades in intrusion detection based on unpopular commands. 33-38 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#SchonlauT00 http://dx.doi.org/10.1016/S0020-0190(00)00122-8 2003-11-20 Root-Neededness and Approximations of Neededness. 245-254 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Lucas98 http://dx.doi.org/10.1016/S0020-0190(98)00118-5 2003-11-20 A Hybrid of Quicksort with O(n log n) Worst Case Complexity. 119-123 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Rohrich82 2003-11-20 A Homophonic DES. 317-320 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#HsiehYHW98 http://dx.doi.org/10.1016/S0020-0190(98)00073-8 2003-11-20 Algebraic Approach to p-adic Conversion of Rational Numbers. 167-171 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Miola84 2003-11-20 Efficient Pattern Searching Over Large Dictionaries. 17-21 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Owolabi93 2005-02-16 A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. 173-177 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#SarkarCGS92a 2003-11-20 Comments on ``On the Proof of a Distributed Algorithm'': Always-Tru is not Invariant. 277-279 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#GasterenT90 2003-11-20 Intersection and Union of Regular Languages and State Complexity. 185-190 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Birget92 2003-11-20 The State Complexity of \Sigma * L and its Connection with Temporal Logic. 185-188 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Birget96 http://dx.doi.org/10.1016/0020-0190(96)00044-0 2003-11-20 An Algorithm for Obtaining the Chromatic Number and an Optimal Coloring of a Graph. 34-38 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#RoschkeF73 2003-11-20 A Note on the Equivalence Problem of E-Patterns. 125-128 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#DanyiF96 http://dx.doi.org/10.1016/0020-0190(95)00212-X 2003-11-20 A Probabilistic Remark on Algebraic Program Testing. 193-195 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#DemilloL78 2003-11-20 A two-level temporal logic for evolving specifications. 167-172 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#SchobbensSSS02 http://dx.doi.org/10.1016/S0020-0190(02)00289-2 2003-11-20 On Edge-Disjoint Spanning Trees in Hypercubes. 13-16 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#BardenLDW99 http://dx.doi.org/10.1016/S0020-0190(99)00033-2 2003-11-20 A Cooperative Game with Applications to Computer Networks. 283-289 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Danzig91 2003-11-20 Error Correction by Mutational Grammars. 9-15 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Krawczyk80 2003-11-20 Exponential Lower Bounds for the Tree-Like Hajós Calculus. 289-294 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#IwamaP95 http://dx.doi.org/10.1016/0020-0190(95)00035-B 2003-11-20 A Note on the Equivalence of a Set of Egds to a Set of FDs. 185-188 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#LeuchnerMS94 2003-11-20 Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. 83-87 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#BihamBR99 http://dx.doi.org/10.1016/S0020-0190(99)00047-2 2003-11-20 On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. 317-322 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#GergovM94 2003-11-20 A Fast Multiprocessor Message Passing Implementation. 381-389 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#BajantriS87 2003-11-20 A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation. 197-200 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Misra01 http://dx.doi.org/10.1016/S0020-0190(00)00202-7 2003-11-24 Derivation of a parallel string matching algorithm. 255-260 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00416-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Misra03 2003-11-20 Space-Time Trade Off in Implementing Certain Set Operations. 81-85 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Misra79 2003-11-20 A Simple Proof of a Simple Consensus Algorithm. 21-24 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Misra89 2003-11-20 Phase Synchronization. 101-105 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Misra91 2003-11-20 Corrigenda: Phase Synchronization. 59 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Misra92 2005-09-28 Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. 110-112 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#MitchellH79 2003-11-20 Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree. 211-213 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#IwanoK93 2003-11-20 The Universal Space for Parallel Computation. 42-45 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Zuczek77 2003-11-20 Cost-Oriented Program Optimisation. 167-170 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Middleton74 2003-11-20 Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. 267-272 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#RossmanithR92 2003-11-20 Is SSS* Better Than Alpha-Beta? 113-120 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#McGlinn83 2003-11-20 Resolution Deduction to Detect Satisfiability For Another Class Including Non-Horn Sentences In Propositional Logic. 201-207 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#YamasakiD86 2003-11-20 Path-based depth-first search for strong and biconnected components. 107-114 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Gabow00 http://dx.doi.org/10.1016/S0020-0190(00)00051-X 2003-11-20 Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs. 113-115 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Gabow76 2003-11-20 A Linear-Time Recognition Algorithm for Interval Dags. 20-22 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Gabow81 2003-11-20 A Note on the Token Distribution Problem. 329-334 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Herley91 2005-01-05 A Distributed Join Algorithm. 313-317 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#HingstonW90 2003-11-20 An efficient method for computing dynamic program slices. 111-117 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#GoswamiM02 http://dx.doi.org/10.1016/S0020-0190(01)00202-2 2003-11-25 A note on commutative multivariate rational series. 283-285 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00347-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Litow03a 2003-11-20 On Universal Computer-Constructors. 61-64 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Herman73 2003-11-20 Probabilistic Self-Stabilization. 63-67 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Herman90 2003-11-20 A Note on the Ádám Conjecture for Double Loops. 149-153 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#LitowM98 http://dx.doi.org/10.1016/S0020-0190(98)00051-9 2003-11-20 On the Use of Extendible Hashing Without Hashing. 21-26 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#BechtoldK84 2003-11-20 Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures. 43-52 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Sinachopoulos94 2003-11-20 A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications. 180-182 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Schachtel78 2006-01-31 Toward a Definition of Fault Analysis for Petri Nets Models. 299-305 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#ZarghamD90 2003-11-20 A Dynamic Storage Allocation Problem. 96-99 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Krogdahl73 2003-11-20 Randomized local elections. 313-320 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#MetivierSZ02 http://dx.doi.org/10.1016/S0020-0190(01)00289-7 2003-11-20 Parametric Stable Marriage and Minimum Cuts. 255-259 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#GusfieldI89 2003-11-20 Equivalent Approximation Algorithms for Node Cover. 291-294 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#GusfieldP86 2003-11-20 Formal Syntax Methods for Natural Language. 135-143 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#JohnsonB84 2003-11-20 A Simple Correctness Proof of the MCS Contention-Free Lock. 215-220 1993 48 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#JohnsonH93 2005-09-07 On Generating All Maximal Independent Sets. 119-123 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#JohnsonP88 2003-11-20 Fitted Diagonals for Reducing I/O Bandwidth in Systolic Systems. 335-342 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#SurosM87 2003-11-20 Shelf Algorithms for On-Line Strip Packing. 171-175 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#CsirikW97 http://dx.doi.org/10.1016/S0020-0190(97)00120-8 2003-11-20 B-Trees in a System with Multiple Users. 107-112 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Samadi76 2003-11-25 Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. 257 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#GalP03a 2003-11-20 A heuristic algorithm for minimizing mean flow time with unit setups. 291-296 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#KravchenkoW01 http://dx.doi.org/10.1016/S0020-0190(01)00136-3 2004-10-28 Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. 269-273 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#DickersonD90 2003-11-20 A Simple Algorithm for Enumerating Longest Distances in the Plane. 269-274 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#DickersonS93 2003-11-20 Smoothsort's Behavior on Presorted Sequences. 165-170 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Hertel83 2003-11-20 Tag Systems Generating Thue Irreducible Sequences. 129-131 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Istrail78 2003-11-20 Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms. 85-87 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Galil76 2003-11-20 ANSV Problem on BSRs. 135-138 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#XiangU98 http://dx.doi.org/10.1016/S0020-0190(97)00214-7 2003-11-20 Rearranging Scattered Information on BSR. 43-47 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#XiangU99 http://dx.doi.org/10.1016/S0020-0190(99)00085-X 2003-11-20 Optimal Simulation of Tree Arrays by Linear Arrays. 295-302 1989 30 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#IbarraJ89 2003-11-20 Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication. 12-15 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#IbarraM81 2003-11-20 The Strong Equivalence of ET0L Grammars. 171-176 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Istrate97 http://dx.doi.org/10.1016/S0020-0190(97)00067-7 2003-11-20 On the Decidability of Equivalence for Deterministic Pushdown Transducers. 89-93 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#IbarraR81 2003-11-20 On the Intersection of Orthogonal Objects. 177-181 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#EdelsbrunnerM81 2003-11-20 Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. 39-47 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#EdelsbrunnerM85 2003-11-20 Some Variants of the Take-Grant Protection Model. 151-156 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Biskup84 2003-11-20 On the Equivalence of Some Rectangle Problems. 124-127 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#EdelsbrunnerO82 2003-11-20 Zooming by Repeated Range Detection. 413-417 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#EdelsbrunnerO87 2003-11-20 Strong Linear Orderings of a Directed Network. 146-148 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Shiloach79a 2003-11-20 A Fast Equivalence-Checking Algorithm for Circular Lists. 236-238 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Shiloach79b 2003-11-20 Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. 289-293 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#EdelsbrunnerW86 2003-11-20 On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. 165-170 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#ShimozonoHS98 http://dx.doi.org/10.1016/S0020-0190(98)00065-9 2003-11-20 Boyce-Codd Normal Form and Object Normal Forms. 29-33 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Biskup89 2003-11-20 Autenticated Encryption Schemes with Message Linkage. 189-195 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#HwangCY96 http://dx.doi.org/10.1016/0020-0190(96)00032-4 2003-11-20 Sequence Matching with Binary Codes. 193-196 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Bradford90 2003-11-20 L-Infinity Interdistance Selection by Parametric Search. 9-14 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Salowe89 2003-11-20 A Note on Lower Bounds for Rectilinear Steiner Trees. 151-152 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Salowe92 2003-11-25 Quantum zero-error algorithms cannot be composed. 79-84 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00254-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#BuhrmanW03 2003-11-20 A Lower Bound for Quantum Search of an Ordered List. 205-209 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#BuhrmanW99 http://dx.doi.org/10.1016/S0020-0190(99)00069-1 2003-11-20 Purging in an Equality Data Base. 89-95 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#SametM80 2003-11-20 The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's. 111-114 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Courcelle81 2003-11-20 Some Negative Results Concerning DPDA's. 285-289 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Courcelle84 2003-11-20 Deriving Global Virtual Time Algorithms from Conservative Simulation Protocols. 121-126 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#VargheseCW95 http://dx.doi.org/10.1016/0020-0190(95)00004-V 2003-11-20 Testing for Existence of a Covering Boyce-Codd normal Form. 11-14 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Osborn79 2003-11-24 Erratum to "Pancyclicity of recursive circulant graphs": [Information Processing Letters 81 (2002) 187-190]. 173 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00371-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#ArakiS02a 2003-11-20 A new universal and fault-tolerant quantum basis. 101-107 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BoykinMPRV00 http://dx.doi.org/10.1016/S0020-0190(00)00084-3 2003-11-20 A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. 39-43 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#TingY94 2003-11-20 On inferring linear single-tree languages. 1-3 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Makinen00 http://dx.doi.org/10.1016/S0020-0190(99)00157-X 2003-11-20 Boundedness Testing for Unambiguous Context-Free Grammars. 181-183 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Makinen83 2003-11-20 On Derivation Preservation. 225-228 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Makinen84 2003-11-20 A Note on Undercover Relation. 19-21 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Makinen85 2003-11-20 A Note on Pure Grammars. 271-274 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Makinen86 2003-11-20 On the Rotation Distance of Binary Trees. 271-272 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Makinen88 2003-11-20 On the Subtree Isomorphism Problem for Ordered Trees. 271-273 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Makinen89 2003-11-20 The Grammatical Inference Problem for the Szilard Languages of Linear Grammars. 203-206 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Makinen90 2003-11-20 On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. 1-5 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Makinen92 2003-11-20 Inferring Uniquely Terminating Regular Languages from Positive Data. 57-60 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Makinen97 http://dx.doi.org/10.1016/S0020-0190(97)00045-8 2003-11-20 Estimating Block Transfers When Record Access Probabilities are Non-Uniform. 249-252 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#ZahorjanBS83 2003-11-20 An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path. 121-127 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#DeogunKS97 http://dx.doi.org/10.1016/S0020-0190(97)81663-8 2003-11-20 On the Agreement of Many Trees. 297-301 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#FarachPT95 http://dx.doi.org/10.1016/0020-0190(95)00110-X 2003-11-20 Perfect Code is W[1]-complete. 163-168 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Cesati02 http://dx.doi.org/10.1016/S0020-0190(01)00207-1 2003-11-20 A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses. 167-171 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#PosenatoS98 http://dx.doi.org/10.1016/S0020-0190(98)00157-4 2003-11-25 A simple factor-3 approximation for labeling points with circles. 101-105 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00256-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#JiangQQZC03 2003-11-20 Broadcasting in the Butterfly Network. 41-43 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Stohr91 2003-11-20 On Renaming a Set of Clauses as a Horn Set. 289-293 1989 30 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#LindhorstS89 2003-11-20 Detecting Conjunctions of Global Predicates. 295-302 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#GargM97 http://dx.doi.org/10.1016/S0020-0190(97)00139-7 2003-11-20 The Performance of Interactive Information Retrieval. 35-41 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Salton71 2003-11-20 Experiments in Multi-Lingual Information Retrieval. 6-11 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Salton73 2003-11-20 Modeling Hypergraphs by Graphs with the Same Mincut Properties. 171-175 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#IhlerWW93 2003-11-20 A Note on the Permanent Value Problem. 1-5 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Saluja92 2003-11-20 Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs. 229-234 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#SpragueK92 2003-11-20 Drawing Straight Lines with a Pyramid Cellular Automaton. 233-237 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Stout82 2003-11-20 Varieties of Formal Series on Trees and Eilenberg's Theorem. 171-175 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#BozapalidisI88 2003-11-20 On Average Edge Length of Minimum Spanning Trees. 241-243 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#NathCK99 http://dx.doi.org/10.1016/S0020-0190(99)00068-X 2003-11-20 Comparison of Signature File Models with Superimposed Coding. 101-106 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#DervosML98 http://dx.doi.org/10.1016/S0020-0190(97)00210-X 2003-11-20 Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages. 137-143 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#YokomoriJ83 2003-11-20 An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads. 234-236 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Rytter81 2003-11-20 A Note on Two-Way Nondeterministic Pushdown Automata. 5-9 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Rytter82 2003-11-20 Time Complexity of Loop-Free Two-Way Pushdown Automata. 127-129 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Rytter83 2003-11-20 On Linear Context-Free Languages and One-Way Multihead Automata. 163-166 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Rytter84 2003-11-20 The Space Complexity of the Unique Decipherability Problem. 1-3 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Rytter86 2003-11-20 On Efficient Computations of Costs of Paths on a Grid Graph. 71-74 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Rytter88 2003-11-20 A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. 103-109 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Rytter89 2003-11-20 A Linear Time Algorithm for a Matching Problem on the Circle. 161-164 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#CabrelliM98 http://dx.doi.org/10.1016/S0020-0190(98)00048-9 2003-11-20 A Note on Finding Convex Hulls Via Maximal Vectors. 53-56 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Devroye80 2003-11-20 A Note on the Expected Time Required to Construct the Outer Layer. 255-257 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Devroye85 2003-11-20 On the Richness of the Collection of Subtrees in Random Binary Search Trees. 195-199 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Devroye98 http://dx.doi.org/10.1016/S0020-0190(97)00206-8 2003-11-20 Satisfying General Proximity/Similarity Queries with Metric Trees. 175-179 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Uhlmann91 2003-11-20 A Rewriting Strategy to Verify Observational Congruence. 191-199 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#InverardiN90 2003-11-20 Domination in Convex and Chordal Bipartite Graphs. 231-236 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#DamaschkeMK90 2003-11-20 Simulation, Reduction and Preservation of Correctness Properties of Parallel Systems. 21-27 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Tirri83 2003-11-20 Simple Deterministic NTS Languages. 174-178 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Frougny81 2003-11-20 A note on the use of determinant for proving lower bounds on the size of linear circuits. 197-201 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Pudlak00 http://dx.doi.org/10.1016/S0020-0190(00)00058-2 2003-11-20 Construction of Natural Cycletrees. 313-318 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#VeanesB96a http://dx.doi.org/10.1016/S0020-0190(96)00179-2 2003-11-20 A Markov Model for Multibus Multiprocessor Systems Under Asynchronous Operation. 11-16 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Nassar95 http://dx.doi.org/10.1016/0020-0190(94)00230-V 2003-11-20 Evaluating Polynomials at Many Points. 66-68 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#BorodinM71 2003-11-20 Global Avalanche Characteristics and Nonlinearity of Balanced Boolean Functions. 139-144 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#SonLCS98 http://dx.doi.org/10.1016/S0020-0190(98)00009-X 2003-11-20 The Theory of Functional and Subset Dependencies Over Relational Expressions. 153-160 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Casanova83 2003-11-20 How rich is the structure of the intrinsic complexity of learning. 109-112 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Ambainis00 http://dx.doi.org/10.1016/S0020-0190(00)00085-5 2003-11-20 On learning formulas in the limit and with assurance. 9-11 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Ambainis01 http://dx.doi.org/10.1016/S0020-0190(00)00150-2 2003-11-20 A Note on Quantum Black-Box Complexity of Almost all Boolean Functions. 5-7 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Ambainis99 http://dx.doi.org/10.1016/S0020-0190(99)00079-4 2003-11-20 Cryptographic Implementation of a Tree Hierarchy for Access Control. 95-98 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Sandhu88 2003-11-20 The Reflected Tree Hierarchy for Protection and Sharing. 21-26 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Sandhu89 2003-11-20 Axiomatic Semantics for ``Escape'' Statements. 27-33 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#OlssonH91 2003-11-20 Patchworks and metablocks enumeration. 77-86 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#RavelomananaT00 http://dx.doi.org/10.1016/S0020-0190(00)00015-6 2003-11-20 An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. 40-41 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Hirschberg78 2003-11-20 Space-time trade-offs for some ranking and searching queries. 237-241 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#DumitrescuS01 http://dx.doi.org/10.1016/S0020-0190(00)00226-X 2003-11-20 Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. 227-232 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#ThilikosB97 http://dx.doi.org/10.1016/S0020-0190(97)00024-0 2003-11-20 General Methods for `All Elements' and `All Pairs' Problems. 99-102 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Overmars81 2003-11-20 Point Location in Fat Subdivisions. 261-265 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Overmars92 2003-11-20 Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. 183-189 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#IwamotoT94 2003-11-20 An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. 153-159 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KingPRS97 http://dx.doi.org/10.1016/S0020-0190(97)00050-1 2003-11-20 On Identification of CR Property in File Organisation. 93-96 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#SenguptaBS79 2003-11-20 Storing Matrices on Disk for Efficient Row and Column Retrieval. 249-254 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Bitner85 2003-11-20 Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. 277-281 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#HsuJLHC91 2003-11-20 Two-Dimensional Pattern Matching by Sampling. 159-162 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#CrochemoreGR93 2003-11-20 Fast Computation of Periodic Continued Fractions. 67-72 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#ChungCL89 2003-11-20 A new method for constructing pair-wise covering designs for software testing. 85-91 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#KobayashiTK02 http://dx.doi.org/10.1016/S0020-0190(01)00195-8 2003-11-20 Automata and Forbidden Words. 111-117 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#CrochemoreMR98 http://dx.doi.org/10.1016/S0020-0190(98)00104-5 2003-11-20 An exponential gap with the removal of one negation gate. 155-157 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#SungT02 http://dx.doi.org/10.1016/S0020-0190(01)00264-2 2003-11-20 Two Attacks on Neuman-Stubblebine Authentication Protocols. 103-107 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#HwangLLKC95 http://dx.doi.org/10.1016/0020-0190(95)00177-E 2003-11-25 Efficient preprocessing of XML queries using structured signatures. 257-264 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00308-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#ChungKK03 2003-11-24 An interpretation of [lambda][mu]-calculus in [lambda]-calculus. 261-264 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00300-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Fujita02 2003-11-24 On-line grid-packing with a single active grid. 199-204 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00373-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Fujita03 2003-11-20 A Note on the Size of a Multicast Tree in Hypercubes. 223-227 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Fujita95 http://dx.doi.org/10.1016/0020-0190(95)00029-C 2003-11-20 <i>k</i><i>k</i>-Quorum Systems. 191-197 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Fujita98 http://dx.doi.org/10.1016/S0020-0190(98)00109-4 2003-11-20 On approximability of the independent/connected edge dominating set problems. 261-266 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Fujito01 http://dx.doi.org/10.1016/S0020-0190(01)00138-7 2003-11-20 An Optimal Test on Finite Unavoidable Sets of Words. 179-180 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#CrochemoreRW83 2003-11-20 A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach. 59-63 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Fujito96 http://dx.doi.org/10.1016/0020-0190(96)00094-4 2003-11-20 Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. 55-61 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#GoldreichMSS99 http://dx.doi.org/10.1016/S0020-0190(99)00083-6 2004-12-10 A New Permutation Algorithm for Bubble Memories. 226-230 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#ChungLW80 2003-11-20 A Note on the Pumping Lemma for Regular Languages. 135-136 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Yehudai79 2003-11-20 On Program Analysis. 136-140 1976 5 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#HennellWH76 2003-11-20 On Computability of the Mean Deviation. 36-38 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Winkler82 2003-11-24 More on random walks, electrical networks, and the harmonic k-server algorithm. 271-276 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00287-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#BartalCNR02 2003-11-20 A Constant Update Time Finger Search Tree. 147-154 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#DietzR94 2003-11-20 Symmetry of Information and One-Way Functions. 95-100 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#LongpreM93 2003-11-20 Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences. 148-151 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#HeuerM73 2003-11-20 A Note on Leftmost Restricted Random Context Grammars. 31-33 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#CremersMM73 2003-11-20 Exploiting Intra-Object Dependencies in Parallel Simulation. 119-125 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#QuagliaB99 http://dx.doi.org/10.1016/S0020-0190(99)00056-3 2003-11-25 Simple and efficient floor-planning. 113-119 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00490-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Kurowski03 2005-02-16 Multiple Stack Branch and Bound. 43-48 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#SarkarCGS91 2005-02-16 Effective Use of Memory in Iterative Deepening Search. 47-52 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#SarkarCGS92 2003-11-20 Looping LR Parsers. 251-253 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Soisalon-SoininenT88 2003-11-20 Tight Chip Area Lower Bounds for String Matching. 117-119 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#SykoraV87 2003-11-20 Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems. 7-11 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#NathM82 2003-11-20 A Remark on Middle Space Bounded Alternating Turing Machines. 229-232 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#MereghettiP95 http://dx.doi.org/10.1016/0020-0190(95)00151-2 2003-11-20 A characterization of Büchi tree automata. 29-33 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Skurczynski02 http://dx.doi.org/10.1016/S0020-0190(01)00190-9 2003-11-20 On the Point-to-Point Connection Problem. 333-336 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#NatuF95 http://dx.doi.org/10.1016/0020-0190(94)00216-L 2003-11-20 Finitary Logics for Some CCS Observational Bisimulations. 161-165 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Mowbray92 2003-11-20 <i>f</i>-Matching. 107-109 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#DessmarkGL98 http://dx.doi.org/10.1016/S0020-0190(97)00196-8 2003-11-20 Arboricity and Bipartite Subgraph Listing Algorithms. 207-211 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Eppstein94 2003-11-20 Dynamic Connectivity in Digital Images. 121-126 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Eppstein97 http://dx.doi.org/10.1016/S0020-0190(97)00056-2 2003-11-20 Real-Time Functional Queue Operations Using the Logical Variable. 173-175 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Clocksin83 2003-11-20 802.4 Rate Monotonic Scheduling in Hard Real-Time Environments: Setting the Medium Access Control Parameters. 47-55 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#OrozcoCSF97 http://dx.doi.org/10.1016/S0020-0190(97)00034-3 2003-11-20 Scheduling Cyclic Tasks with Binary Periods. 173-178 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#NawrockiCC98 http://dx.doi.org/10.1016/S0020-0190(98)00221-X 2003-11-20 The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model. 145-151 1989 30 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#StaunstrupN89 2003-11-20 On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications. 135-142 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Szpankowski86 2003-11-20 The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures. 13-19 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Szpankowski88 2003-11-20 A Unifying Approach to Evaluating Block Accesses in Database Organizations. 253-257 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#CiacciaMT88 2003-11-20 A Short Proof of the Dilation of a Toroidal Mesh in a Path. 197-199 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#PatersonSSV93 2003-11-20 Controlled Density Sorting. 169-172 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#MelvilleG80 2003-11-20 Leader Election in the Presence of n-1 Initial Failures. 25-28 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Taubenfeld89 2003-11-20 On the Nonexistence of Resilient Consensus Protocols. 285-289 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Taubenfeld91 2006-11-06 Quantified Computation Tree Logic. 123-129 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#PatthakBDDC02 http://dx.doi.org/10.1016/S0020-0190(01)00260-5 2003-11-20 On the Use of Complete Subgraphs in Cluster Analysis. 76-79 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#OgilvieO72 2003-11-20 Efficient Parallel Circuits and Algorithms for Division. 307-313 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#ShankarR88 2003-11-20 A Space Efficient Greedy Triangulation Algorithm. 191-196 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Goldman89 2003-11-20 Inscribing a Symmetric Body in an Ellipse. 175-178 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Santos96 http://dx.doi.org/10.1016/0020-0190(96)00110-X 2003-11-20 Optimal Network Partitioning for Fault-Tolerant Network Management Using Evolutionary Programming. 145-149 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#KumarB94 2003-11-20 A High Availability \sqrt{N} Hierarchical Grid Algorithm for Replicated Data. 311-316 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#KumarC91 2003-11-20 On Probability of Forest of Quadtrees Reducing to Quadtrees. 109-111 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#KumarM86 2003-11-20 A Counter-Example to an Algorithm for the Generalized Input-Output Construct of CSP. 287 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#KumarS97 http://dx.doi.org/10.1016/S0020-0190(97)00040-9 2003-11-20 Fast Inversion of Hankel and Toeplitz Matrices. 119-123 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Gemignani92 2003-11-20 Restricted failure detectors: Definition and reduction protocols. 91-97 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#RaynalT99 http://dx.doi.org/10.1016/S0020-0190(99)00136-2 2003-11-20 Fastest Path Across Constrained Moving Rectilinear Obstacles. 349-353 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#SrikantK91 2003-11-20 The Self-Indexed Search Algorithm: A Bit-Level Approach to Minimal Perfect Hashing. 253-258 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#TorresKI99 http://dx.doi.org/10.1016/S0020-0190(99)00016-2 2003-11-20 Atomic Semantics of Nonatomic Programs. 99-103 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#AndersonG88 2003-11-20 Derivation of a rotator circuit with homogeneous interconnect. 131-135 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#HofsteeS01 http://dx.doi.org/10.1016/S0020-0190(00)00197-6 2003-11-20 Parallelism and the Maximal Path Problem. 121-126 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#AndersonM87 2003-11-20 A Simple Randomized Parallel Algorithm for List-Ranking. 269-273 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#AndersonM90 2003-11-20 <i>N</i><i>N</i><i>cN</i>) Complexity. 311-315 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#ChoiJKJ98 http://dx.doi.org/10.1016/S0020-0190(98)00131-8 2003-11-25 Reflected min-max heaps. 209-214 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00501-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#MakrisTT03 2003-11-20 On distribution properties of sequences with perfect linear complexity profile. 175-182 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Schneider00 http://dx.doi.org/10.1016/S0020-0190(00)00045-4 2003-11-20 Geometric Two-Server Algorithms. 355-358 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#El-YanivK95 http://dx.doi.org/10.1016/0020-0190(94)00223-L 2003-11-20 Integer Sorting on a Mesh-Connected Array of Processors. 283-289 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Krizanc93 2004-12-10 Analysis of a List-Update Strategy. 115-121 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Pedrotti94 2003-11-20 A Distributed Algorithm for Multiple Entries to a Critical Section. 189-193 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Raymond89 2003-11-20 An Algorithm for Drawing General Undirected Graphs. 7-15 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#KamadaK89 2004-10-14 Searching with a Forbidden Lie Pattern in Responses. 127-132 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#DzyzowiczLP91 2003-11-20 Variants of the Software Solution to Mutual Exclusion. 206-208 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#DoranT80 2003-11-20 Perfect Power Testing. 59-63 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#BalasubramanianN96 http://dx.doi.org/10.1016/0020-0190(96)00042-7 2003-11-20 Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. 77-80 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#TardosV93 2003-11-20 A Note on Optimal Scheduling for Two-Processor Systems. 27-30 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Rowicki75 2003-11-20 A Note on Optimal Preemptive Scheduling for Two-Processor Systems. 25-28 1977 6 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Rowicki77 2003-11-20 Optimal Coteries and Voting Schemes. 1-6 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#DiksKKMP94 2003-11-20 On computing the optimal bridge between two convex polygons. 215-221 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#BhattacharyaB01 http://dx.doi.org/10.1016/S0020-0190(00)00228-3 2006-04-25 A Faster Alternative to SSS* with Extension to Variable Memory. 209-214 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#BhattacharyaB93 2006-04-25 A General Framework for Minimax Search in Game Trees. 295-301 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#BhattacharyaB94 2003-11-20 A Refinement Procedure for Pure Random Search. 197-200 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Anderssen72 2003-11-20 Constructing Byzantine Quorum Systems from Combinatorial Designs. 35-42 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#TsuchiyaIK99 http://dx.doi.org/10.1016/S0020-0190(99)00075-7 2003-11-20 Does co-NP Have Short Interactive Proofs? 127-132 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#BoppanaHZ87 2003-11-20 Representation and Equality of Modes. 61-65 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Scheidig71 2003-11-20 Three scheduling problems with deteriorating jobs to minimize the total completion time. 327-333 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#NgCBJ02 http://dx.doi.org/10.1016/S0020-0190(01)00244-7 2003-11-20 A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards. 327-328 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#DeselKVW95 http://dx.doi.org/10.1016/0020-0190(95)00065-K 2003-11-20 A force-directed algorithm that preserves edge-crossing properties. 7-13 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Bertault00 http://dx.doi.org/10.1016/S0020-0190(00)00042-9 2003-11-25 Salembier's Min-tree algorithm turned into breadth first search. 225-229 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Hesselink03 2003-11-20 Repetitions, Known or Unknown? 51-57 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Hesselink91 2003-11-20 Invariants for the Construction of a Handshake Register. 173-177 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Hesselink98 http://dx.doi.org/10.1016/S0020-0190(98)00158-6 2003-11-20 Seek Distances in Disks with Two Independent Heads Per Surface. 37-42 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#ManolopoulosV91 2004-02-24 An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. 67-69 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#ArvindB87 2003-11-20 Connected Domination and Steiner Set on Weighted Permutation Graphs. 215-220 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#ArvindR92 2003-11-20 Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue. 197-199 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#ArvindR99 http://dx.doi.org/10.1016/S0020-0190(99)00014-9 2004-02-24 Sparse Sets, Approximable Sets, and Parallel Queries to NP. 181-188 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#ArvindT99 http://dx.doi.org/10.1016/S0020-0190(99)00008-3 2003-11-20 An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph. 145-150 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#AranhaR96 http://dx.doi.org/10.1016/0020-0190(96)00102-0 2003-11-20 The cones and foci proof technique for timed transition systems. 33-40 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Zwaag01 http://dx.doi.org/10.1016/S0020-0190(01)00215-0 2003-11-20 On Attribute Grammars Without Atribute Synthesis. 103-109 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Sideri90 2003-11-20 A Lower Bound for Two-Server Balancing Algorithms. 39-43 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Kleinberg94 2003-11-20 Finding Shortest Paths in Distributed Loop Networks. 157-161 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#ChalamaiahR98 http://dx.doi.org/10.1016/S0020-0190(98)00099-4 2003-11-20 Multi-Processor Scheduling and Expanders. 315-319 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Kuzjurin94 2006-06-07 A Discrete-State Model of the Two-Headed Disk. 341-345 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#CarsonNV92 2003-11-20 Finding and counting small induced subgraphs efficiently. 115-121 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#KloksKM00 http://dx.doi.org/10.1016/S0020-0190(00)00047-8 2003-11-20 Bandwidth of Chain Graphs. 313-315 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#KloksKM98 http://dx.doi.org/10.1016/S0020-0190(98)00173-2 2003-11-20 Corrigendum: An Optimal Lower Bound for Nonregular Languages. 339 1994 52 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#BertoniMP94a 2003-11-20 A log log n Data Structure for Three-Sided Range Queries. 269-273 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#FriesMNT87 2003-11-20 Batch Sizes for the Batching Method of Colouring Planar Maps. 186-189 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Williams80a 2003-11-20 The Problem of Absolute Privacy. 169-171 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Williams83a 2003-11-20 Infinitary Tree Languages Recognized by omega-Automata. 15-19 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Saoudi84 2003-11-20 Vertex Ranking of Asteroidal Triple-Free Graphs. 201-206 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#KloksMW98 http://dx.doi.org/10.1016/S0020-0190(98)00162-8 2003-11-20 Lower Bounds for Rectilinear Steiner Trees in Bounded Space. 71-74 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Snyder91 2003-11-20 On the Complexity of Recursive Path Orderings. 257-262 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Snyder93 2003-11-20 A Transportable Code Generator System. 122-125 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#WilliamsB79 2003-11-20 Recording Distributed Snapshots Based on Causal Order of Message Delivery. 317-321 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#AcharyaB92 2004-09-20 Recording Distributed Snapshots Based on Causal Order of Message Delivery. 317-321 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#AcharyaC92 2003-11-20 Grant Levels in an Authorization Mechanism. 152-155 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#ParedaensP80 2003-11-20 A Learning-Theoretic Characterization of Classes of Recursive Functions. 205-211 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Kummer95 http://dx.doi.org/10.1016/0020-0190(95)00036-C 2003-11-20 Permutations of Bounded Degree Generate Groups of Polynomial Diameter. 253-254 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#McKenzie84 2003-11-20 Writing a Number as a Sum of Two Squares: A New Solution. 15-17 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Backhouse82 2003-11-20 Pair Algebras and Galois Connections. 169-175 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Backhouse98 http://dx.doi.org/10.1016/S0020-0190(98)00107-0 2003-11-20 Communication Errors in the pi-Calculus are Undecidable. 229-233 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#VasconcelosR99 http://dx.doi.org/10.1016/S0020-0190(99)00109-X 2003-11-25 A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. 63-70 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00476-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#ZhaoNI03 2003-11-20 A necessary condition for Constructive Negation in Constraint Logic Programming. 147-156 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#DovierPR00 http://dx.doi.org/10.1016/S0020-0190(00)00046-6 2003-11-20 An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication. 89-93 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#GrabnerP98 http://dx.doi.org/10.1016/S0020-0190(97)00225-1 2003-11-20 On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm. 389-396 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#KundeS87 2003-11-20 Some MAX SNP-Hard Results Concerning Unordered Labeled Trees. 249-254 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#ZhangJ94 2003-11-20 Some Results on the Containment and Minimization of (in) Equality Queries. 259-267 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#ZhangO94 2003-11-20 Comments on Monitor Definition and Implementation. 116-117 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Bochmann76 2003-11-20 Perception-Based Configuration Design of Computer Systems. 55-57 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Geist84 2003-11-20 Performance Bounds for Modeling NUMA Architectures. 113-117 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Geist97 http://dx.doi.org/10.1016/S0020-0190(97)00106-3 2003-11-20 A Conference Key Distribution System for the Star Configuration Based on the Discrete Logarithm Problem. 189-192 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#HiroseI97 http://dx.doi.org/10.1016/S0020-0190(97)00065-3 2003-11-20 A Note on `Master Keys for Group Sharing'. 12-14 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#BrouwerB82 2003-11-20 Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound. 55-63 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#SwainM02 http://dx.doi.org/10.1016/S0020-0190(01)00290-3 2003-11-20 On Injectivity of Deterministic Top-Down Tree Transducers. 183-188 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#FulopG93 2003-11-20 Domains of partial attributed tree transducers. 175-180 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#FulopM00 http://dx.doi.org/10.1016/S0020-0190(00)00028-4 2003-11-20 Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead. 3-5 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#FulopV89 2003-11-20 The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations. 293-296 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#FulopV90 2003-11-20 Synchronizing the I/O Behavior of Functional Programs with Feedback. 45-51 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Dwelly88 2003-11-25 Using stable sets to bound the chromatic number. 127-131 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00266-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#WerraH03 2003-11-20 All-pairs shortest-paths computation in the presence of negative cycles. 341-343 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#MehlhornPSS02 http://dx.doi.org/10.1016/S0020-0190(01)00242-3 2003-11-20 A Probabilistic Algorithm for Verifying Matrix Products Using O(n²) Time and log_2 n + O(1) Random Bits. 107-110 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#KimbrelS93 2003-11-20 Nearly-Perfect Hypergraph Packing is in NC. 295-299 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Grable96 http://dx.doi.org/10.1016/S0020-0190(96)00181-0 2003-11-20 Extending Bachmair's Method for Proof by Consistency to the Final Algebra. 303-310 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Lysne94 2003-12-19 Space as Time. 113-115 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Farinas83 2003-11-20 F-Factors of Graphs: A Generalized Matching Problem. 207-214 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Muhlbacher79 2003-11-20 Convexifying polygons with simple projections. 81-86 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#CalvoKMST01 http://dx.doi.org/10.1016/S0020-0190(01)00150-8 2003-11-20 A Note on the Semantic Definition of Side Effects. 118-120 1976 4 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#CunninghamG76 2003-11-20 Simple Interpretations Among Complicated Theories. 235-238 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Gradel90 2003-11-20 Implementing Dictionaries Using Binary Trees of Very Small Height. 11-14 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#MaurerOS76 2003-11-20 Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. 49-52 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#SuzukiYUK98 http://dx.doi.org/10.1016/S0020-0190(98)00029-5 2003-11-20 Optimal Broadcasting in Hypercubes with Dynamic Faults. 81-85 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#DobrevV99 http://dx.doi.org/10.1016/S0020-0190(99)00093-9 2003-11-20 On Termination of Confluent One-Rule String-Rewriting Systems. 91-96 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Shikishima-TsujiKK97 http://dx.doi.org/10.1016/S0020-0190(96)00200-1 2003-11-24 Deadline-based scheduling of periodic task systems on multiprocessors. 93-98 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00231-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#SrinivasanB02 2003-11-20 An Extension of Khrapchenko's Theorem. 215-217 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Zwick91 2003-11-20 On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits. 29-30 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Zwick96 http://dx.doi.org/10.1016/0020-0190(96)00080-4 2003-11-20 On the Normalization of Relational Databases. 89-92 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#SrinivasanR79 2003-11-20 1-Approximation Algorithm for Bottleneck Disjoint Path Matching. 41-44 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#DattaS95 http://dx.doi.org/10.1016/0020-0190(95)00031-7 2003-11-20 An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs. 9-15 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#DattaS99 http://dx.doi.org/10.1016/S0020-0190(99)00077-0 2003-11-20 Direction-Independent Application of Productions on Two-Dimensional Arrays. 295-301 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#AizawaN86 2003-11-20 An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem. 261-265 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#GensL98 http://dx.doi.org/10.1016/S0020-0190(98)00115-X 2003-11-20 Communication Problems on MIMD Parallel Computers. 69-73 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#McKeownR84 2003-11-20 A Note on Medium Selection and Spider Production. 19-22 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Eberlein79 2003-11-20 An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. 132-133 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Graham72 2003-11-20 On the computational power of linearly transformed BDDs. 119-125 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#GuntherD00 http://dx.doi.org/10.1016/S0020-0190(00)00083-1 2003-11-20 Monotone Real Circuits are More Powerful than Monotone Boolean Circuits. 161-164 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Rosenbloom97 http://dx.doi.org/10.1016/S0020-0190(97)00007-0 2003-11-20 On the Sets of Perfect Matchings for Two Bipartite Graphs. 95-97 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Rosenbloom99 http://dx.doi.org/10.1016/S0020-0190(99)00046-0 2003-11-20 Path Integral Evaluation of Aloha Network Transients. 289-295 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#GuntherS90 2003-11-20 Learning Conjunctions with Noise under Product Distributions. 189-196 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#MansourP98 http://dx.doi.org/10.1016/S0020-0190(98)00165-3 2003-11-20 On the Computational Complexity of Graph Closures. 291-295 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Monti96 http://dx.doi.org/10.1016/0020-0190(96)00027-0 2003-11-20 On the security of a convertible group signature scheme. 93-96 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Saeednia00 http://dx.doi.org/10.1016/S0020-0190(00)00009-0 2003-11-20 An identity-based society oriented signature scheme with anonymous signers. 295-299 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Saeednia02 http://dx.doi.org/10.1016/S0020-0190(02)00216-8 2003-11-25 A note on Girault's self-certified model. 323-327 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00203-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Saeednia03 2003-11-20 Recognizing cographs and threshold graphs through a classification of their edges. 129-139 2000 74 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Nikolopoulos00 http://dx.doi.org/10.1016/S0020-0190(00)00041-7 2003-11-20 Constant-Time Parallel Recognition of Split Graphs. 1-8 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Nikolopoulos95 http://dx.doi.org/10.1016/0020-0190(94)00233-O 2003-11-20 Obituary: Victor Mikhaylovich Glushkov (1923-1982). 236-237 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Zemanek82 2003-11-20 A Mechanical Proof of the Termination of Takeuchi's Function. 176-181 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Moore79 2003-11-20 Huffman Coding in Bit-Vector Compression. 304-307 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Jakobsson78 2003-11-20 Evaluation of a Hierarchical Bit-Vector Compression Technique. 147-149 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Jakobsson82 2003-11-20 A Note on the Reconstruction of a Binary Tree from its Traversals. 117-119 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#GabraniS92 2003-11-20 An Iterative Program to Calculate Fibonacci Numbers in O(log n) Arithmetic Operations. 299-303 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Shortt78 2003-11-20 On a Geometric Problem of Zigzags. 1-4 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#HalavaHI97 http://dx.doi.org/10.1016/S0020-0190(97)00042-2 2003-11-20 A Note on `Is Shortest Path Problem not Harder Than Matrix Multiplication?'. 85-86 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Moran81 2003-11-20 Generalized Lower Bounds Derived from Hastad's Main Lemma. 383-388 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Moran87 2003-11-20 Analysis of Random Probing Hashing. 83-90 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Ramakrishna89 2003-11-20 An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube. 219-224 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#StamoulisT93 2003-11-20 A Simple FORTRAN Support for Computer-Assisted Instruction. 88-90 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#BonoDMRV75 2003-11-20 Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs. 137-143 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Mosca97 http://dx.doi.org/10.1016/S0020-0190(96)00197-4 2003-11-20 Optimal Networks for Distributing Nonsequential Programs. 71-74 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Eicholz83 2003-11-20 Finding Paths and Deleting Edges in Directed Acyclic Graphs. 5-11 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Italiano88 2003-11-24 The on-line first-fit algorithm for radio frequency assignment problems. 195-199 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00283-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#TsaiLH02 2003-11-20 Real Addition and the Polynomial Hierarchy. 115-120 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Sontag85 2003-11-20 Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space. 275-282 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#TsaiTC94 2003-11-20 A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. 305-310 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#GoldschmidtHY93 2003-11-20 Evaluations of Domino-Free Communication-Induced Checkpointing Protocols. 31-37 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#TsaiWK99 http://dx.doi.org/10.1016/S0020-0190(98)00183-5 2003-11-20 A Shared-Memory Scheme for Coalesced Hashing. 77-79 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Vitter81 2003-11-20 Armstrong Databases for Functional and Inclusion Dependencies. 13-19 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#FaginV83 2003-11-20 Some Remarks on the Kronecker Product of Graphs. 55-61 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#BottreauM98 http://dx.doi.org/10.1016/S0020-0190(98)00145-8 2003-11-20 Implementing (Nondeterministic) Parallel Assignments. 177-179 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Grandi96 http://dx.doi.org/10.1016/0020-0190(96)00053-1 2003-11-20 The Maximum Depth of Monotone Formulae. 65 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#McColl78 2003-11-20 Bucking the trends. 85-87 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Braben01 http://dx.doi.org/10.1016/S0020-0190(00)00194-0 2003-11-20 Parallel Maximum Independent Set in Convex Bipartite Graphs. 289-294 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#CzumajDP96 http://dx.doi.org/10.1016/0020-0190(96)00131-7 2003-11-20 Recognition of E0L Languages in Less Than Quartic Time. 174-175 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Grant77a 2003-11-20 The Inclusion of D0L in MULTI-RESET. 45-47 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#ClerboutL81 2003-11-20 Two Characterization Theorems of Locally Catenative Developmental Systems. 120-124 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Kobuchi77 2003-11-20 Stability of Desynchronized 0L Systems. 85-90 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Kobuchi83 2003-11-20 A Note on Symmetrical Cellular Spaces. 413-416 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Kobuchi87 2003-11-20 Order of State Functions and Logic Functions. 61-66 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Kobuchi92 2003-11-20 Estimating the Range of a Function in an Online Setting. 31-35 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Mount99 http://dx.doi.org/10.1016/S0020-0190(99)00118-0 2003-11-20 A Note on Grammatical Covers. 127-129 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Moura80 2003-11-20 Timed automata and additive clock constraints. 1-7 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BerardD00 http://dx.doi.org/10.1016/S0020-0190(00)00075-2 2003-11-20 The VLSI Optimality of the AKS Sorting Network. 55-59 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#BilardiP85 2003-11-20 Modularity of Confluence: A Simplified Proof. 101-109 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#KlopMTV94 2003-11-25 On the spectrum of projective norm-graphs. 71-74 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00482-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Szabo03 2003-11-20 Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting. 273-280 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#BokkaGOS95 http://dx.doi.org/10.1016/0020-0190(95)00160-8 2003-11-20 An Improvement in the Iterative Data Flow Analysis Algorithm. 108-110 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Jazayeri80 2006-04-26 Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems. 249-254 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#DavisB95 http://dx.doi.org/10.1016/0020-0190(94)00200-I 2003-11-20 The Expected Length of a Shortest Path. 135-141 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#DavisP93 2003-11-20 Calculating sharp adaptation rules. 201-208 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Naumann01 http://dx.doi.org/10.1016/S0020-0190(00)00215-5 2003-11-20 A Recursion Theorem for Predicate Transformers on Inductive Data Types. 329-336 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Naumann94 2003-11-20 Errata: A Fast Method for Interpolation Using Preconditioning. 216 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Horowitz72a 2003-11-24 A simple group mutual l-exclusion algorithm. 79-85 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00355-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Vidyasankar03 2003-11-20 Converting Lamport's Regular Register to Atomic Register. 287-290 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Vidyasankar88 2003-11-25 Estimating network size from local information. 237-243 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#HorowitzM03 2003-11-20 An Elegant 1-Writer Multireader Multivalued Atomic Register. 221-223 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Vidyasankar89 2003-11-20 A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable. 323-326 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Vidyasankar91 2003-11-24 Parametric analysis of overall min-cuts and applications in undirected networks. 105-109 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00364-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#AnejaCN03 2003-11-20 Calculating the Hausdorff Distance Between Curves. 17-22 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#BelogayCMS97 http://dx.doi.org/10.1016/S0020-0190(97)00140-3 2003-11-20 Un-Skolemizing Clause Sets. 257-263 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#McCune88 2003-11-20 Automatic Proofs and Counterexamples for Some Ortholattice Identities. 285-291 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#McCune98 http://dx.doi.org/10.1016/S0020-0190(98)00015-5 2003-11-24 On the balancedness of nonlinear generators of binary sequences. 111-116 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00349-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Fuster-SabaterG03 2003-11-20 Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application. 281-285 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#ShmoysW90 2003-11-20 A note on the spectral characterization of correlation immune Boolean functions. 191-195 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Sarkar00 http://dx.doi.org/10.1016/S0020-0190(00)00063-6 2003-11-20 There exist oriented planar graphs with oriented chromatic number at least sixteen. 309-312 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Sopena02 http://dx.doi.org/10.1016/S0020-0190(01)00246-0 2003-11-20 A practical approach of task scheduling and load balancing on heterogeneous distributed raytracing systems. 65-71 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#QureshiH01 http://dx.doi.org/10.1016/S0020-0190(00)00177-0 2003-11-20 Parallel distance transforms on a linear array architecture. 73-81 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#ChiaWCL02 http://dx.doi.org/10.1016/S0020-0190(01)00250-2 2003-11-20 A Calculus of Durations. 269-276 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#ChaochenHR91 2003-11-20 Linear Bounds for On-Line Steiner Problems. 59-63 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#WestbrookY95 http://dx.doi.org/10.1016/0020-0190(95)00000-3 2003-11-20 The Two-Thirds Rule for Dynamic Storage Allocation Under Equilibrium. 59-60 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Gelenbe71 2003-11-20 A time-optimal distributed sorting algorithm on a line network. 21-26 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Sasaki02 http://dx.doi.org/10.1016/S0020-0190(01)00307-6 2003-11-20 The Effect of the Density of States on the Metropolis Algorithm. 159-163 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Sasaki91 2003-11-20 Parity OBDDs Cannot be Handled Efficiently Enough. 163-168 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#LobbingSW98 http://dx.doi.org/10.1016/S0020-0190(98)00113-6 2003-11-20 A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph. 28-30 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Syslo82 2003-11-20 On the Relationship Between SonTtrees and Symmetric Binary B-Trees. 4-8 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Olivie80 2003-11-20 A New Optimal Distributed Algorithm for the Set Intersection Problem. 143-148 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#RajanarayananI91 2003-11-20 A Storage-Size Selection Problem. 295-296 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#FriesenL84 2003-11-20 Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements. 223-227 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#CarlsonS82 2003-11-20 A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra. 159-161 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Klapper87 2003-11-20 An Infinite Word Language Which is Not co-CFL. 81-85 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Grazon87 2003-11-20 Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic. 171 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Pachl92a 2003-11-20 Minimal Storage Representations for Binary Relations. 63-66 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#LagariasS82 2003-11-20 On Facilities for Interprocess Communication. 221-226 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Harland81a 2003-11-20 A Decidability Theorem for a Class of Vector-Addition Systems. 78-80 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Crespi-ReghizziM75 2003-11-20 A Class of Grammar Generating Non-Counting Languages. 24-26 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Crespi-ReghizziM78 2003-11-20 A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange Network. 259-268 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Birkhoff85 2004-06-08 On the Computability of Circumscription. 237-243 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Krishnaprasad88 http://dx.doi.org/10.1016/0020-0190(88)90085-3 2003-11-20 An Extension of Savitch's Theorem to Small Space Bounds. 106-108 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Tompa81 2003-11-20 A Faster Algorithm for Finding Edge-Disjoint Branchings. 73-76 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#TongL83 2003-11-20 On building the Transitive Reduction of a Two-Dimensional Poset. 9-12 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#NardelliMS97 http://dx.doi.org/10.1016/S0020-0190(97)00090-2 2003-11-20 Directed Maximal-Cut Problems. 238-241 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#FarleyP82 2003-11-20 A faster computation of the most vital edge of a shortest path. 81-85 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#NardelliPW01 http://dx.doi.org/10.1016/S0020-0190(00)00175-7 2003-11-20 Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. 51-54 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#NardelliPW98 http://dx.doi.org/10.1016/S0020-0190(98)00077-5 2003-11-20 Splitmerge - A Fast Stable Merging Algorithm. 189-192 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Carlsson86 2003-11-20 A Variant of Heapsort with Almost Optimal Number of Comparisons. 247-250 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Carlsson87 2003-11-20 An Optimal Algorithm for Deleting the Root of a Heap. 117-120 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Carlsson91 2006-06-27 A Semantic Approach for Modular Synthesis of VLSI Systems. 1-7 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#BalakrishnanSMBL88 2005-01-12 Constrained Integer Approximation to Planar Line Intersection. 137-139 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#MehtaMN91 2003-11-20 Median Selection of 9 Elements in 14 Comparisons. 8-12 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Noshita74 2003-11-20 Translation of Turner Combinators in O(n log n) Space. 71-74 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Noshita85 2003-11-20 On the location of Steiner points in uniformly-oriented Steiner trees. 237-241 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#NielsenWZ02 http://dx.doi.org/10.1016/S0020-0190(02)00208-9 2003-11-20 A note on approximating Max-Bisection on regular graphs. 181-188 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#FeigeKL01 http://dx.doi.org/10.1016/S0020-0190(00)00189-7 2003-11-20 Efficient Recognition of Rational Relations. 34-38 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#LeeuwenN82 2003-11-20 An Improved Bound for Detecting Looping Configurations in Deterministic DPA's. 22-24 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#LeeuwenS74 2003-11-20 Dynamization of Decomposable Searching Problems. 51-56 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#LeeuwenW80 2003-11-20 Termination Detection for Distributed Computations. 33-36 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Topor84 2003-11-20 An Extension to Trees of the Sardinas and Patterson Algorithm. 168-173 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Franchi-Zannettacci82 2003-11-20 A Note on the Power of Majority Gates and Modular Gates. 321-327 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Goldmann95 http://dx.doi.org/10.1016/0020-0190(94)00221-J 2003-11-20 On the Power of a Threshold Gate at the Top. 287-293 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Goldmann97 http://dx.doi.org/10.1016/S0020-0190(97)00141-5 2003-11-20 Finding Extremal Sets in Less than Quadratic Time. 29-34 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#YellingJ93 2003-11-20 On secret set schemes. 243-251 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#SantisM00 http://dx.doi.org/10.1016/S0020-0190(00)00061-2 2003-11-20 A Dual Link Data Structure for Random File Organization. 64-69 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#BanerjeeR75 2003-11-20 Rewriting queries using views over monadic database schemas. 111-114 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Bussche01 http://dx.doi.org/10.1016/S0020-0190(00)00180-0 2003-11-20 Nonisomorphic Trees with the Same T-Polynomial. 73-76 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#DinicKZ77 2003-11-20 Proving Correctness of Strategies in the AL1 Assertional Language. 223-230 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Bratko78 2003-11-20 Computing a Single Cell in the Overlay of Two Simple Polygons. 215-219 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BergDDS97 http://dx.doi.org/10.1016/S0020-0190(97)00125-7 2003-11-20 Triangulating a Simple Polygon. 175-179 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#GareyJPT78 2003-11-20 On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. 31-35 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#SavitchV84 2003-11-20 Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. 227-230 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#HararyR98 http://dx.doi.org/10.1016/S0020-0190(98)00124-0 2003-11-20 A Linear Algorithm for the Cutting Center of a Tree. 317-319 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#HararyS86 2003-11-20 Modulo Classes and Logarithmic Advice. 241-245 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Ramachandran95 http://dx.doi.org/10.1016/0020-0190(95)00109-P 2003-11-20 How to Prove Representation-Independent Independence Results. 5-10 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#KurtzOR87 2003-11-20 Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata. 195-198 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Freivalds81 2003-11-20 A Positive Relativization of Polynomial Time Versus Polylog Space. 119-123 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Gavalda93 2003-11-20 Producing Optimised Code for Coercions. 56-59 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Banatre77 2003-11-20 Insertion Merge Sorting. 92-99 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#PeltolaE78 2003-11-20 Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete. 159-165 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#KavrakiK95 http://dx.doi.org/10.1016/0020-0190(95)00083-O 2003-11-20 Rate Monotonic Scheduling in Hard Real-Time Systems. 39-45 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#SantosO93 2003-11-24 New bounds on a hypercube coloring problem. 265-269 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00301-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#NgoDG02 2003-11-20 Full Table Search by Polynomial Functions. 72-74 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Santoro76 2003-11-20 Extending the Four Russians' Bound to General Matrix Multiplication. 87-88 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Santoro80 2003-11-20 A Batching Method for Coloring Planar Graphs. 185-188 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#LiptonM78 2003-11-20 The Processor Identity Problem. 91-94 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#LiptonP90 2003-11-20 A Synchronization Anomaly. 65-66 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#LiptonT75 2003-11-20 Associative-Commutative Reduction Orderings. 21-27 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Bachmair92 2003-11-20 Corrigenda: Corrections to a Distributed Depth-First Search Algorithm. 55-56 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#KumarIS90 2003-11-20 Maximal matching stabilizes in time O(m). 221-223 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#HedetniemiJS01 http://dx.doi.org/10.1016/S0020-0190(01)00171-5 2003-11-25 Linear time self-stabilizing colorings. 251-255 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00299-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HedetniemiJS03 2003-11-20 Constructing Optimal Binary Decision Trees is NP-Complete. 15-17 1976 5 1 Inf. Process. Lett. http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#HyafilR76 2003-11-20 On the Additive Complexity of Specific Polynomials. 45-47 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#HyafilW75 2003-11-20 Worst-case analysis of the Iterated Longest Fragment algorithm. 147-153 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#BekesiG01 http://dx.doi.org/10.1016/S0020-0190(00)00185-X 2003-11-20 A Hashing Method for Fast Set Operations. 31-34 1976 5 2 Inf. Process. Lett. http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#SassaG76 2003-11-20 "V-Tape", A Virtual Memory Oriented Data Type, and its Resource Requirements. 50-55 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#SassaG77 2003-11-20 Binary Self-Stabilization in Distributed Systems. 153-159 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Ghosh91 2003-11-20 A Simple Realization of LR-Parsers for Regular Right Part Grammars. 113-120 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#SassaN87 2003-11-20 Time-Optimal Short-Circuit Evaluation of Boolean Expressions. 43-51 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#SassaN88 2003-11-20 Systematic Debugging Method for Attribute Grammar Description. 305-313 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#SassaO97 http://dx.doi.org/10.1016/S0020-0190(97)00079-3 2003-11-20 On Sparse Sets in NP - P. 55-60 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Hartmanis83 2003-11-20 Independence Results About Context-Free Languages and Lower Bounds. 241-248 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Hartmanis85 2003-11-20 A Fully Distributed Termination Detection Scheme. 13-18 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Huang88a 2003-11-20 Optimal 1-fair alternators. 159-163 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#HuangC01 http://dx.doi.org/10.1016/S0020-0190(01)00158-2 2003-11-24 A statement based parallelizing framework for processor-in-memory architectures. 159-163 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00353-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#HuangC03 2003-11-20 A Self-Stabilizing Algorithm for Constructing Breadth-First Trees. 109-117 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#HuangC92 2003-11-20 Complexity of the Repeaters Allocating Problem. 13-20 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#HuangH91 2003-11-20 Stable Set and Multiset Operations in Optimal Time and Space. 131-136 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#HuangL91 2003-11-20 Four-State Stabilizing Phase Clock for Unidirectional Rings of Odd Size. 325-329 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#HuangL98 http://dx.doi.org/10.1016/S0020-0190(98)00006-4 2003-11-20 A Note on the VLSI Counter. 193-195 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#CodenottiL86 2003-11-20 Communication Primitives for BSP Computers. 303-310 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#JuurlinkW96 http://dx.doi.org/10.1016/0020-0190(96)00073-7 2003-11-20 Implementation of a Wait-Free Synchronization Primitive that Solves n-Process Consensus. 81-83 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#FeitelsonR89 2005-04-04 A Parallel Reference Counting Algorithm. 33-37 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#KakutaNI86 2003-11-20 A Non-SOS Operational Semantics for a Process Algebra. 47-54 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#FraczakZ98 http://dx.doi.org/10.1016/S0020-0190(98)00135-5 2003-11-20 Parallel Boolean Operations for Information Retrieval. 99-108 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#BatainehOS91 2003-11-20 Quorums from difference covers. 9-12 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#ColbournL00 http://dx.doi.org/10.1016/S0020-0190(00)00080-6 2003-11-20 A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. 96-97 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#ColbournM80 2003-11-20 On Finding the Strongly Connected Components in a Directed Graph. 9-14 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#NuutilaS94 2003-11-20 Counting Convex Polygons in Planar Point Sets. 45-49 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#MitchellRSW95 http://dx.doi.org/10.1016/0020-0190(95)00130-5 2003-11-24 Efficient multi-variate abstraction using an array representation for combinators. 311-317 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00318-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Diller02 2003-11-20 An Algorithm for Verifying Equations of Morphisms in a Category. 104-108 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#WatjenS82 2003-11-20 Decidability Results Concerning k-limited ED0L Systems. 13-17 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#WatjenS96 http://dx.doi.org/10.1016/0020-0190(96)00081-6 2003-11-20 On the Degree of Synchronization of kl TOL and k1 ETOL Systems. 87-89 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#WatjenU88 2003-11-20 How to Construct Efficient Signcryption Schemes on Elliptic Curves. 227-233 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#ZhengI98 http://dx.doi.org/10.1016/S0020-0190(98)00167-7 2003-11-20 A New Algorithm for Finding Weak Components. 13-15 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Tarjan74a 2003-11-20 A Good Algorithm for Edge-Disjoint Branching. 51-53 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Tarjan74b 2003-11-20 Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees. 30-33 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Tarjan82a 2003-11-20 An Improved Algorithm for Hierarchical Clustering Using Strong Components. 37-41 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Tarjan83a 2003-11-20 The Speed of Copying on One-Tape Off-Line Turing Machines. 83-89 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Dietzfelbinger89 2003-11-20 Weakest Preconditions for Pure Prolog Programs. 145-150 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#PedreschiR98 http://dx.doi.org/10.1016/S0020-0190(98)00098-2 2003-11-20 A Linear Time Algorithm for Unique Horn Satisfiability. 61-66 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Pretolani93 2003-11-20 On the Partial Computation Principle. 38-41 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Ershov77 2003-11-20 A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs. 255-259 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#HeydemannS95 http://dx.doi.org/10.1016/0020-0190(94)00210-P 2003-11-20 On the Divergence and the Joshi Dependence Measure in Feature Selection. 135-137 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Kittler75 2003-11-20 A Method for Determining Class Subspaces. 77-79 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Kittler77 2003-11-20 Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube. 321-325 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#RavindranG93 2003-11-20 Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation. 149-157 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ChangCH93 2003-11-20 On the Costs of Self-Stabilization. 311-316 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#ChangGR87 2003-11-20 An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs. 255-260 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#ChangHT90 2003-11-20 The Design and Analysis of a New Hybrid Sorting Algorithm. 213-218 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#MeijerA80 2003-11-20 Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. 35-38 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#MeijerR92 2003-11-20 Global lock escalation in database management systems. 179-186 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#ChangLW02 http://dx.doi.org/10.1016/S0020-0190(01)00261-7 2003-11-20 Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes. 255-260 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Bernstein86 2003-11-20 Predicate Transfer and Timeout in Message Passing Systems. 43-52 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Bernstein87 2003-11-20 Weighted Irredundance of Interval Graphs. 65-70 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#ChangNR98 http://dx.doi.org/10.1016/S0020-0190(98)00040-4 2003-11-20 A V² Algorithm for Determining Isomorphism of Planar Graphs. 32-34 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#HopcroftT71 2003-11-20 Proving Properties of a Ring of Finite-State Machines. 213-214 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Suzuki88 2003-11-20 Does Randomization Help in On-Line Bin Packing? 15-19 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Chandra92 2003-11-20 Constructing Sparse Spanners for Most Graphs in Higher Dimensions. 289-294 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Chandra94 2003-11-20 An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. 247-251 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Levcopoulos87 2003-11-20 Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis. 121-125 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#ChangWK93 2003-11-20 The (n, k)-Star Graph: A Generalized Star Graph. 259-264 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#ChiangC95 http://dx.doi.org/10.1016/0020-0190(95)00162-1 2003-11-20 On the Arrangement Graph. 215-219 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#ChiangC98 http://dx.doi.org/10.1016/S0020-0190(98)00052-0 2003-11-20 An Exact Analysis on Expected Seeks in Shadowed Disks. 323-329 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#VakaliM97 http://dx.doi.org/10.1016/S0020-0190(97)00030-6 2003-11-20 Deadlock Absence Proofs for Networks of Communicating Processes. 185-189 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#ChandyM79 2003-11-20 Tight Comparison Bounds for the String Prefix-Matching Problem. 51-57 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#BreslauerCT93 2003-11-20 Generalized Lattices Applicable in Retrieval Models. 144-148 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Reusch76 2003-11-20 Communication Complexity of Multi-Processor Systems. 57-65 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Fleischer89 2003-11-20 An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints. 317-321 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#BoroujerdiU98 http://dx.doi.org/10.1016/S0020-0190(98)00134-3 2003-11-20 Folding of the Plane and the Design of Systolic Arrays. 149-153 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#ChoffrutC83 2003-11-20 ^NP. 257-260 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#GreenP01 http://dx.doi.org/10.1016/S0020-0190(01)00176-4 2003-11-20 An Improved Parallel Algorithm for Maximal Matching. 57-60 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#IsraeliS86 2003-11-20 The Time Complexity of Updating Snapshot Memories. 33-40 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#IsraeliS98 http://dx.doi.org/10.1016/S0020-0190(97)00189-0 2003-11-25 A note on the terminal Steiner tree problem. 219-220 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00285-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Fuchs03 2003-11-20 Sorting Roughly Sorted Sequences in Parallel. 297-300 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#AltmanC90 2003-11-20 A Note on Ambiguity in Context-Free Grammars. 111-114 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#AltmanL90 2003-11-20 An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem. 215-219 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#HochbaumS89 2003-11-20 Compositionality and Bisimulation: A Negative Result. 109-114 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#FantechiG91 2003-11-20 Optimum Domination in Weighted Trees. 261-265 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#NatarajanW78 2003-11-20 A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. 37-40 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Sleator80 2003-11-20 Numerical Differentiation of Experimental Data. 24-25 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Varhegyi73 2003-11-20 ²Mod p Orbits. 3-7 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#VitiniMD99 http://dx.doi.org/10.1016/S0020-0190(99)00126-X 2003-11-20 Efficient Algorithms for Common Transversals. 87-91 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#AtallahB87 2003-11-20 An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. 159-165 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#AtallahC89 2003-11-20 An Adversary-Based Lower Bound for Sorting. 55-57 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#AtallahK81 2003-11-20 Time Efficient Systolic Architecture for Matrix * Vector Multiplication. 225-231 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#ZubairM87 2003-11-20 A Fast Garbage Compaction Algorithm. 26-30 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Jonkers79 2003-11-20 Subword Complexity of a Generalized Thue-Morse Word. 313-316 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#TrompS95 http://dx.doi.org/10.1016/0020-0190(95)00074-M 2003-11-20 A uniform framework for term and graph rewriting applied to combined systems. 53-59 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Ohlebusch00 http://dx.doi.org/10.1016/S0020-0190(99)00150-7 2003-11-24 Hierarchical termination revisited. 207-214 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00272-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Ohlebusch02 2003-11-20 Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. 223-228 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Ohlebusch95 http://dx.doi.org/10.1016/0020-0190(94)00187-4 2004-02-25 On the antisymmetry of Galois embeddings. 57-63 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#BurghardtKS01 http://dx.doi.org/10.1016/S0020-0190(00)00176-9 2004-01-14 Kinetic heap-ordered trees: Tight analysis and improved algorithms. 165-169 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00366-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#FonsecaF03 2003-11-20 Partition-distance: A problem and class of perfect graphs arising in clustering. 159-164 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Gusfield02 http://dx.doi.org/10.1016/S0020-0190(01)00263-0 2003-11-20 Connectivity and Edge-Disjoint Spanning Trees. 87-89 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Gusfield83 2003-11-20 Faster Implementation of a Shortest Superstring Approximation. 271-274 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Gusfield94 2003-11-20 The Causal Ordering Abstraction and a Simple Way to Implement it. 343-350 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#RaynalST91 2003-11-20 Maximum Matchings and Trees. 202-205 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Savage80 2003-11-20 Depth-First Search and the Vertex Cover Problem. 233-237 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Savage82 2004-06-08 Recognizing Majority on a One-Way Mesh. 221-225 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Savage88 http://dx.doi.org/10.1016/0020-0190(88)90083-X 2003-11-20 Algorithmic construction of Hamiltonians in pyramids. 75-79 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Sarbazi-AzadOM01 http://dx.doi.org/10.1016/S0020-0190(01)00149-1 2003-11-20 The Time Required to Evaluate Division-Free Arithmetic Expressions. 144-146 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#PreparataM75 2003-11-20 A Note on the Complexity of Approximative Evaluation of Polynomials. 73-75 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Nozaki79 2003-11-20 An Improved Parallel Processor Bound in Fast Matrix Inversion. 148-150 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#PreparataS78 2003-11-20 Testing a Simple Polygon for Monotonicity. 161-164 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#PreparataS81 2003-11-20 Area-Time Optimal VLSI Networks for Multiplying Matrices. 77-80 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#PreparataV80 2003-11-20 Real-Time Scheduling of Linear Speedup Parallel Tasks. 35-40 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Drozdowski96 http://dx.doi.org/10.1016/0020-0190(95)00174-3 2003-11-20 A Pattern Representation of Indexed Languages. 152-154 1976 5 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#DuskePS76 2003-11-20 Approximating Block Accesses in Database Organizations. 75-79 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#PalviaM84 2003-11-20 Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees. 67-76 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Trier92 2003-11-20 Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. 15-17 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#BertoniCF95 http://dx.doi.org/10.1016/0020-0190(95)00126-W 2003-11-20 Algorithms for Three-Dimensional Dominance Searching in Linear Space. 277-283 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#MakrisT98 http://dx.doi.org/10.1016/S0020-0190(98)00075-1 2005-06-23 Counting Problems and Algebraic Formal Power Series in Noncommuting Variables. 117-121 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#BertoniGM90 2003-11-20 ^d. 197 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Kallay84 2003-11-20 Convex Hull Made Easy. 161 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Kallay86 2003-11-20 Transfer theorems via sign conditions. 65-69 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Koiran02 http://dx.doi.org/10.1016/S0020-0190(01)00197-1 2003-11-20 Heuristic Algorithms for Process Assignment in Distributed Computing Systems. 199-203 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#AroraR80a 2003-11-20 An Optimal Lower Bound for Nonregular Languages. 289-292 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#BertoniMP94 2003-11-20 Three Efficient Algorithms for Counting Problems. 50-53 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#BertoniMT79 2003-11-20 Exploiting the Optimal Paging Algorithms. 233-236 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#AroraS78a 2003-11-20 Distributed Termination Detection Algorithm for Distributed Computations. 311-314 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#AroraRG86 2003-11-20 <i>p</i><i>k</i>-Center Problem. 131-134 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ChaudhuriGR98 http://dx.doi.org/10.1016/S0020-0190(97)00224-X 2003-11-20 The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems. 177-182 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#TsaiT93 2003-11-20 On the Formal Specification of the Semantics of Processed Information. 116-119 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Talbert77 2003-11-24 Near optimal Cholesky factorization on orthogonal multiprocessors. 23-30 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00222-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#BansalVG02 2003-11-20 On the Vector Representation of the Reachability in Planar Directed Graphs. 75-77 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Kameda75 2003-11-20 The Membership Question for ET0L-Languages is Polynomially Complete. 138-143 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Leeuwen75 2003-11-20 On Compromising Statistical Data-Bases with a few Known Elements. 149-153 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Leeuwen79 2003-11-20 A Note on SpanP Functions. 7-10 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#MahajanTV94 2003-11-20 A Simplified NP-Complete MAXSAT Problem. 1-6 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#RamanRR98 http://dx.doi.org/10.1016/S0020-0190(97)00223-8 2003-11-20 Monte Carlo Estimation of Numerical Stability in Fast Algorithms for Systems of Bilinear Forms. 162-167 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Beretta82 2003-11-20 An Approximation Algorithm for Reducing Expected Head Movement in Linear Storage Devices. 218-220 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#TroyaV81 2003-11-20 A Closure Property of Deterministic Context-Free Languages. 13-16 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Choffrut81 2003-11-20 Attacks on Threshold Signature Schemes with Traceable Signers. 1-4 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#TsengJ99 http://dx.doi.org/10.1016/S0020-0190(99)00078-2 2003-11-20 Obtaining Lower Bounds Using Artificial Components. 243-246 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Ramanan87 2003-11-20 Average-Case Analysis of the Smart Next Fit Algorithm. 221-225 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Ramanan89 2003-11-20 Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes. 217-222 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Tseng96 http://dx.doi.org/10.1016/0020-0190(96)00114-7 2003-11-20 A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing Environments. 285-290 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#MizunoN98 http://dx.doi.org/10.1016/S0020-0190(98)00069-6 2003-11-20 A Note on Randomized Mutual Search. 187-191 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#LotkerP99 http://dx.doi.org/10.1016/S0020-0190(99)00112-X 2003-11-20 Connectivity of the Crossed Cube. 221-226 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Kulasinghe97 http://dx.doi.org/10.1016/S0020-0190(97)00012-4 2003-11-20 On the Length of Word Chains. 23-28 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#BerstelB87 2003-11-20 It is Hard to Know when Greedy is Good for Finding Independent Sets. 101-111 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#BodlaenderTY97 http://dx.doi.org/10.1016/S0020-0190(96)00208-6 2003-11-20 Throughput Concavity and Response Time Convexity. 209-212 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#DowdyEGS84 2003-11-20 A Heuristic Method for Generating Large Random Expressions. 165-170 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Bainbridge92 2003-11-20 Dynamic Cycle Detection. 185-188 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Shmueli83 2003-11-24 Minimum feedback vertex set and acyclic coloring. 131-139 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00265-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#FertinGR02 2003-11-25 Acyclic and k-distance coloring of the grid. 51-58 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00232-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#FertinGR03 2003-11-20 Fast Practical Multi-Pattern Matching. 107-113 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#CrochemoreCGLPR99 http://dx.doi.org/10.1016/S0020-0190(99)00092-7 2003-11-24 On the oriented chromatic number of grids. 261-266 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00405-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#FertinRR03 2003-11-20 A General Program Scheme for Finding Bridges. 269-272 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#TsinC83 2003-11-20 A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane. 177-180 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#BartholdiP83 2003-11-20 Hypercube Permutations Routable Under all Dimension Orderings. 185-189 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Panaite96 http://dx.doi.org/10.1016/0020-0190(96)00109-3 2003-11-20 Knapsack Problems for NL. 169-174 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Jenner95 http://dx.doi.org/10.1016/0020-0190(95)00017-7 2003-11-20 Mapping a Functional Notation for Parallel Programs Onto Hypercubes. 153-158 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Kornerup95 http://dx.doi.org/10.1016/0020-0190(94)00213-I 2003-11-20 Odd-Even Sort in Powerlists. 15-24 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Kornerup97 http://dx.doi.org/10.1016/S0020-0190(96)00192-5 2003-11-20 A Note on Precedence Functions. 99-100 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#KrishnamurthyC76 2003-11-20 Scheduling Jobs with Varying Processing Times. 175-178 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#GawiejnowiczP95 http://dx.doi.org/10.1016/0020-0190(95)00009-2 2003-11-20 A minimal property for characterizing deadlock-free programs. 283-290 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#CholviB01 http://dx.doi.org/10.1016/S0020-0190(00)00158-7 2003-11-20 An Existence Lemma for Canonical Forms in Symbolic Mathematics. 45-46 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#CavinessPR71 2003-11-20 Worst-case analysis of Weber's GCD algorithm. 125-130 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#LavaultS99 http://dx.doi.org/10.1016/S0020-0190(99)00143-X 2003-11-20 Average Efficiency of Data Structures for Binary Image Processing. 89-93 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#MathieuPY87 2004-08-23 A note on optimal covering augmentation for graphic polymatroids. 285-290 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#PatkarN01 http://dx.doi.org/10.1016/S0020-0190(01)00140-5 2003-11-20 On the Area of Binary Tree Layouts. 46-48 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#BrentK80 2003-11-20 A simple proof technique for priority-scheduled systems. 63-70 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#AndersonMR01 http://dx.doi.org/10.1016/S0020-0190(00)00193-9 2003-11-20 There is no optimal routing policy for the torus. 331-336 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Schwiebert02 http://dx.doi.org/10.1016/S0020-0190(02)00217-X 2003-11-20 Inevitability in Concurrent Systems. 221-225 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Ochmanski87 2003-11-24 Comparison of various trees for nearest-point search with/without the Voronoi diagram. 17-22 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00221-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#KandaS02 2003-11-20 On Pattern Occurrences in a Random Text. 307-312 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#FudosPS96 http://dx.doi.org/10.1016/0020-0190(96)00022-1 2003-11-20 Increasing the Rate of Output of m-Sequences. 73-77 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Blackburn94 2003-11-20 Notes on Avoiding "go to" Statements. 23-31 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#KnuthF71 2003-11-20 Errata: Notes on Avoiding "go to" Statements. 177 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#KnuthF72 2003-11-20 An Experiment in Optimal Sorting. 173-176 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#KnuthK72 2003-11-20 A Structured Program to Generate all Topological Sorting Arrangements. 153-157 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#KnuthS74 2003-11-20 Approximating Optimally Discrete Probability Distribution with kth-Order Dependency for Combining Multiple Decisions. 67-75 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#KangKK97 http://dx.doi.org/10.1016/S0020-0190(97)00039-2 2003-11-20 Efficient Special Cases of Pattern Matching with Swaps. 125-132 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#AmirLLL98 http://dx.doi.org/10.1016/S0020-0190(98)00151-3 2003-11-20 A Result Relating Disjunctive Self-Reducibility to P-Immunity. 239-242 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Kamper90 2003-11-20 A Polynomial Algorithm for b-Matchings: An Alternative Approach. 153-157 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Anstee87 2003-11-20 Counting the Number of Fault Patterns in Redundant VLSI Arrays. 337-342 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#PagliP94 2003-11-20 Efficient Determination of the Transitive Closure of a Directed Graph. 56-58 1971 1 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Munro71 2003-11-20 Honeycomb tori are Hamiltonian. 99-103 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#MegsonYL99 http://dx.doi.org/10.1016/S0020-0190(99)00141-6 2003-11-20 Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive. 33-36 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#KulasingheB95 http://dx.doi.org/10.1016/0020-0190(94)00167-W 2003-11-20 A Still Better Performance Guarantee for Approximate Graph Coloring. 19-23 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Halldorsson93 2003-11-20 An Algebraic Characterization of Semantic Independence. 291-296 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Stengel91 2003-11-20 Inter-Protocol Interleaving Attacks on Some Authentication and Key Distribution Protocols. 297-302 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#TzengH99 http://dx.doi.org/10.1016/S0020-0190(99)00023-X 2003-11-20 Impossible futures and determinism. 51-58 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#VoorhoeveM01 http://dx.doi.org/10.1016/S0020-0190(01)00217-4 2003-11-20 In-situ Inversion of a Cyclic Permutation. 11-14 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#FeijenGG87 2003-11-20 An Assertional Proof of Rana's Algorithm. 227-233 1994 49 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#WezelT94 2003-11-25 From a simple elimination ordering to a strong elimination ordering in linear time. 299-302 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00228-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#SawadaS03 2003-11-20 Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. 241-245 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#GoldbergP87 2003-11-20 A Note on Self-Modifying Finite Automata. 19-24 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#WangIIO99 http://dx.doi.org/10.1016/S0020-0190(99)00127-1 2003-11-20 A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. 265-271 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#GoldbergT89 2003-11-20 Mapping a Chain Task to Chained Processors. 141-148 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#HanNC92 2003-11-20 On 2-QBF Truth Testing in Parallel. 89-93 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#AspvallLLS96 http://dx.doi.org/10.1016/0020-0190(95)00180-8 2003-11-20 Linear Expected Time of a Simple Union-Find Algorithm. 146-148 1976 5 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#DoyleR76 2003-11-20 Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. 105-110 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#KannLP96 http://dx.doi.org/10.1016/0020-0190(96)00046-4 2003-11-20 <i>k</i>-Cut with Subgraph Guarantee. 145-150 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#KannLP98 http://dx.doi.org/10.1016/S0020-0190(98)00005-2 2003-11-20 Characterizations of Some Rescaling Functions. 127-132 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Aguilar-MartinA88 2003-11-20 An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems. 27-33 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#HowellRY87 2003-11-20 Topological Properties of the Directional Hypercube. 277-286 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Hamdi95 http://dx.doi.org/10.1016/0020-0190(94)00207-F 2003-11-20 On Efficient Parallel Strong Orientation. 235-240 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Vishkin85 2003-11-20 On the Relative Complexity of Some Languages in NC. 251-256 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#BarringtonC89 2003-11-20 Succinct Iterative Characterizations of Primitive Computable Unary Functions. 315-319 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Mazzanti95 http://dx.doi.org/10.1016/0020-0190(95)00167-0 2003-11-20 A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space. 285-288 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#InoueITY93 2003-11-20 Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. 73-76 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Saxena94 2003-11-20 Iterative Deepening Multiobjective A. 11-15 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#HarikumarK96 http://dx.doi.org/10.1016/0020-0190(96)00009-9 2003-11-20 Optimal Fault-Tolerant Distributed Construction of a Spanning Forest. 299-307 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Kutten88 2003-11-24 A residualizing semantics for the partial evaluation of functional logic programs. 19-25 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00336-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#AlbertHV03 2003-11-20 A Combined BIT and TIMESTAMP Algorithm for the List Update Problem. 135-139 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#AlbersSW95 http://dx.doi.org/10.1016/0020-0190(95)00142-Y 2003-11-20 A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. 253-257 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#CorneilOS95 http://dx.doi.org/10.1016/0020-0190(95)00021-4 2003-11-20 Analyzing variants of Shellsort. 223-227 2001 79 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Brejova01 http://dx.doi.org/10.1016/S0020-0190(00)00223-4 2003-11-20 A Notation for Distributed Operations. 19-21 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Berztiss87 2003-11-20 Complexity and Dimension. 209-212 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#CuckerKM97 http://dx.doi.org/10.1016/S0020-0190(97)00060-4 2003-11-20 Two Results on Process Logic. 195-198 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Harel79 2003-11-20 Scanning List Structures Without Stacks or Tag Bits. 47-51 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Lindstrom73 2003-11-20 Asymptotic Evaluation of Window Visibility. 119-126 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#MatsuokaKK89 2003-11-20 An Efficient Probabilistic Encryption Scheme. 123-129 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#HarnK90 2003-11-25 A note on the greedy algorithm for the unsplittable flow problem. 101-105 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00351-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Kolman03 2003-11-20 A Simple Optimal Algorithm for Scheduling Variable-Sized Requests. 291-293 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Harms98 http://dx.doi.org/10.1016/S0020-0190(98)00177-X 2003-11-20 Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals. 11-12 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Kantabutra83 2003-11-20 Sequential iteration of the Erlang fixed-point equations. 319-325 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#HartM02 http://dx.doi.org/10.1016/S0020-0190(01)00238-1 2003-11-20 Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. 45-50 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#RheeLDL94 2003-11-20 Insecurity of Set Controls for Statistical Databases. 67-71 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Schlorer84 2003-11-20 On a Relation Between Algebraic Programs and Turing Machines. 180-183 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#SteckelbergS77 2005-05-17 An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. 277-282 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#GuaianaMPW98 http://dx.doi.org/10.1016/S0020-0190(98)00123-9 2003-11-20 Separating Collections of Points in Euclidean Spaces. 177-183 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#BolandU95 http://dx.doi.org/10.1016/0020-0190(94)00186-3 2003-11-20 A new bound for map labeling with uniform circle pairs. 47-53 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#SpriggsK02 http://dx.doi.org/10.1016/S0020-0190(01)00184-3 2003-11-20 A New Formalism for Relational Algebra. 163-168 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#LarsenSS92 2003-11-20 Embedding Ternary Trees in VLSI Arrays. 187-191 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#PinterW87 2003-11-20 Efficient Dynamic Range Searching Using Data Replication. 97-105 1998 68 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#KanthS98 http://dx.doi.org/10.1016/S0020-0190(98)00128-8 2003-11-20 Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes. 37-41 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Johannsen98 http://dx.doi.org/10.1016/S0020-0190(98)00079-9 2003-11-20 Another Representation of Binary Tree Traversal. 52-54 1973 2 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Adams73 2003-11-20 On Immunity Against Biham and Shamir's ``Differential Cryptanalysis''. 77-80 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Adams92 2003-11-20 Data Sufficiency for Queries on Cache. 209-216 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ShmueliS98 http://dx.doi.org/10.1016/S0020-0190(97)00205-6 2003-11-20 Generalized Division for Relational Algebraic Language. 174-178 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Demolombe82 2003-11-20 An Experiment With the Use of Predicate Transformers in UNITY. 329-332 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Dijkstra95a http://dx.doi.org/10.1016/0020-0190(94)00215-K 2003-11-20 An Introduction to Three Algorithms for Sorting in Situ. 129-134 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#DijkstraG82 2003-11-20 Termination Detection for Diffusing Computations. 1-4 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#DijkstraS80 2003-11-25 Optimal one-page tree embeddings in linear time. 59-66 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00261-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HochbergS03 2003-11-20 An algorithm for finding a k-median in a directed tree. 81-88 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#VigneronGGIL00 http://dx.doi.org/10.1016/S0020-0190(00)00026-0 2003-11-20 The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. 215-218 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#MurphyS86 2003-11-20 Finding Nearest Neighbors with Voronoi Tessellations. 37-41 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#MurphyS90 2003-11-20 On-Line Versus Off-Line Computation in Dynamic Text Compression. 169-174 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#AgostinoS96 http://dx.doi.org/10.1016/0020-0190(96)00068-3 2003-11-25 Tighter constant-factor time hierarchies. 39-44 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00253-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Ben-Amram03 2003-11-20 A Circuit for Exact Summation of Floating-Points Numbers. 159-163 1996 57 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#MullerRR96 http://dx.doi.org/10.1016/0020-0190(95)00205-7 2003-11-20 Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time. 68-69 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#GriesL80 2003-11-20 Equational Propositional Logic. 145-152 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#GriesS95 http://dx.doi.org/10.1016/0020-0190(94)00198-8 2003-11-20 Symmetric Quotients and Domain Constructions. 163-168 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#BerghammerSZ89 2003-11-20 On Verification of Programs With Goto Statements. 221-225 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Lifschitz84 2003-11-20 A Switching Algorithm for the Solution of Quadratic Boolean Equations. 193-198 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#PetreschiS80 2003-11-20 Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. 65 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#PetreschiS95 http://dx.doi.org/10.1016/0020-0190(95)00143-Z 2003-11-20 Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors. 21-29 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#RobertTV89 2003-11-20 Insertion-Safeness in Balanced Trees. 259-264 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#KriegelK83 2003-11-20 Evading the Drift in Floating-Point Addition. 84-87 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#ReiserK75 2003-11-20 A Sperner lemma complete for PPA. 255-259 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Grigni01 http://dx.doi.org/10.1016/S0020-0190(00)00152-6 2003-11-24 A combinatorial algorithm for MAX CSP. 307-315 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00435-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#DatarFGMP03 2003-11-20 A Fast Parallel Quicksort Algorithm. 97-102 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#MartelG89 2003-11-20 On Lookahead in the List Update Problem. 105-110 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#SimhaM94 2003-11-20 Exact Primitives for Smallest Enclosing Ellipses. 33-38 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#GartnerS98 http://dx.doi.org/10.1016/S0020-0190(98)00132-X 2003-11-20 Complexity of Finding k-Path-Free Dominating Sets in Graphs. 228-232 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Bar-YehudaV82 2003-11-20 Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence. 224-229 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#BroyWFQR79 2003-11-20 Distributed User Identification by Zero-Knowledge Access Rights Proving. 235-239 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Domingo-Ferrer91 2003-11-20 On the linear complexity of the sequences generated by nonlinear filterings. 67-73 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Garcia-VillalbaF00 http://dx.doi.org/10.1016/S0020-0190(00)00117-4 2003-11-20 <i>m</i>-Sequences. 227-232 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Garcia-VillalbaF99 http://dx.doi.org/10.1016/S0020-0190(99)00021-6 2003-11-20 The Critical Complexity of Graph Properties. 151-153 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Turan84 2003-11-20 Lower Bounds for Synchronous Circuits and Planar Circuits. 37-40 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Turan89 2003-11-20 Fixed-Radius Near Neighbors Search. 201-203 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Turau91 2003-11-24 Optimal 1-edge fault-tolerant designs for ladders. 87-92 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00225-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#ChuangHC02 2003-11-20 Solving a system of difference constraints with variables restricted to a finite set. 143-144 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Fishburn02 http://dx.doi.org/10.1016/S0020-0190(01)00267-8 2003-11-20 An Improved Fixed-Parameter Algorithm for Vertex Cover. 163-168 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#BalasubramanianFR98 http://dx.doi.org/10.1016/S0020-0190(97)00213-5 2003-11-20 Fair Mutual Exclusion with Unfair P and V Operations. 97-100 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#MartinB85 2003-11-20 On the semantics of nested datatypes. 233-238 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#MartinG01 http://dx.doi.org/10.1016/S0020-0190(01)00168-5 2003-11-20 Combinatorial Lower Bounds for Secret Sharing Schemes. 301-304 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#KurosawaO96 http://dx.doi.org/10.1016/S0020-0190(96)00178-0 2003-11-20 A Presentation of the Fibonacci Algorithm. 67-68 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#MartinR84 2003-11-20 The Equivalence of Vector Addition Systems to a Subclass of Post Canonical Systems. 201-204 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Hughes78 2003-11-20 A Novel Representation of Lists and its Application to the Function "reverse". 141-144 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Hughes86 2003-11-20 Isomorphism Testing of k-Trees is in NC, for Fixed k. 283-287 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Chandrasekharan90 2003-11-20 An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications. 31-35 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Collette94 2003-11-20 A Comment on the `Basic Security Theorem' of Bell and LaPadula. 67-70 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#McLean85 2003-11-20 Short Note on a Heuristic Search Strategy in Long-Term Memory Networks. 191-196 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Findler72 2003-11-25 Why software writing is difficult and will remain so. 13-25 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00384-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Jackson03 2003-11-20 Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order. 15-18 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Gobel00 http://dx.doi.org/10.1016/S0020-0190(00)00031-4 2003-11-20 A Rewriting Technique for Universal Polynomial Invariants. 271-273 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Gobel99 http://dx.doi.org/10.1016/S0020-0190(99)00028-9 2003-11-20 A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. 161-167 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#AardalCS99 http://dx.doi.org/10.1016/S0020-0190(99)00144-1 2003-11-20 An Implementation of P and V. 196-198 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#HehnerS81 2004-10-14 Lower Bounds for Line Stabbing. 59-62 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#AvisRW89 2003-11-20 Parallel Lossless Image Compression Using Huffman and Arithmetic Coding. 65-73 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#HowardV96 http://dx.doi.org/10.1016/0020-0190(96)00090-7 2003-11-20 Recognizable Subsets of the Two Letter Plactic Monoid. 53-59 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#ArnoldKK97 http://dx.doi.org/10.1016/S0020-0190(97)00157-9 2003-11-20 The Latency-of-Data-Access Model for Analyzing Parallel Computation. 255-261 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#SimonW98 http://dx.doi.org/10.1016/S0020-0190(98)00062-3 2003-11-20 Negation-Limited Circuit Complexity of Symmetric Functions. 273-279 1996 59 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#TanakaNB96 http://dx.doi.org/10.1016/0020-0190(96)00115-9 2004-12-10 Computing the cycles in the perfect shuffle permutation. 217-224 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#EllisKF00 http://dx.doi.org/10.1016/S0020-0190(00)00103-4 2003-11-20 A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs. 199-204 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#EllisMM89 2003-11-20 s-partitions. 327-329 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#GohHS02 http://dx.doi.org/10.1016/S0020-0190(01)00300-3 2003-11-20 On edge-disjoint spanning trees with small depths. 71-74 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Hasunuma00 http://dx.doi.org/10.1016/S0020-0190(00)00078-8 2003-11-20 Prespecification in Data Refinement. 71-76 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#HoareHS87 2003-11-20 Approximation algorithms for time-dependent orienteering. 57-62 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#FominL02 http://dx.doi.org/10.1016/S0020-0190(01)00313-1 2003-11-20 Improved Linear Systolic Algorithms for Substring Statistics. 253-258 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#MyoupoW97 http://dx.doi.org/10.1016/S0020-0190(97)00025-2 2003-11-20 The Lower Bounds on Distributed Shortest Paths. 145-149 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#RamaraoV93 2003-11-20 Range-Restricted Mergeable Priority Queues. 159-164 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Bright93 2003-11-20 Expected Connectivity and Leader Election in Unreliable Networks. 283-285 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Singh92a 2003-11-20 Sequence retrieval from genomic databases. 25-32 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#SinghL01 http://dx.doi.org/10.1016/S0020-0190(00)00169-1 2003-11-20 Optimal Parallel Construction of Heaps. 159-161 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Khoong93 2003-11-20 Address Calculation Algorithms for Ordered Sets of Combinations. 251-253 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#NishiharaI83 2003-11-20 A Rationale for the Numerical Differentiation of Experimental Data. 48-50 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#AnderssenG75 2003-11-20 An Applicative Random-Access Stack. 241-248 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Myers83 2003-11-20 Approximately Matching Context-Free Languages. 85-92 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Myers95 http://dx.doi.org/10.1016/0020-0190(95)00007-Y 2003-11-20 A probabilistic cryptanalytic method for a time-variant permutation generator. 67-73 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Golic01 http://dx.doi.org/10.1016/S0020-0190(01)00146-6 2003-11-20 Stream Cipher Encryption of Random Access Files. 145-148 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Golic99 http://dx.doi.org/10.1016/S0020-0190(99)00004-6 2003-11-20 On Uniform Learnability of Language Families. 35-38 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#KapurB92 2003-11-20 Worst-Case Choice for the Stable Marriage Problem. 27-30 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#KapurK85 2003-11-20 Covering a Set with Arithmetic Progressions is NP-Complete. 293-298 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Heath90 2003-11-20 The Liveness Property of On-the-Fly Garbage Collector - A Proof. 189-195 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#RameshM83 2003-11-20 Information Concepts and Pairwise Comparison Matrices. 185-188 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#SanchezS98 http://dx.doi.org/10.1016/S0020-0190(98)00161-6 2003-11-20 The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound. 43-46 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#PurdyP90 2003-11-20 On the Solution of Polynomial Equations Using Continued Fractions. 182-184 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Akritas79 2003-11-20 Weighted Grammars and Kleene's Theorem. 1-4 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#AlexandrakisB87 2003-11-20 Fault Tolerance of the Star Graph Interconnection Network. 145-150 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#JovanovicM94 2003-11-20 Routing on Trees. 215-223 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Symvonis96 http://dx.doi.org/10.1016/0020-0190(95)00208-1 2003-11-20 A Note on Deflection Worm Routing on Meshes. 235-239 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Symvonis99 http://dx.doi.org/10.1016/S0020-0190(99)00105-2 2003-11-20 Note on a Modification of the Fundamental Cycles Finding Algorithm. 33 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Jovanovich74 2003-11-20 A Note on Specifying and Verifying Concurrent Processes. 77-85 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Holenderski84 2003-11-20 The Correctness of Nondeterministic Programs Revisited. 299-303 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Holenderski86 2003-11-20 Counting Trees in a Graph is #P-Complete. 111-116 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Jerrum94 2003-11-20 From Left-Regular to Greibach Normal Form Grammars. 51-55 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Nijholt79 2003-11-20 A Note on the Sufficiency of Sokolowski's Criterion for Context-Free Languages. 207 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Nijholt82 2003-11-20 Construction of a Tree From its Traversals in Optimal Time and Space. 21-25 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#AnderssonC90 2003-11-20 Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. 305-311 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#AnderssonE98 http://dx.doi.org/10.1016/S0020-0190(98)00021-0 2003-11-20 Improved Behaviour of Tries by Adaptive Branching. 295-300 1993 46 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#AnderssonN93 2003-11-20 An Error-Correcting Coding Scheme for Alphanumeric Data. 72-77 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#SethiRK78 2003-11-20 The Decision Problem for Database Dependencies. 251-254 1981 12 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Vardi81 2003-11-20 A Note on Lossless Database Decompositions. 257-260 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Vardi84 2003-11-20 A Note on the Reduction of Two-Way Automata to One-Way Automata. 261-264 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Vardi89 2003-11-20 Endmarkers can Make a Difference. 145-148 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Vardi90 2003-11-20 Rotation-Based Computations for Ray-Tracing Second-Order Surfaces and Curves. 281-283 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#KocsisB90 2003-11-20 Infinite Cube-Connected Cycles. 1-2 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Heide83 2003-11-20 Extending Reduction Orderings to ACU-Compatible Reduction Orderings. 43-49 1998 67 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Waldmann98 http://dx.doi.org/10.1016/S0020-0190(98)00084-2 2003-11-20 Fault-Tolerant Routing in Unique-Path Multistage Interconnection Networks. 197-201 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Varma89 2003-11-20 Another Solution of the Mutual Exclusion Problem. 145-146 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#KowaltowskiP84 2003-11-20 Elements of security: Closure, convergence, and protection. 109-114 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Gouda01 http://dx.doi.org/10.1016/S0020-0190(00)00207-6 2003-11-20 Stabilizing Observers. 99-103 1994 52 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Gouda94 2003-11-20 The Benefits of External Wires in Single Row Routing. 43-49 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#BlairL91 2003-11-20 The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network. 157-161 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#CheriyanM89 2003-11-20 An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. 239-242 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#CheriyanM99 http://dx.doi.org/10.1016/S0020-0190(99)00019-8 2004-12-07 A linear algorithm for the Hamiltonian completion number of the line graph of a tree. 17-24 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#AgnetisDMP01 http://dx.doi.org/10.1016/S0020-0190(00)00164-2 2003-11-20 An Approach for Data Type Specification and Its Use in Program Verification. 98-103 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#PequenoL79 2003-11-24 Parallel prefix computation on extended multi-mesh network. 295-303 2002 84 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00317-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#JanaNKAS02 2003-11-20 Transistion Systems from Event Structures Revisited. 119-124 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Majster-CederbaumR98 http://dx.doi.org/10.1016/S0020-0190(98)00105-7 2003-11-20 Min of Mat is not Necessarily Mat. 175-177 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#DassowP99 http://dx.doi.org/10.1016/S0020-0190(99)00114-3 2003-11-20 On Generalized Matching Problems. 33-35 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#HellK81 2003-11-20 On a Semaphore Anomaly. 88-89 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Trivedi76 2003-11-20 Unfold/fold Transformations for Disjunctive Logic Programs. 23-29 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Gergatsoulis97 http://dx.doi.org/10.1016/S0020-0190(97)00038-0 2003-11-20 The Depth of Monotone Functions in Multivalued Logic. 176-177 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Henno79 2003-11-20 On the Domatic Number of Interval Graphs. 275-280 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Bertossi88a 2003-11-20 Primitive Morphisms. 277-281 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Mitrana97 http://dx.doi.org/10.1016/S0020-0190(97)00178-6 2003-11-20 Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. 3-6 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#BertossiB83 2003-11-20 Hamiltonian Circuits in Interval Graph Generalizations. 195-200 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#BertossiB86 2003-11-20 Parallel Algorithms on Circular-Arc Graphs. 275-281 1990 33 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#BertossiM90 2005-03-15 Expected-Time Complexity Results for Hierarchic Clustering Algorithms Which Use Cluster Centres. 237-241 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Murtagh83 2003-11-20 A Note on Terminal Balancing of Algebraic Systems. 291-293 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Karner90 2003-11-20 Automatic Generation of Lexical Analyzers in a Compiler-Compiler. 165-168 1976 4 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#KrzemienL76 2003-11-20 There are no p-Complete Families of Symmetric Boolean Functions. 47-49 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Gereb-GrausPS89 2003-11-20 On a game in directed graphs. 13-16 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#HoffmanJR02 http://dx.doi.org/10.1016/S0020-0190(01)00309-X 2003-11-20 Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations. 83-86 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Vitanyi80 2003-11-20 Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit. 87-91 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Vitanyi85 2003-11-20 Two Results on Tables. 43-48 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#JacobsB86 2003-11-20 An Approximate Analysis of the Performance of Extendible Hashing with Elastic Buckets. 13-20 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Hachem93 2003-11-25 Right-arm rotation distance between binary trees. 173-177 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00283-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Pallo03a 2003-11-20 On Reductions to Sets that Avoid EXPSPACE. 109-114 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#ArvindKM95 http://dx.doi.org/10.1016/0020-0190(95)00138-3 2003-11-20 A Note on the Completeness of Resolution with Self-Resolution. 323-326 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Eisinger89 2003-11-20 On the Complexity of Computing Gröbner Bases in Characteristic 2. 321-323 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Acciaro94 2003-11-20 Compressibility and Uniform Complexity. 259-264 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Hermo97 http://dx.doi.org/10.1016/S0020-0190(97)00070-7 2003-11-24 Computing small partial coverings. 327-331 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00434-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Blaser03 2003-11-20 Positive Boolean Dependencies. 147-150 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#BermanB88 2003-11-20 On Matijasevitch's Nontraditional Approach to Search Problems. 41-45 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#BlassG89 2003-11-20 On the Number of Edges in Cycletrees. 225-229 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#VeanesB96 http://dx.doi.org/10.1016/0020-0190(95)00183-2 2003-11-25 Alternating paths through disjoint line segments. 287-294 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00349-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HoffmannT03 2003-11-20 Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor Failures. 323-328 1990 34 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#SenguptaB90 2003-11-20 On Fault-Tolerant Fixed Routing in Hypercubes. 93-99 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#SenguptaV94 2003-11-20 A Shortest-Path Algorithm for Manhattan Graphs. 21-25 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Kanchanasut94 2003-11-25 Data replication in static tree structures. 197-202 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00503-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#HambruschL03 2003-11-20 Parallel Asynchronous Connected Components in a Mesh. 257-263 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#HambruschL91 2003-11-20 Byzantine quorum systems with maximum availability. 71-77 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#TsuchiyaK02 http://dx.doi.org/10.1016/S0020-0190(01)00311-8 2003-11-20 Hidden Line Elimination for Isooriented Rectangels. 137-143 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#MehlhornNU90 2003-11-20 Sparse Dominance Queries for Many Points in Optimal Time and Space. 287-291 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#GrafK97 http://dx.doi.org/10.1016/S0020-0190(97)00181-6 2003-11-20 Path Integral Methods for Computer Performance Analysis. 7-13 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Gunther89 2003-11-20 High Density Graphs for Processor Interconnection. 117-120 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#LelandFQSU81 2003-11-20 The Practical Significance of Distributive Partitioning Sort. 168-169 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#HuitsK79 2003-11-20 A Versatile Divide and Conquer Technique for Optimal String Alignment. 127-139 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#PowellAD99 http://dx.doi.org/10.1016/S0020-0190(99)00053-8 2003-11-20 Null Values in a Relational Data Base. 156-157 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Grant77 2003-11-20 Partial Values in a Tabular Database Model. 97-99 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Grant79 2003-11-20 Maximum Network Flow with Floating Point Arithmetic. 109-113 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#AlthausM98 http://dx.doi.org/10.1016/S0020-0190(98)00043-X 2003-11-20 Safety Analysis Versus Type Inference for Partial Types. 175-180 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#PalsbergS92 2003-11-20 Multiple Search Problen on Reconfigurable Meshes. 65-69 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#ChaoCC96 http://dx.doi.org/10.1016/0020-0190(96)00033-6 2003-11-24 An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs. 311-316 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#ChaoHL97 http://dx.doi.org/10.1016/S0020-0190(97)00009-4 2003-11-20 One Unary Function Says Less Than Two in Existential Second Order Logic. 69-75 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Loescher97 http://dx.doi.org/10.1016/S0020-0190(96)00198-6 2003-11-20 Concurrency in a Language Employing Messages. 59-62 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Harland81 2003-11-20 Levelling Terrain Trees: A Transshipment Problem. 189-192 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Farley80 2003-11-24 On the existence and construction of non-extreme (a, b)-trees. 69-73 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00228-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#JacobsenLN02 2003-11-20 Safety and Liveness From a Methodological Point of View. 25-30 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#DederichsW90 2003-11-20 Reply to the Comments by Martín Abadi et al. 143 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#DederichsW91 2003-11-24 Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. 39-46 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00344-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#ChavezN03 2003-11-20 The Complexity of Finding Fixed-Radius Near Neighbors. 209-212 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#BentleySW77 2003-11-20 An Efficient Transitive Closure Algorithm for Cyclic Digraphs. 207-213 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Nuutila94 2003-11-20 Corrigendum to "The path-partition problem in block graphs". 293 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Chang02a http://dx.doi.org/10.1016/S0020-0190(02)00320-4 2003-11-20 Analysis of the Pope-Stein Division Algorithm. 151-155 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#CollinsM77 2003-11-20 Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids. 317-319 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#CollinsM98 http://dx.doi.org/10.1016/S0020-0190(98)00178-1 2003-11-20 Introduction to Design Choices in the Semantics of Statecharts. 205-213 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#HuizingR91 2003-11-20 Kleene's Logic with Equality. 131-137 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#NielsonNS01 http://dx.doi.org/10.1016/S0020-0190(01)00155-7 2003-11-20 A generalized grid quorum strategy for k-mutual exclusion in distributed systems. 205-212 2001 80 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#ChangC01 http://dx.doi.org/10.1016/S0020-0190(01)00164-8 2003-11-24 An efficient protocol for anonymous multicast and reception. 99-103 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00352-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#ChangC03 2003-11-20 An Ordered Minimal Perfect Hashing Scheme with Single Parameter. 79-83 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#ChangC88 2003-11-20 Fault-Tolerant Routing in Unique-Path Multistage Omega Network. 201-204 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#ChangC92 2003-11-20 Embedding Cycles in IEH Graphs. 23-27 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#ChangC97 http://dx.doi.org/10.1016/S0020-0190(97)00147-6 2003-11-20 Diamond Deque: A Simple Data Structure for Priority Deques. 231-237 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ChangD93 2003-11-20 On the Minimum Requirements for Independent Recovery in Distributed Systems. 1-7 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#ChangG91 2003-11-20 Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. 55-59 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#ChangH95 http://dx.doi.org/10.1016/0020-0190(94)00173-V 2003-11-20 A Simple Approach for Generating RSA Keys. 19-21 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#ChangH97 http://dx.doi.org/10.1016/S0020-0190(97)00089-6 2003-11-20 The Recognition of Geodetically Connected Graphs. 81-88 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ChangH98 http://dx.doi.org/10.1016/S0020-0190(97)00201-9 2003-11-20 Finding a Maximum Set of Independent Chords in a Circle. 99-102 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#ChangL92 2003-11-20 Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs. 205-210 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#ChangL93 2003-11-20 The Minimum Labeling Spanning Trees. 277-282 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#ChangL97 http://dx.doi.org/10.1016/S0020-0190(97)00127-0 2003-11-20 Extended Conditions for Answering an Aggregate Query Using Materialized Views. 205-212 1999 72 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#ChangL99 http://dx.doi.org/10.1016/S0020-0190(99)00147-7 2003-11-20 Embeddings and the Trace of Finite Sets. 199-203 1998 67 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Greco98 http://dx.doi.org/10.1016/S0020-0190(98)00111-2 2003-11-20 Exact solution of a minimal recurrence. 61-64 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#ChangT00 http://dx.doi.org/10.1016/S0020-0190(00)00076-4 2003-11-20 Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs. 293-295 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#ChangW92 2003-11-20 Message Complexity of Hierarchical Quorum Consensus Algorithm. 69-73 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#ChangY94 2003-11-20 A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. 155-157 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#ChangY95 http://dx.doi.org/10.1016/0020-0190(95)00093-R 2003-11-20 Efficient Access Methods for Image Databases. 95-105 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#ChangY97 http://dx.doi.org/10.1016/S0020-0190(97)00151-8 2003-11-20 A Parallel Algorithm for Circulant Tridiagonal Linear Systems. 331-337 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ChangY98 http://dx.doi.org/10.1016/S0020-0190(98)00018-0 2003-11-20 An Oracle Separating \oplus P from PP^PH. 149-153 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Green91 2003-11-20 An Experiment in Formal Definition of Operating System Facilities. 187-189 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Madsen77 2003-11-20 The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. 141-148 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#DeinekoDR94 2003-11-20 A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons. 207-209 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Atallah83 2003-11-20 Parallel Strong Orientation of an Undirected Graph. 37-39 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Atallah84 2003-11-20 Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly. 77-83 1994 49 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#GemmellH94 2003-11-20 Highly Resilient Correctors for Polynomials. 169-174 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#GemmellS92 2003-11-20 Scheduling Periodically Occurring Tasks on Multiple Processors. 9-12 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#LawlerM81 2003-11-20 An Algorithm for ``Ulam's Game'' and its Application to Error Correcting Codes. 89-93 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#LawlerS95 http://dx.doi.org/10.1016/0020-0190(95)00127-X 2003-11-20 On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems. 142-145 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#BertoniM81 2003-11-20 A 4n-Lower Bound on the Monotone Network Complexity of a One-Output Boolean Function. 201-202 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Tiekenheinrich84 2003-11-20 A Note on the Complexity of Algebraic Differentiation. 122-124 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#CavinessE78 2003-11-20 On Path Equivalence of Nondeterministic Finite Automata. 43-46 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Tzeng96 http://dx.doi.org/10.1016/0020-0190(96)00039-7 2003-11-20 Common Modulus and Chosen-Message Attacks on Public-Key Schemes with Linear Recurrence Relations. 153-156 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Tzeng99 http://dx.doi.org/10.1016/S0020-0190(99)00055-1 2003-11-20 A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space. 225-227 1992 43 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#InoueIT92 2003-11-25 Modeling virtual worlds in databases. 67-72 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00381-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#WalczakC03 2003-11-25 A linear time recognition algorithm for proper interval graphs. 153-161 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00298-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#PandaD03 2003-11-20 Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. 139-143 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#PandaM94 2003-11-20 A Note on Bottom-Up Pyramid Acceptors. 34-37 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#InoueT79a 2003-11-20 Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs. 225-230 1993 46 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#MullerN93 2003-11-20 A Note on Two-Dimensional Finite Automata. 49-52 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#InoueTN78 2003-11-20 An Optimal Algorithm for Finding Compact Sets. 285-289 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#DekelHO92 2003-11-20 A Note on Alternating On-Line Turing Machines. 164-168 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#InoueTT82 2003-11-20 Programming by Induction. 100-107 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Gries72 2003-11-20 A Note on Graham's Convex Hull Algorithm. 323-328 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Gries87 2003-11-20 A Probabilistic Analysis of an Error-Correcting Algorithm for the Towers of Hanoi Puzzle. 99-103 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#ScarioniS84 2003-11-20 Increasing the Orders of Equidistribution of the Leading Bits of the Tausworthe Sequence. 189-192 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Fushimi83 2003-11-20 Searching for Segments with Largest Relative Overlap. 103-108 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#AurenhammerS92 2003-11-20 On Equivalence of Relational and Network Database Models. 51-54 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Jajodia85 2003-11-20 The Weakest Prespecification. 127-132 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#HoareH87 2003-11-20 <i>Delta</i>+1-coloring of Graphs. 229-232 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Johansson99 http://dx.doi.org/10.1016/S0020-0190(99)00064-2 2003-11-20 Exposure to Deadlock for Communicating Processes is Hard to Detect. 63-68 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#RauchleT85 2003-11-20 Dynamic Program Slicing. 155-163 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#KorelL88 2003-11-20 On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs. 173-177 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Bertossi80 2003-11-20 The Edge Hamiltonian Path Problem is NP-Complete. 157-159 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Bertossi81 2003-11-20 Finding Hamiltonian Circuits in Proper Interval Graphs. 97-101 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Bertossi83 2003-11-20 Dominating Sets for Split and Bipartite Graphs. 37-40 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Bertossi84 2003-11-20 Total Domination in Interval Graphs. 131-134 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Bertossi86 2003-11-20 Parallel Circle-Cover Algorithms. 133-139 1988 27 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Bertossi88 2003-11-24 Finding smooth maps is NP-complete. 249-253 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00429-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Poland03 2003-11-20 Farmer's Theorem revisited. 47-53 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#Veanes00 http://dx.doi.org/10.1016/S0020-0190(00)00029-6 2003-11-20 Cancellation is Exponentially Powerful for Computing the Determinant. 177-181 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Sengupta97 http://dx.doi.org/10.1016/S0020-0190(97)00069-0 2003-11-20 On Ring Embedding in Hypercubes with Faulty Nodes and Links. 207-214 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Sengupta98 http://dx.doi.org/10.1016/S0020-0190(98)00159-8 2003-11-25 Cryptanalysis of the Wu-Varadhrajan fair exchange protocol. 169-171 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00270-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#MarkowitchS03 2003-11-20 Determining the Majority. 253-255 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#AlonsoRS93 2003-11-20 Uniform Generation of a Schröder Tree. 305-308 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#AlonsoRS97 http://dx.doi.org/10.1016/S0020-0190(97)00174-9 2003-11-20 The Convex-Hull-and-k-Line Travelling Salesman Problem. 295-301 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#DeinekoW96 http://dx.doi.org/10.1016/0020-0190(96)00125-1 2003-11-20 Tree pattern matching with a more general notion of occurrence of the pattern. 197-201 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Chauve02 http://dx.doi.org/10.1016/S0020-0190(01)00270-8 2003-11-20 Sorting Numbers Using Limited Systolic Coprocessors. 351-354 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Muller87 2003-11-20 Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting. 293-299 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Muller92 2003-11-20 A Caution on Universal Classes of Hash Functions. 247-256 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Mullin91 2004-01-12 Characterization of idempotent transformation monoids. 163-166 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90226-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Beaudry89a 2004-01-12 Bin packing with restricted piece sizes. 145-149 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90223-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Leung89a 2004-01-12 Asymptotic evaluation of window visibility. 119-126 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90218-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#MatsuokaKK89a 2004-01-12 On the use of random numbers in asynchronous simulation via rollback. 139-144 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90222-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Tsitsiklis89a 2004-01-12 An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs. 129-134 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90220-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ShihH89a 2004-01-12 The parallel complexity of finding a blocking flow in a 3-layer network. 157-161 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90225-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#CheriyanM89a 2004-01-12 Data structures in a real-time environment. 151-155 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90224-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#LentfertO89a 2004-01-12 Comments on "ring based termination detection algorithm for distributed computations". 127-128 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90219-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#TelM89a 2004-01-12 Parallel parsing on the connection machine. 111-117 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90217-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#SkillicornB89a 2004-01-12 Achromatic number is NP-complete for cographs and interval graphs. 135-138 1989 32 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/0020-0190(89)90221-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Bodlaender89a 2004-01-14 On the minimum number of negations leading to super-polynomial savings. 71-74 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Jukna04 2004-01-14 Finding optimal paths in MREP routing. 57-63 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#FleischerGLW04 2004-01-14 Macro forest transducers. 141-149 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#PerstS04 2004-01-14 Compact searchable static binary trees. 49-52 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Durgan04 2004-01-14 The greedy algorithm for domination in graphs of maximum degree 3. 53-56 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Seager04 2004-01-14 Irrelevant updates and self-maintainability in transitive closure database views. 25-29 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#VincentL04 2004-01-14 Labeling points with given rectangles. 115-121 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.09.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#JungC04 2004-01-14 Topological formulation of termination properties of iterates of functions. 31-35 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#GeertsK04 2004-01-14 A note on maximum independent sets in rectangle intersection graphs. 19-23 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Chan04 2004-01-14 Kinetic hanger. 151-157 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#FonsecaFC04 2004-01-14 Epsilon-transitions in Concurrent Timed Automata. 1-7 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#LanotteMT04 2004-01-14 Incremental learning of approximations from positive data. 37-42 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#GrieserL04 2004-01-14 On some properties of the NML estimator for Bernoulli strings. 209-213 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Giurcaneanu04 2004-01-14 On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham. 111-114 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Hess04 2004-01-14 List edge multicoloring in graphs with few cycles. 85-90 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.09.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Marx04 2004-01-14 _ⁿand the discrete planar two-watchtower problem. 137-139 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Ben-MosheCK04 2004-01-14 Probabilistic weak simulation is decidable in polynomial time. 123-130 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#BaierHK04 2004-01-14 Minimum cuts, girth and a spectral threshold. 105-110 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Chandran04 2004-01-14 A characterization of s-languages. 65-70 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#FraczakP04 2004-01-14 Strong and NV-sequentiality of constructor systems. 191-201 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Lucas04 2004-01-14 Cliques, holes and the vertex coloring polytope. 159-164 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#CampeloCF04 2004-01-14 Optimal algorithm for a special point-labeling problem. 91-98 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#RoyGDN04 2004-01-14 Tumble, a fast simple iteration algorithm for Fibonacci. 187-189 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Johnson04 2004-01-14 Feedback vertex sets in star graphs. 203-208 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#WangWC04 2004-01-14 On approximation algorithms for the terminal Steiner tree problem. 15-18 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#DrakeH04 2004-01-14 Weak coin flipping with small bias. 131-135 2004 89 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2003.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#KerenidisN04 2004-01-14 _exp[nsube](NP[cap]coNP)/poly. 43-47 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Vinodchandran04 2004-01-14 The minimum likely column cover problem. 175-179 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#CrescenziG04 2004-01-14 The Log-Rank Conjecture and low degree polynomials. 99-103 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.09.020 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Valiant04 2004-01-14 On identifying codes in the hexagonal mesh. 9-14 2004 89 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#HonkalaL04 2004-01-14 Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. 165-173 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#BrandstadtLR04 2004-01-14 Hardness results and approximation algorithms of k-tuple domination in graphs. 75-83 2004 89 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2003.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#KlasingL04 2004-01-14 Partitioning of trees for minimizing height and cardinality. 181-185 2004 89 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#KovacsK04 2004-07-06 Tetris and decidability. 267-272 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#HoogeboomK04 2004-07-06 Ready, Set, Go! The Voronoi diagram of moving points that start from a line. 233-235 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Koltun04 2005-05-06 Joint object placement and node dimensioning for Internet content distribution. 273-279 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#LaoutarisZS04 2004-07-06 Deterministic second-order patterns. 309-314 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#YokoyamaHT04 2004-07-06 The worst-case chip problem. 303-308 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.11.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#AlonsoCRS04 2004-07-06 A linear-time algorithm to compute a MAD tree of an interval graph. 255-259 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#DahlhausDR04 2004-07-06 Modelling and verification of delay-insensitive circuits using CCS and the Concurrency Workbench. 293-296 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#KapoorJ04 2004-07-06 A Kleene theorem for splitable signals. 237-245 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Durand-Lose04 2004-07-06 A completed hierarchy of true concurrent equivalences. 261-265 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Fecher04 2004-07-06 A construction of one-point bases in extended lambda calculi. 281-286 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Goldberg04 2004-07-06 On the hardness of approximating label-cover. 247-254 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#DinurS04 2004-07-06 Universal forgery on a group signature scheme using self-certified public keys. 227-231 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Wang04 2004-07-06 On the profile of the corona of two graphs. 287-292 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#LaiC04 2004-07-06 A simple recognition of maximal planar graphs. 223-226 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#NagamochiSI04 2004-07-06 Approximation algorithms for a hierarchically structured bin packing problem. 215-221 2004 89 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#CodenottiMLMS04 2004-07-06 A 2-approximation NC algorithm for connected vertex cover and tree cover. 59-63 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#FujitoD04 2004-07-06 SPT is optimally competitive for uniprocessor flow. 233-238 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.02.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Bunde04 2004-07-06 Polynomial time quantum computation with advice. 195-204 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#NishimuraY04 2004-07-06 A direct algorithm for restricted rotation distance. 129-134 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Lucas04a 2004-07-06 Cycle detection using a stack. 135-140 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.01.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Nivasch04 2004-10-27 Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks. 73-80 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#AlWehaibiKAE04 2004-07-06 A single-point mutation evolutionary programming. 293-299 2004 90 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#JiTG04 2004-07-06 Efficient automatic discovery of 'hot' itemsets. 65-72 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#KourisMT04 2004-07-06 A limit characterization for the number of spanning trees of graphs. 307-313 2004 90 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#NikolopoulosNR04 2004-07-06 On numerically decipherable codes and their homophonic partitions. 103-108 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.02.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Savelli04 2004-07-06 Generating connected acyclic digraphs uniformly at random. 209-213 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#MelanconP04 2004-07-06 Bipartite structure of all complex networks. 215-221 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.03.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#GuillaumeL04 2004-07-06 Factoring stochastic relations. 161-166 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Doberkat04 2004-07-06 Herbrand theorems in arbitrary institutions. 29-37 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Diaconescu04 2004-07-06 Editorial. 1-2 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Tarlecki04 2004-07-06 A functional correspondence between call-by-need evaluators and lazy abstract machines. 223-232 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.02.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#AgerDM04 2004-07-06 Transforming pseudo-triangulations. 141-145 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.01.021 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Bereg04 2004-07-06 A lower bound for testing juntas. 301-305 2004 90 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.01.023 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#ChocklerG04 2004-07-06 A fixed-parameter tractable algorithm for matrix domination. 267-272 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2002.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Weston04 2004-07-06 Relationships between memory models. 53-58 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#CholviB04 2004-07-06 Undecidable problems of decentralized observation and control on regular languages. 21-28 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Tripakis04 2004-07-06 Efficient processing of subsequence matching with the Euclidean metric in time-series databases. 253-260 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.02.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#KimPL04 2004-07-06 A note on point location in arrangements of hyperplanes. 93-95 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Liu04 2005-06-21 The complexity of deciding stability under FFS in the Adversarial Queueing model. 261-266 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.02.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#AlvarezBDFS04 2004-07-06 A note on 3D orthogonal drawings with direction constrained edges. 97-101 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#GiacomoLP04 2004-07-06 New upper bounds on feedback vertex numbers in butterflies. 279-285 2004 90 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#ChangLL04 2004-07-06 Exhaustive approaches to 2D rectangular perfect packings. 7-14 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#LeshMMM04 2004-07-06 Deterministic SkipNet. 205-208 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.01.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#HarveyM04 2004-07-06 Quantum symmetrically-private information retrieval. 109-114 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#KerenidisW04 2004-07-06 Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism. 167-173 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.02.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#FreschiB04 2004-07-06 Limiting negations in bounded-depth circuits: An extension of Markov's theorem. 15-20 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#SungT04 2004-07-06 Addition chains with a bounded number of registers. 247-252 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.02.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#ParkerP04 2004-07-06 A weakest failure detector-based asynchronous consensus protocol for f<n. 39-46 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#FriedmanMR04 2004-07-06 The orthogonal CNN problem. 115-120 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.01.022 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#IwamaY04 2004-07-06 Approximate hotlink assignment. 121-128 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.01.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#KranakisKS04 2004-07-06 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. 239-246 2004 90 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.02.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#SparlZ04 2004-07-06 Constant time generation of derangements. 181-186 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#KorshL04 2004-07-06 Using a minimal number of resets when testing from a finite state machine. 287-292 2004 90 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Hierons04 2004-07-06 A PTIME-complete matching problem for SLP-compressed words. 3-6 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#MarkeyS04 2004-07-06 The cost of becoming anonymous: on the participant payload in Crowds. 81-86 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#SuiWCC04 2004-07-06 An optimal storage format for sparse matrices. 87-92 2004 90 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.01.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#MontagneE04 2004-07-06 Analysis of simple randomized buffer management for parallel I/O. 47-52 2004 90 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#KallahallaV04 2004-07-06 A simple algorithm for the constrained sequence problems. 175-179 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#ChinSFHK04 2006-02-07 An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. 273-278 2004 90 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#Breit04 2004-07-06 The analysis of packet loss prediction for Gilbert-model with loss rate uplink. 155-159 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.01.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#SuYL04 2004-07-06 Probabilistic integer sorting. 187-193 2004 90 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#GerbessiotisS04 2004-07-06 Relativized collapsing between BPP and PH under stringent oracle access. 147-154 2004 90 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl90.html#CaiW04 2004-07-06 On the expressive power of semijoin queries. 93-98 2004 91 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.03.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#LeindersTB04 2004-07-06 On Fixpoint Arithmetic and Infinite Time Turing Machines. 121-128 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#LenziM04 2004-07-06 Attack on a concast signature scheme. 39-41 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.12.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Stinson04 2004-07-06 Search audio data with the wavelet pyramidal algorithm. 49-55 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.020 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#LiH04 2004-07-06 Speedup of Vidyasankar's algorithm for the group. 85-91 2004 91 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.03.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#TakamuraAI04 2004-07-06 Power attacks on a side-channel resistant elliptic curve implementation. 29-32 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2003.12.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#GeiselmannS04 2004-07-06 Efficient structural joins with clustered extents. 69-75 2004 91 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.03.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#KimLK04 2004-07-06 Non-shared edges and nearest neighbor interchanges revisited. 129-134 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#HonKLSY04 2004-09-23 A fast algorithm for the generalized k-keyword proximity problem given keyword offsets. 115-120 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.03.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#KimLP04 2004-07-06 Impossible differential cryptanalysis of 7-round Advanced Encryption Standard (AES). 33-38 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.02.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Phan04 2004-07-06 On confluence and residuals in Cauchy convergent transfinite rewriting. 141-146 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.03.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Simonsen04 2004-07-06 The quantum query complexity of the hidden subgroup problem is polynomial. 43-48 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.01.024 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#EttingerHK04 2004-07-06 An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. 77-83 2004 91 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.03.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#ShiGH04 2004-07-06 Packing Steiner trees with identical terminal sets. 1-5 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Kaski04 2004-07-06 Strongly competitive algorithms for caching with pipelined prefetching. 19-27 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.03.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#GaysinskyIS04 2004-07-06 Note on the connectivity of line graphs. 7-10 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.03.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#HellwigRV04 2004-07-06 External matrix multiplication and all-pairs shortest path. 99-106 2004 91 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.03.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Sibeyn04 2004-07-06 Hamiltonian properties on the class of hypercube-like networks. 11-17 2004 91 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.03.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#ParkC04 2004-07-06 Fractal dimension and vector quantization. 107-113 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#KumaraswamyMF04 2004-07-06 A hierarchical clustering algorithm for categorical sequence data. 135-140 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#OhK04 2004-07-06 On finding an ear decomposition of an undirected graph distributively. 147-153 2004 91 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Tsin04 2004-07-06 A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. 57-67 2004 91 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.03.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#FulopKV04 2004-11-17 On the Euclidean TSP with a permuted Van der Veen matrix. 259-262 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#BurkardD04 2005-08-01 Evolutionary game algorithm for continuous parameter optimization. 211-219 2004 91 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#JunXL04 2004-11-17 Counting edge crossings in a 2-layered drawing. 221-225 2004 91 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#NagamochiY04 2004-11-17 Improved algorithm for all pairs shortest paths. 245-250 2004 91 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Han04 2004-11-17 Tutte type theorems for graphs having a perfect internal matching. 277-284 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#BarthaK04 2004-11-17 A simpler linear time 2/3-epsilon approximation for maximum weight matching. 271-276 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#PettieS04 2004-11-17 A scalable Web cache sharing scheme. 227-232 2004 91 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#ShinB04 2004-11-17 Erratum to: "The design of conference key distribution system employing a symmetric balanced incomplete block design": [Inform. Process. Lett. 81 (2002) 313-318] http://dx.doi.org/10.1016/j.ipl.2004.05.012 299-300 2004 91 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Chung04 2004-11-17 Kolmogorov-Loveland stochasticity for finite strings. 263-269 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#DurandV04 2004-11-17 The power of first-order quantification over states in branching and linear time temporal logics. 201-210 2004 91 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#ChatterjeeDC04 2004-11-17 A simple but effective improvement to the plumb-line algorithm. 251-257 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#GutingD04 2004-11-17 Formal language identification: query learning vs. Gold-style learning. 285-292 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#LangeZ04 2004-11-17 The super-connected property of recursive circulant graphs. 293-298 2004 91 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.05.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#TsaiTH04 2004-11-17 Computing polynomial program invariants. 233-244 2004 91 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Muller-OlmS04 2004-11-17 Survivable network design: the capacitated minimum spanning network problem. 183-190 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#JothiR04 2004-11-17 Fast non-blocking atomic commit: an inherent trade-off. 195-200 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#DuttaGP04 2004-11-17 Attack on an ID-based authenticated group key agreement scheme from PKC 2004. 191-193 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#ZhangC04 2004-11-17 Algorithms for solving the symmetry number problem on trees. 163-169 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.04.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#MitraAK04 2004-11-17 A coding theorem for Enumerable Output Machines. 157-161 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Poland04 2004-11-17 Shortest paths in simple polygons with polygon-meet constraints. 171-176 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.04.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#KhosraviG04 2004-11-17 Resource constrained scheduling on multiple machines. 177-182 2004 91 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl91.html#Remy04 2004-11-17 <i>n</i><i>m</i>) using precomputation. 231-234 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.08.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#ChangKKC04 2004-11-17 A note on the oriented chromatic number of grids. 65-70 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#SzepietowskiT04 2004-11-17 <i>k</i>-tree and a graph with a polynomially bounded number of spanning trees. 57-63 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#YamaguchiAM04 2004-11-17 Algorithms for the On-Line Quota Traveling Salesman Problem. 89-94 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#AusielloDLP04 2004-11-17 Word prediction using a clustered optimal binary search tree. 257-265 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#El-Qawasmeh04 2004-11-17 Minimal forbidden subwords. 211-218 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#PetkovicCB04 2004-11-17 Pattern expressions and pattern automata. 267-274 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#CampeanuY04 2004-11-17 Global roundings of sequences. 113-116 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Doerr04 2004-11-17 Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links. 189-197 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#MaityNR04 2004-11-17 A note on quadratic residuosity and UP. 127-131 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.06.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#CaiT04 2004-11-17 Exact algorithms for the minimum latency problem. 303-309 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#WuHZ04 2004-11-17 On the symmetric angle-restricted nearest neighbor problem. 121-126 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#AggarwalW04 2004-11-17 Darts and hoopla board design. 53-56 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Curtis04 2004-11-17 Kinetic collision detection with fast flight plan changes. 287-291 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Hershberger04 2004-11-17 Compressing arrays by ordering attribute values. 253-256 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Kaser04 2004-11-17 Characterising the Martin-Löf random sequences using computably enumerable sets of measure one. 157-160 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.06.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Davie04 2004-11-17 Some characterizations of Parikh matrix equivalent binary words. 77-82 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#FosseR04 2006-01-25 Dynamic programming solution for multiple query optimization problem. 149-155 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.06.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#TorosluC04 2004-11-17 Computability versus exact computability of martingales. 235-237 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Lutz04 2004-11-17 The complexity of the certification of properties of Stable Marriage. 275-277 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#DoughertyS04 2004-11-17 A compression method for prefix-sum cubes. 99-105 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.05.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#KangMCC04 2004-11-17 An efficient and flexible algorithm for online mining of large itemsets. 311-316 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#JeaCL04 2004-11-17 Simplified tight analysis of Johnson's algorithm. 207-210 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Engebretsen04 2004-11-17 Scaled and permuted string matching. 293-297 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#ButmanEL04 2004-11-17 Method redefinition--ensuring alternative behaviors. 279-285 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Nunes04 2004-11-17 A classification of tournaments having an acyclic tournament as a minimum feedback arc set. 107-111 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#IsaakN04 2004-11-17 A simple proof that finding a maximal independent set in a graph is in NC. 185-187 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.08.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Windsor04 2004-11-17 An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services. 299-302 2004 92 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Chen04 2004-11-17 On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. 143-147 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Shparlinski04 2004-11-17 Computing unique canonical covers for simple FDs via transitive reduction. 169-174 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Lechtenborger04 2004-11-17 An efficient cache conscious multi-dimensional index structure. 133-142 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.06.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#ShimSYM04 2005-02-16 Generalized honeycomb torus is Hamiltonian. 31-37 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.05.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#YangELM04 2004-11-17 Trading uninitialized space for time. 9-13 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Valiente04 2004-11-17 Cryptographic key assignment schemes for any access control policy. 199-205 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.03.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#SantisFM04 2004-11-17 On the algebraic complexity of set equality and inclusion. 175-178 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Katriel04 2004-11-17 Fast parallel recognition of LR language suffixes. 225-229 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.08.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#BertschN04 2004-11-17 Acyclic colorings of subcubic graphs. 161-167 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Skulrattanakulchai04 2004-11-17 Graph compression and the zeros of polynomials. 39-44 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#LitowD04 2004-11-17 <i>n</i>-vertex planar graphs. 95-98 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Kurowski04 2004-11-17 Finding next-to-shortest paths in a graph. 117-119 2004 92 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.06.020 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#KrasikovN04 2004-11-17 Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. 245-251 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#WeismanCK04 2004-11-17 New characterization for live and reversible augmented marked graphs. 239-243 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.05.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Cheung04 2004-11-17 A symbolic approach for content-based information filtering. 45-52 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#BezerraC04 2004-11-17 Oriented colorings of triangle-free planar graphs. 71-76 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Ochem04 2004-11-17 The super laceability of the hypercubes. 15-21 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#ChangLHH04 2004-11-17 A constructive proof for FLP. 83-87 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Volzer04 2004-11-17 <i>k</i>-searchers. 1-8 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#YamashitaSK04 2004-11-17 A strong lower bound for approximate nearest neighbor searching. 23-29 2004 92 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Liu04a 2004-11-17 An optimal parallel algorithm for c-vertex-ranking of trees. 179-184 2004 92 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#KashemR04 2005-05-13 Upper bound for the approximation ratio of a class of hypercube segmentation algorithms. 139-141 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Seppanen05 2005-05-13 Graham triangulations and triangulations with a center are hamiltonean. 295-299 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#MonroyU05 2005-05-13 Broadcasting with locally bounded Byzantine faults. 109-115 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#PelcP05 2005-05-13 <i>l</i><i>k</i>. 25-28 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.08.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#QuisquaterPV05 2005-05-13 Reconstruct versus read-modify writes in RAID. 163-168 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Thomasian05 2005-05-13 A fast algorithm for computing a longest common increasing subsequence. 249-253 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.10.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#YangHC05 2005-05-13 Fault diameter of Cartesian product graphs. 245-248 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#XuXH05 2005-05-13 An algebraic attack on the improved summation generator with 2-bit memory. 43-46 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.08.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#HanL05 2005-05-13 Node-pancyclicity and edge-pancyclicity of crossed cubes. 133-138 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.09.026 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#FanLJ05 2005-05-13 PalmHashing: a novel approach for cancelable biometrics. 1-5 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#ConnieJOL05 2005-05-13 Constructive dimension equals Kolmogorov complexity. 149-153 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.09.023 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Staiger05 2005-05-13 Finding a longest nonnegative path in a constant degree tree. 275-279 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.11.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Kim05 2005-05-13 The d-deap ast: a fast and simple cache-aligned d-ary deap. 63-67 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Jung05 2005-05-13 A note on maximum independent set and related problems on box graphs. 169-171 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.10.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#LingasW05 2005-05-13 The decidability border of hereditary history preserving bisimilarity. 289-293 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Froschle05 2005-05-13 <i>k</i><i>k</i><i>k</i><i>n</i>. 185-190 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.09.024 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Segerlind05 2005-05-13 Performance analysis of a greedy algorithm for inferring Boolean functions. 7-12 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#FukagawaA05 2005-05-13 Generating anomalous elliptic curves. 225-230 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#LeprevostMVV05 2005-05-13 An improved GA and a novel PSO-GA-based hybrid algorithm. 255-261 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#ShiLLLW05 2005-05-13 Alternators in read/write atomicity. 207-215 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#KulkarniBOR05 2005-05-13 Efficient weakest preconditions. 281-288 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.10.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Leino05 2005-05-13 <i>k</i>trees. 239-244 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Chataigner05 2005-05-13 No-wait scheduling in single-hop multi-channel LANs. 19-24 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#ZhouXC05 2005-05-13 A fast deterministic smallest enclosing disk approximation algorithm. 263-268 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#NielsenN05 2005-05-13 <i>s, t</i>)-cuts in digraphs. 231-237 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Nagamochi05 2005-05-13 The greedy algorithm for shortest superstrings. 13-17 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#KaplanS05 2005-05-13 Linearity and nondeletion on monadic context-free tree grammars. 103-107 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Fujiyoshi05 2005-05-13 Optimal bounding cones of vectors in three dimensions. 83-89 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.09.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#BarequetE05 2005-05-13 An optimal hierarchical clustering algorithm for gene expression data. 143-147 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#SealKA05 2005-05-13 _E-termination of rewriting by size-change termination. 155-162 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Fernandez05a 2005-05-13 A syntactic commutativity format for SOS. 217-223 2005 93 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#MousaviRG05 2005-05-13 Substring search and repeat search using factor oracles. 269-274 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#KatoW05 2005-05-13 Relaxing monotonicity for innermost termination. 117-123 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Fernandez05 2005-05-13 Diagnosability of star graphs under the comparison diagnosis model. 29-36 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#ZhengLRLW05 2005-05-13 A Coarse-Grained Multicomputer algorithm for the detection of repetitions. 307-313 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#GarciaS05 2005-05-13 Optimal strong primes. 47-52 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#DiazM05 2005-05-13 Refined memorization for vertex cover. 123-131 2005 93 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2004.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#ChandranG05 2005-05-13 On plane spanning trees and cycles of multicolored point sets with few intersections. 301-306 2005 93 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2004.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#KanoMU05 2005-05-13 Fast estimation of fractal dimension and correlation integral on stream data. 91-97 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.09.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#WongWGF05 2005-05-13 <i>k</i>: a set partitioning problem with applications in UPS pickup-delivery system. 173-175 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#Jiang05 2005-05-13 Common intervals of trees. 69-74 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.09.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#HeberS05 2005-05-13 Ideal contrast visual cryptography schemes with reversing. 199-206 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#CimatoSFM05 2005-05-13 HCPO: an efficient insertion order for incremental Delaunay triangulation. 37-42 2005 93 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.09.020 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#ZhouJ05 2005-05-13 External-memory depth-first search algorithm for solid grid graphs. 177-183 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.09.025 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#HerR05 2005-05-13 Isometric-path numbers of block graphs. 99-102 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.09.021 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#PanC05 2005-05-13 Minimizing center key storage in hybrid one-way function based group key management with communication constraints. 191-198 2005 93 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2004.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#LiPM05 2005-05-13 Note on the Homogeneous Set Sandwich Problem. 75-81 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.09.022 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#FigueiredoS05 2005-05-13 The Helly property on subfamilies of limited size. 53-56 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#DouradoPS05 2005-05-13 Modeling the reliability of large dynamic distributed non-homogeneous networks. 57-61 2005 93 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl93.html#NooreC05 2005-05-13 A greedy approach to compute a minimum cycle basis of a directed graph. 107-112 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#LiebchenR05 2005-05-13 <i>L</i>(2, 1)-labeling of strong products of cycles. 183-190 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#KorzeV05 2005-05-13 Absolute o(log m) error in approximating random set covering: an average case analysis. 171-177 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#TelelisZ05 2005-05-13 Subtraction-free Almost Montgomery Inverse algorithm. 11-14 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#LorenczH05 2005-05-13 Minimizing the number of inputs while applying adaptive test cases. 165-169 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.01.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#JourdanUZ05 2005-05-17 Closure properties and decision problems of dag automata. 231-240 2005 94 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#AnantharamanNR05 2005-05-13 On the computational complexity of Nash equilibria for (0, 1) bimatrix games. 145-150 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#CodenottiS05 2005-05-13 Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. 49-53 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#CzumajHLN05 2005-05-13 An almost-linear time and linear space algorithm for the longest common subsequence problem. 131-135 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#GuoH05 2005-05-13 An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. 119-123 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#XuX05 2006-02-07 A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. 29-35 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#CarrabsCGP05 2005-05-13 Super connectivity of line graphs. 191-195 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#XuLMH05 2005-11-10 Approximation results for a bicriteria job scheduling problem on a single machine without preemption. 19-27 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#AngelBG05 2005-05-13 On the cubicity of certain graphs. 113-118 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#ChandranMO05 2005-05-13 The class of HDT0L sequences is closed with respect to rational functions. 155-158 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.01.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Honkala05 2005-05-13 Between 2- and 3-colorability. 179-182 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.01.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Lozin05 2005-05-13 <i>all_different</i>predicates. 99-105 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#AppaMM05 2005-05-13 Event Trace Independence of active behavior. 71-77 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#BonifatiCP05 2005-05-13 An impossibility gap between width-4 and width-5 permutation branching programs. 159-164 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.01.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Brodsky05 2005-05-13 The Little Towers of Antwerpen problem. 197-201 2005 94 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Minsker05 2005-05-13 ²). 79-84 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#McIverM05 2005-05-13 Strategies for peer-to-peer downloading. 203-209 2005 94 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.02.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#HermanJ05 2005-05-13 An improved algorithm for the maximum agreement subtree problem. 211-216 2005 94 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#LeeHCST05 2005-05-13 A faster parameterized algorithm for set packing. 7-9 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Koutis05 2005-05-13 Minimum-cost single-source 2-splittable flow. 15-18 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Kolliopoulos05 2005-05-13 Complexities of some interesting problems on spanning trees. 93-97 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#RahmanK05a 2005-05-13 Equality sets of prefix morphisms and regular star languages. 151-154 2005 94 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.01.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#HalavaHL05 2005-05-13 A space-efficient self-stabilizing algorithm for measuring the size of ring networks. 125-130 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#LeeTH05 2005-05-13 Scheduling jobs under decreasing linear deterioration. 63-69 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#WangX05 2005-05-13 _infinitelyradius of Saitou and Nei's method for phylogenetic reconstruction. 225-230 2005 94 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#XuDZ05 2005-05-13 Characterizing r-perfect codes in direct products of two and three cycles. 1-6 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#JerebicKS05 2005-05-13 A secure and scalable Group Key Exchange system. 137-143 2005 94 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#BurmesterD05 2005-05-13 CPS transformation of beta-redexes. 217-224 2005 94 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#DanvyN05 2005-05-13 Asynchronous bounded lifetime failure detectors. 85-91 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#FriedmanMR05 2005-05-13 A generalization of the 0-1 principle for sorting. 43-47 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.11.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#RajasekaranS05 2005-05-17 On Hamiltonian cycles and Hamiltonian paths. 37-41 2005 94 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#RahmanK05 2005-05-13 Optimization, block designs and No Free Lunch theorems. 55-61 2005 94 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.12.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#GriffithsO05 2006-04-26 Cycle inclusion property of augmented marked graphs. 271-276 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.02.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#CheungC05 2006-04-26 Intractability results in predicate detection. 277-282 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#KashyapG05 2006-04-26 An upper bound for the equational specification of finite state services. 267-269 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.02.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#BergstraB05 2006-04-26 Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets. 241-245 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Darondeau05 2006-04-26 <i>k</i>-point enclosing rectangle and square of arbitrary orientation. 259-266 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.02.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#DasGN05 2006-04-26 <i>k</i>-NN queries on clustered SVD datasets. 247-252 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#ThomasianLZ05 2006-04-26 Data exchange: On the complexity of answering queries with inequalities. 253-257 2005 94 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl94.html#Madry05 2006-04-26 Improved deterministic approximation algorithms for Max TSP. 333-342 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.03.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#ChenOW05 2006-04-26 <i>k</i>-MST. 512-517 2005 95 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.05.025 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#PunnenC05 2006-04-26 The transportation metric and related problems. 461-465 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Ostrovsky-Berman05 2006-04-26 Completeness of hyper-resolution via the semantics of disjunctive logic programs. 363-369 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#NguyenG05 2006-04-26 Applications of spiking neural networks. 519-520 2005 95 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#BohteK05 2006-04-26 Self-stabilizing coloration in anonymous planar networks. 307-312 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#HuangHT05 2006-07-11 <i>Liquid State Machine</i>: a case study. 521-528 2005 95 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#VerstraetenSSC05 2006-04-26 Exploiting distance coherence to speed up range queries in metric indexes. 287-292 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.03.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Fredriksson05 2006-04-26 <i>H</i>₁by resolution. 401-408 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Goubault-Larrecq05 2006-04-26 Spiking neural nets with symbolic internal state. 529-536 2005 95 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.020 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#ODwyerR05 2006-04-26 Space-efficient FCFS group mutual exclusion. 343-350 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Petrovic05 2006-04-26 ^,. 480-486 2005 95 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.05.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#MinK05 2006-04-26 Security protocols: from linear to classical logic by abstract interpretation. 473-479 2005 95 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.05.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Blanchet05 2006-04-26 Context exhumation after the Burrows-Wheeler transform. 313-320 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.03.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Deorowicz05 2006-04-26 Restructuring binary search trees revisited. 418-421 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.03.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Gagie05 2006-04-26 Finding iterative roots with a spiking neural network. 545-551 2005 95 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.022 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#IannellaK05 2006-04-26 Resource-bounded strong dimension versus resource-bounded category. 377-381 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#HitchcockP05 2006-04-26 On a simple randomized algorithm for finding a 2-factor in sparse graphs. 321-327 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Pandurangan05 2006-09-19 A gradient descent rule for spiking neurons emitting multiple spikes. 552-558 2005 95 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.023 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#BooijN05 2006-04-26 A large lower bound on the query complexity of a simple boolean function. 423-428 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Bollig05 2006-04-26 Construction of high degree resilient S-boxes with improved nonlinearity. 413-417 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.02.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#GuptaS05 2006-04-26 Stabilizing mobile philosophers. 299-306 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#DattaGR05 2006-04-27 Modifying YCN key assignment scheme to resist the attack from Hwang. 435-440 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#YehSH05 2006-05-22 An algorithm for computing the restriction scaffold assignment problem in computational biology. 466-471 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#ColanninoT05 2006-04-26 An effective local search for the maximum clique problem. 503-511 2005 95 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.05.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#KatayamaHN05 2006-04-26 Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. 382-388 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#ShiJ05 2006-04-26 Modularity for teams of I/O automata. 487-495 2005 95 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.05.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#BeekK05 2006-04-26 Properties of uniformly hard languages. 329-332 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2004.11.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#FaliszewskiJ05 2006-04-26 Maximum induced subgraph of a recursive circulant. 293-298 2005 95 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#YangEM05 2006-04-26 Euclidean TSP between two nested convex obstacles. 370-375 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#AbrahamsonSW05 2006-04-26 On the language equivalence of NE star-patterns. 396-400 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Nagy05 2006-04-26 Non-approximability of weighted multiple sequence alignment for arbitrary metrics. 389-395 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.04.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Manthey05 2006-04-26 A simple power analysis attack against the key schedule of the Camellia block cipher. 409-412 2005 95 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.03.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#XiaoH05 2006-04-26 Neural associative memory for brain modeling and information retrieval. 537-544 2005 95 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.021 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Knoblauch05 2006-04-26 Reviewing bounds on the circuit size of the hardest functions. 354-357 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.03.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#FrandsenM05 2006-04-26 <i>n</i>)-label interval routing. 351-353 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.03.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Tse05 2006-06-13 Hitting sets when the VC-dimension is small. 358-362 2005 95 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.03.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#EvenRS05 2006-04-26 <i>lambda</i>^'-optimality of graphs with small conditional diameter. 429-434 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#BalbuenaCDGM05 2006-04-26 Operational termination of conditional term rewriting systems. 446-453 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#LucasMM05 2006-04-26 <i>tau</i>-NAF algorithm. 496-502 2005 95 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.05.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#BlakeMX05 2006-04-26 The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks. 441-445 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#Parhami05 2006-04-26 A decidable class of problems for control under partial observation. 454-460 2005 95 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.04.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl95.html#PinchinatR05 2006-04-26 Partial known plaintext attack on Koyama scheme. 96-100 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Padhye05 2006-04-26 Edge-fault-tolerant edge-bipancyclicity of hypercubes. 146-150 2005 96 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#XuDX05 2006-04-26 Minimum degree triangulation for rectangular domains. 128-135 2005 96 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Liu05 2006-04-26 Lower bounds on treespan. 67-70 2005 96 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Rautenbach05 2006-04-26 Double hashing with passbits. 162-166 2005 96 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Burkhard05 2006-04-26 Tight bounds on plurality. 93-95 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#SrivastavaT05 2006-04-26 A new method for approximate indexing and dictionary lookup with one error. 185-191 2005 96 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#MaassN05 2006-04-26 On the P versus NP intersected with co-NP question in communication complexity. 202-206 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Jukna05 2006-04-26 Embedding the incomplete hypercube in books. 1-6 2005 96 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.05.026 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#FangL05 2006-04-26 ^,. 41-48 2005 96 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.05.024 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#ZhangH05 2006-04-26 A bivalency proof of the lower bound for uniform consensus. 167-174 2005 96 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#WangTC05 2006-04-26 Computing sparse permanents faster. 89-92 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#ServedioW05 2006-04-26 <i>during</i>bottom-up parsing. 220-224 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.08.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#SlivnikV05 2006-04-26 On the dynamic extent of delimited continuations. 7-17 2005 96 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#BiernackiDS05 2006-04-26 The super connectivity of shuffle-cubes. 123-127 2005 96 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#XuXZ05 2006-04-26 Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. 197-201 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#ChenC05 2006-04-26 <i>t</i>-relaxed coloring. 141-145 2005 96 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#CapponiP05 2006-04-26 Modified subset sum heuristics for bin packing. 18-23 2005 96 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#CapraraP05 2006-04-26 The convex hull of a regular set of integer vectors is polyhedral and effectively computable. 30-35 2005 96 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#FinkelL05 2006-04-26 Distance monotonicity and a new characterization of Hamming graphs. 207-213 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.08.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#AiderA05 2006-04-26 Secure multiplication of shared secrets in the exponent. 71-79 2005 96 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.01.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#GennaroR05 2006-04-26 A lower bound for computing Oja depth. 151-153 2005 96 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.05.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#AloupisM05 2006-04-26 Optimal many-to-one routing on the mesh with constant queues. 24-29 2005 96 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#PietracaprinaP05 2006-04-26 On the linear complexity of bounded integer sequences over different moduli. 175-177 2005 96 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#ShparlinskiW05 2006-04-26 <i>n</i>³<i>n</i><i>n</i>) time algorithm for the all-pairs shortest path problem. 155-161 2005 96 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Takaoka05 2006-04-26 On the definition of sequential consistency. 193-196 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#SezginG05 2006-04-26 ⁿ. 114-122 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.04.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#KoppartyR05 2006-04-26 De Bruijn sequences and De Bruijn graphs for a general language. 214-219 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.05.028 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Moreno05 2006-06-13 Structural soundness of workflow nets is decidable. 54-58 2005 96 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#TipleaM05 2006-04-26 A quadratic-time DBM-based successor algorithm for checking timed automata. 101-105 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.05.027 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#ZhaoLZ05 2006-04-26 <i>D</i>-ary optimal codes. 178-184 2005 96 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#NavarroB05 2006-04-26 On the average depth of asymmetric LC-tries. 106-113 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Reznik05 2006-04-26 Bases for Boolean co-clones. 59-66 2005 96 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#BohlerRSV05 2006-04-26 A mutual exclusion algorithm with optimally bounded bypasses. 36-40 2005 96 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.05.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Alagarsamy05 2006-04-26 Edge-pancyclicity of Möbius cubes. 136-140 2005 96 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#XuX05a 2006-04-26 The labeled perfect matching in bipartite graphs. 81-88 2005 96 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.06.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Monnot05 2006-04-26 On the hamiltonicity of the cartesian product. 49-53 2005 96 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.05.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#DimakopoulosPP05 2006-04-26 Monotone circuits for monotone weighted threshold functions. 12-18 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#BeimelW06 2006-04-26 A note on the attractor-property of infinite-state Markov chains. 58-63 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#BaierBS06 2006-04-26 Strongly secure ramp secret sharing schemes for general access structures. 52-57 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#IwamotoY06 2006-04-26 Efficient polynomial time algorithms computing industrial-strength primitive roots. 41-45 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#DubroisD06 2006-04-26 An optimal lower bound for 2-query locally decodable linear codes. 244-250 2006 97 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#ShiowattanaL06 2006-04-26 <i>k</i>-gon Voronoi diagram construction. 138-145 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#ChenPX06 2006-04-26 Pathwidth of cubic graphs and exact algorithms. 191-196 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#FominH06 2006-04-26 Two flow network simplification algorithms. 197-202 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#MisiolekC06 2006-04-26 On the complexity of market equilibria with maximum social welfare. 4-11 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#DengH06 2006-04-26 BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. 161-169 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.08.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#LeshM06 2006-07-18 Variations of the maximum leaf spanning tree problem for bipartite graphs. 129-132 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#LiT06 2006-04-26 A tight lower bound for job scheduling with cancellation. 1-3 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#ZhengCFPX06 2006-04-26 An adjustable linear time parallel algorithm for maximum weight bipartite matching. 186-190 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.10.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#FayyaziKM06 2006-04-26 Easy intruder deduction problems with homomorphisms. 213-218 2006 97 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#Delaune06 2006-04-26 Cayley graphs as models of deterministic small-world networks. 115-117 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#XiaoP06 2006-04-26 Mu-calculus path checking. 225-230 2006 97 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#MarkeyS06 2006-04-26 Quantum lower bounds for the Goldreich-Levin problem. 208-211 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.01.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#AdcockCIPY06 2006-04-26 APX-hardness of domination problems in circle graphs. 231-237 2006 97 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#DamianP06 2006-04-26 Runtime feasibility check for non-preemptive real-time periodic tasks. 83-87 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#KimLK06 2006-04-26 Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. 64-67 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#KuoY06 2006-04-26 A decidable characterization of the classes between lintime and exptime. 36-40 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#Caporaso06 2006-04-26 Vertex covering by paths on trees with its applications in machine translation. 73-81 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#LinCL06 2006-04-26 Compressing probability distributions. 133-137 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#Gagie06 2006-04-26 Transforming spanning trees and pseudo-triangulations. 19-22 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#AichholzerAHK06 2006-04-26 On the hardness of approximating Max-Satisfy. 31-35 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.08.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#FeigeR06 2006-04-26 Paths in Möbius cubes and crossed cubes. 94-97 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#XuML06 2006-05-30 Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy. 238-243 2006 97 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#LeeCKL06 2006-04-26 Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme. 118-123 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.09.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#CheonKN06 2006-05-10 A flaw in the electronic commerce protocol SET. 104-108 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#BrlekHM06 2006-04-26 On the relationship between squared pairings and plain pairings. 219-224 2006 97 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#KangP06 2006-04-26 The greedy algorithm for edit distance with moves. 23-27 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.08.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#KaplanS06 2006-07-18 <i>k</i>-median problem. 68-72 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#ChrobakKY06 2006-04-26 A polynomial time approximation scheme for embedding a directed hypergraph on a ring. 203-207 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#LiW06 2006-04-27 Linear structures of symmetric functions over finite fields. 124-127 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#LiC06 2006-04-26 Enhanced algorithms for Local Search. 171-176 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#Verhoeven06 2006-04-26 <i>m</i><i>n</i>oblivious transfer'. 153-155 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.08.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#GhodosiZ06 2006-04-26 An O(sqrt(n))-approximation algorithm for directed sparsest cut. 156-160 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#HajiaghayiR06 2006-04-26 A fixed-parameter tractability result for multicommodity demand flow in trees. 109-114 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#GuoN06 2006-04-26 Minimum neighborhood in a generalized cube. 88-93 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#YangCML06 2006-04-26 Weighted Coloring: further complexity and approximability results. 98-103 2006 97 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#EscoffierMP06 2006-04-26 On discretization methods for approximating optimal paths in regions with direction-dependent costs. 146-152 2006 97 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#SunB06 2006-04-26 A constructive approach to sequential Nash equilibria. 46-51 2006 97 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#Vestergaard06 2006-04-26 Weighted random sampling with a reservoir. 181-185 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#EfraimidisS06 2006-04-26 An algorithm for Exact Satisfiability analysed with the number of clauses as parameter. 28-30 2006 97 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.08.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#Madsen06 2006-04-26 An approximation algorithm for interval data minmax regret combinatorial optimization problems. 177-180 2006 97 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2005.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl97.html#KasperskiZ06 2006-04-27 Structure and linear time recognition of 3-leaf powers. 133-138 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#BrandstadtL06 2006-04-27 <i>a</i><i>a</i><i>b</i><i>c</i><i>b</i><i>b</i><i>a</i><i>c</i><i>c</i><i>c</i><i>a</i><i>b</i>}. 156-158 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2005.12.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#HofbauerW06 2006-04-27 Parameterized power domination complexity. 145-149 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#KneisMRR06 2006-04-27 Approximating minimum coloring and maximum independent set in dotted interval graphs. 29-33 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.012 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Jiang06 2006-04-27 Applying adaptive test cases to nondeterministic implementations. 56-60 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Hierons06 2006-04-27 Optimal 2-constraint satisfaction via sum-product algorithms. 24-28 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.013 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Koivisto06 2006-04-27 A simple algorithm for in-place merging. 34-40 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.018 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Chen06 2006-04-27 Fraction interpolation walking a Farey tree. 19-23 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.014 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#MoskoG06 2006-04-27 The diameter of Hanoi graphs. 79-85 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#BerendS06 2006-04-27 Test suite oscillations. 47-55 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.11.016 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Nikolik06 2006-04-27 Smaller superconcentrators of density 28. 127-129 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Schoning06 2006-04-27 Construction of Aho Corasick automaton in linear time for integer alphabets. 66-72 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.11.019 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#DoriL06 2006-04-27 Using postdomination to reduce space requirements of data flow analysis. 11-18 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.017 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#BernardeschiLMM06 2006-04-27 The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. 87-91 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.12.010 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#BornsteinFS06 2006-04-27 <i>k</i>-ary trees. 115-118 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.11.020 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#JavanianV06 2006-04-27 Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. 6-10 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#BrosenneHW06 2006-04-27 Single machine scheduling with batch-dependent setup times. 73-78 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#MosheiovO06 2006-04-27 QoS based resource scheduling by computational economy in computational grid. 119-126 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2006.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#ChunlinL06 2006-04-27 On the complexity of extension checking in default logic. 61-65 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Liberatore06 2006-04-27 Vertex rankings of chordal graphs and weighted trees. 96-100 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#DereniowskiN06 2006-04-27 <i>d</i>dimensions. 162-167 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.011 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#AckermanBPR06 2006-04-27 Adaptive general perfectly periodic scheduling. 107-114 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.12.009 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#PatilG06 2006-04-27 <i>Delta</i>-List vertex coloring in linear time. 101-106 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.12.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Skulrattanakulchai06 2006-04-27 An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. 92-95 2006 98 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/j.ipl.2005.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#HassinR06 2006-04-27 Optimal register allocation for SSA-form programs in polynomial time. 150-155 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#HackG06 2006-04-27 Improved algorithm for the symmetry number problem on trees. 130-132 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#Han06 2006-04-27 Improved generalized Atkin algorithm for computing square roots in finite fields. 1-5 2006 98 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/j.ipl.2005.11.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#KongCYL06 2006-04-27 Finding routes in anonymous sensor networks. 139-144 2006 98 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2006.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#DutraB06 2006-04-28 Low-complex dynamic programming algorithm for hardware/software partitioning. 41-46 2006 98 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2005.12.008 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl98.html#WuS06 2003-11-27 Putting documents into their work context in document analysis. 623-641 2000 36 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#SalminenLT00 2003-11-27 Online Adaptive Vector Quantization with Variable Size Codebook Enteries. 745-758 1994 30 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#ConstantinescuS94 2004-12-15 Combining the Evidence of Multiple Query Representations for Information Retrieval. 431-448 1995 31 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm31.html#BelkinKFS95 2003-11-27 On Probabilistic Notions of Precision as a Function of Recall. 291-316 1992 28 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm28.html#BollmannRJ92 2003-11-27 The applicability of universal pragmatics in information retrieval interaction: a pilot study. 237-248 2002 38 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm38.html#Ng02 2003-11-27 A probabilistic model of information retrieval: development and comparative experiments - Part 2. 809-840 2000 36 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#JonesWR00a 2003-11-27 Querying a Hypertext Information Retrieval System by the Use of Classification. 387-396 1993 29 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#AboudCRSS93 2003-11-27 Evaluation Measures for Interactive Information Retrieval. 503-516 1992 28 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm28.html#Su92 2003-11-27 Value of Search Results as a Whole as the Best Single Measure of Information Retrieval Performance. 557-579 1998 34 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#Su98 2003-11-27 A Comparative Analysis of the Information Sectors of South Korea, Singapore and Taiwan. 357-371 1996 32 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Mee-Jean96 2003-11-27 Book Review: From Print to Electronic: The Transformation of Scientific Communication by S. Crawford, J. H Hurd and A. C. Weller. 500-501 1998 34 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#Roderer98 2003-11-27 Chaotic Behavior in Computer Mediated Network Communication. 555-562 1996 32 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#SnyderK96 2003-11-27 Automatic Construction and Management of Large Open Webs. 161-173 1997 33 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Thistlewaite97 2005-10-10 The mathematical models of the periodical literature publishing process. 401-414 2000 36 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#GuangDY00 2003-11-27 Trends in Analyzing Access to Information. Part II: Unique and Integrating Conceptualizations. 77-99 1999 35 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#McCreadieR99a 2003-11-27 Selecting Signature Files for Specific Applications. 487-498 1993 29 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#TiberioZ93 2003-11-27 Application of Loglinear Models to Informetric Phenomena. 75-88 1992 28 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm28.html#BooksteinODS92 2003-11-27 The role of feedback in the assessment of news. 583-594 1997 33 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Newhagen97 2003-11-27 Text Structuration Leading to an Automatic Summary System: RAFI. 181-191 1999 35 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#Lehmam99 2003-11-27 Overlapping statistical segmentation for effective indexing of Japanese text. 463-480 1999 35 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#OgawaM99 2003-11-27 Quality Control in Software Documentation Based on Measurement of Text Comprehension and Text Comprehensibility. 551-568 1993 29 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#Lehner93 2004-04-29 Document ranking based upon Markov chains. 623-637 2001 37 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm37.html#DaniowiczB01 2003-11-27 An analysis of image retrieval tasks in the field of art history. 701-720 2001 37 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm37.html#Chen01 2003-11-27 A Conceptual Model for Storage and Retrieval of Short Scientific Texts. 209-214 1993 29 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#Chen93 2003-11-27 On Inference Rules of Logic-Based Information Retrieval Systems. 43-60 1994 30 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#Chen94 2003-11-27 Role-Limiting Methods for Automated Knowledge Acquisition: A Problem-Solving Perspective. 239-245 1996 32 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Chen96 2003-11-27 Visualising Semantic Spaces and Author Co-Citation Networks in Digital Libraries. 401-420 1999 35 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#Chen99 2003-11-27 Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference. 829-838 1994 30 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#CulikK94 2003-11-27 Applying Informetric Characteristics of Databases to IR System File Design, Part I: Informetric Models. 121-134 1992 28 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm28.html#Wolfram92 2003-11-27 The Impact of Emerging Technologies on Reference Service and Bibliographic Instruction. 641-642 1996 32 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Wolfram96 2003-11-27 Review - Managing Knowledge: Perspectives on Cooperation and Competition. 808-809 1997 33 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Chun97 2003-11-27 In vitro evaluation of a program for machine-aided indexing. 765-792 2002 38 Inf. Process. Manage. 6 http://dx.doi.org/10.1016/S0306-4573(01)00050-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm38.html#JacqueminDRP02 2003-11-27 The Poisson-Lognormal Model for Bibliometric/Scientometric Distributions. 239-252 1994 30 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#Stewart94 2003-11-27 Text categorization: the assignment of subject descriptors to magazine articles. 841-861 2000 36 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#MoensD00 2003-11-27 Automatic text structuring and categorization as a first step in summarizing legal cases. 727-737 1997 33 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#MoensU97 2004-06-24 Context-Sensitive Processing of Semantic Queries in an Image Database System. 573-600 1996 32 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#ShakirN96 2003-11-27 Review - High Technology and Low-Income Communities: Prospects for the Positive Use of Advanced Information Technology; D.A. Schon, B. Sanyal, W.J. Mitchell (Eds.), MIT Press 1999. 333-336 2000 36 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#Cole00 2003-11-27 Intelligent information retrieval: Part IV - Testing the timing of two information retrieval devices in a naturalistic setting. 163-182 2001 37 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm37.html#Cole01 2003-11-27 The Universal Turing Machine: A Half-Century Survey. 640-641 1996 32 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Cole96 2003-11-27 Information as Process: The Difference Between Corroborating Evidence and `Information' in Humanistic Research Domains. 55-67 1997 33 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Cole97 2003-11-27 Book Review: Information Seeking and Subject Representation: An Activity-Theoretical Approach to Information Science by B. Hjorland. 503-504 1998 34 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#Cole98 2003-11-27 Material Mastery: Situating Digital Library Use in University Research Practices. 293-316 1999 35 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#Covi99 2003-11-27 The Simon-Yule Approach to Bibliometric Modeling. 535-556 1994 30 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#ChenCT94 2003-11-27 Image Compression on a VLSI Neural-Based Vector Quantizer. 687-706 1992 28 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm28.html#ChenSF92 2003-11-27 The Relevance Aura of Bibliographic Records. 69-80 1997 33 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Brooks97 2003-11-27 Book Review: Information and Meaning: An Evolutionary Perspective by T. Stonier. 505-506 1998 34 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#Brooks98 2003-11-27 Level search schemes for information filtering and retrieval. 313-334 2001 37 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm37.html#ZhangBR01 2003-11-27 The Effect of Linkage Structure on Retrieval Performance in a Hypertext-Based Bibliographic Retrieval System. 529-541 1996 32 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#WolframVD96 2003-11-27 "Citation Profiles" to Improve Relevance in a Two-Stage Retrieval System: A Proposal. 463-470 1993 29 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#Shalini93 2003-11-27 Building Hypertext Using Information Retrieval. 145-159 1997 33 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Allan97 2003-11-27 Book Review: Readings in Information Retrieval edited by K. Sparck Jones and P. Willett. 489-490 1998 34 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#Allan98 2003-11-27 Cognitive Abilities and Information System Usability. 177-192 1994 30 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#Allen94 2003-11-27 A Sublanguage Approach to Natural Language Processing for an Expert System. 633-646 1993 29 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#LiddyJSY93 2003-11-27 Who Owns Information? From Privacy to Public Access. 408 1997 33 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Doty97 2003-11-27 Retrieval Hierarchies in Hypertext. 358-372 1993 29 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#RadaWB93 2003-11-27 Towards Effective Support for Research Group Management: The Hypotheses Papers Database. 611-618 1996 32 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#RadaZD96 2003-11-27 Information Use Value: A Test on the Perception of Utility and Validity. 587-600 1993 29 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#Oberhofer93 2003-11-27 Book Review: History and Electronic Artefacts. 213-214 1999 35 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#Duff99 2003-11-27 Computers and Design in Context - Review. 715-716 1999 35 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#Dunn99 2003-11-27 A Fast Retrieving Algorithm of Hierarchical Relationships Using Trie Structures. 761-773 1998 34 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#KoyamaMFA98 2003-11-27 The message is (still) the medium: the newspaper in the age of cyberspace. 595-597 1997 33 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Kimber97 2003-11-27 Freestyle vs. Boolean: A Comparison of Partial and Exact Match Retrieval Systems. 175-190 1998 34 Inf. Process. Manage. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#ParisT98 2003-11-27 Three years of digital consumer health information: a longitudinal study of the touch screen health kiosk. 479-502 2003 39 Inf. Process. Manage. 3 http://dx.doi.org/10.1016/S0306-4573(02)00039-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm39.html#NicholasHW03 2003-11-27 The cascade of interactions in the digital library interface. 381-400 2002 38 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm38.html#Bates02 2003-11-27 Document Familiarity, Relevance, and Bradford's Law: the Getty Online Searching Project Report Number 5. 697-707 1996 32 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Bates96 2003-11-27 Automatic identification and back-transliteration of foreign words for information retrieval. 523-540 1999 35 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#JeongMLC99 2003-11-27 Query Evaluation: Strategies and Optimizations. 831-850 1995 31 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm31.html#TurtleF95 2003-11-27 Learned Vector-Space Models for Document Retrieval. 419-429 1995 31 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm31.html#CaidDG95 2006-08-30 Vertical Framing of Superimposed Signature Files Using Partial Evaluation of Queries. 353-376 1997 33 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#KocberberaC97 2003-11-27 An aggregation approach to the classification problem using multiple prediction experts. 683-696 2000 36 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#MajorR00 2003-11-27 Stereotypes in Information Filtering Systems. 273-287 1997 33 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#ShapiraSH97 2003-11-27 On contexts of information seeking. 735-760 2003 39 Inf. Process. Manage. 5 http://dx.doi.org/10.1016/S0306-4573(02)00030-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm39.html#Johnson03 2003-11-27 A Classification of Ellipsis Based on a Corpus of Information Seeking Dialogues. 315-326 1994 30 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#Johnson94 2003-11-27 Representational Ideas: From Plato to Patricia Churchland. 411-412 1997 33 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm33.html#Robins97 2003-11-27 Efficient stemmer generation. 547-558 2002 38 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm38.html#FoxF02 2003-11-27 An Information Architecture to Support the Visualization of Personal Histories. 581-597 1998 34 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#PlaisantSM98 2003-11-27 Towards Data Abstraction in Networked Information Retrieval Systems. 101-119 1999 35 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#Fuhr99 2003-11-27 Progress Toward Digital Libraries: Augmentation through Integration. 219-225 1999 35 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm35.html#MarchioniniF99 2003-11-27 User studies informing E-table interfaces. 561-579 2003 39 Inf. Process. Manage. 4 http://dx.doi.org/10.1016/S0306-4573(02)00043-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm39.html#MarchioniniM03 2003-11-27 The diversity-based approach to open-domain text summarization. 363-389 2003 39 Inf. Process. Manage. 3 http://dx.doi.org/10.1016/S0306-4573(02)00096-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm39.html#NomotoM03 2003-11-27 Construal. 771-772 1996 32 Inf. Process. Manage. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Haas96 2003-11-27 Pioneers of the Online Age. 33-48 1996 32 Inf. Process. Manage. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm32.html#Hahn96 2003-11-27 Book Review: Software Agents edited by J. M. Bradshaw. 492-497 1998 34 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm34.html#Hall98 2003-11-27 Combining evidence for automatic Web session identification. 727-742 2002 38 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm38.html#HeGH02 2004-04-26 The effect of indexing exhaustivity on retrieval performance. 623-628 1991 27 Inf. Process. Manage. 6 http://dx.doi.org/10.1016/0306-4573(91)90003-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm27.html#Burgin91 2003-11-27 Library and information science: practice, theory, and philosophical basis. 501-531 2000 36 Inf. Process. Manage. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm36.html#Hjorland00 2003-11-27 Task Complexity Affects Information Seeking and Use. 191-213 1995 31 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm31.html#BystromJ95 2003-11-27 Understanding Messages in a Diagnostic Domain. 687-701 1995 31 Inf. Process. Manage. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm31.html#Ciravegna95 2003-11-27 Shifting the Information Paradigm from Data-Centered to User-Centered. 455-472 1994 30 Inf. Process. Manage. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm30.html#WattersS94 2003-11-27 Outline of a Model for Lexical Databases. 159-186 1993 29 Inf. Process. Manage. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipm/ipm29.html#IdeMV93