2003-11-20 Efficient Query Evaluation in Relational Data Bases with Missing Values. 160-163 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Siklossy81 2003-11-20 On the Complexity of Inexact Computations. 77-81 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Pearl75 2003-11-20 An Application of a Transfer Lemma. 161-163 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Deleage83 2003-11-20 RNS architectures for the implementation of the `diagonal function'. 189-198 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#DimauroIPS00 http://dx.doi.org/10.1016/S0020-0190(00)00003-X 2003-11-20 Preface: Process Algebra. 1 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#AcetoF01 http://dx.doi.org/10.1016/S0020-0190(01)00211-3 2003-11-20 A Characterization of Finitary Bisimulation. 127-134 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#AcetoI97 http://dx.doi.org/10.1016/S0020-0190(97)00163-4 2005-04-20 On the Multiplication of Reduced Biquaternions and Applications. 161-164 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#DimitrovCD92 2003-11-20 An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. 257-263 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Beauquier91 2003-11-20 An Algorithm for Hazard-Free Minimization of Incompletely Specified Switching Function. 23-29 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Khan94 2003-11-20 Secret Sets and Applications. 47-55 1998 65 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#MolvaT98 http://dx.doi.org/10.1016/S0020-0190(97)80449-8 2003-11-20 An Algorithm for Modular Exponentiation. 155-159 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#DimitrovJM98 http://dx.doi.org/10.1016/S0020-0190(98)00044-1 2003-11-20 Binomial Coefficients with Non-Integral Lower Index. 223-226 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Ramshaw77 2003-11-20 An Example of a PD2L-System with the Growth Type 2½. 131-134 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Karhumaki73 2003-11-20 A Scheme for Fault-Tolerant Virtual Memory. 99-103 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#BrandwajnJ80 2003-11-20 A Study of a Page-on-Demand System. 125-132 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#BrandwajnM77 2003-11-20 Approximaely Satisfied Properties of Systems and Simple Language Homomorphisms. 201-206 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#NitscheO96 http://dx.doi.org/10.1016/S0020-0190(96)00162-7 2003-11-20 Finding a Maximum Independent Set in a Permutation Graph. 19-23 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Kim90a 2003-11-20 Parallel Algorithms for the Segment Dragging Problem. 323-327 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Kim90b 2003-11-20 An Optimal Scheduling Algorithm for Preemptable Real-Time Tasks. 43-38 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Kim94a 2003-11-20 Unambiguous Description of Chain Code Picture Languages. 75-79 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Kim96a http://dx.doi.org/10.1016/0020-0190(96)00014-2 2003-11-24 A space- and time-efficient local-spin spin lock. 47-55 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00224-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#KimA02 2003-11-20 An Algebraic Algorithm to Compute the Exact General Sweep Boundary of a 2D Curved Object. 221-229 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#KimA93 2003-11-24 Online deadline scheduling on faster machines. 31-37 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00332-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KimC03 2003-11-20 An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs. 15-17 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#KimC87 2003-11-20 Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model. 201-211 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#KimC91 2003-11-20 Corrigenda: Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model. 165 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#KimC92 2003-11-20 Application of the Special Latin Square to a Parallel Routing Algorithm on a Recursive Circulant Network. 141-147 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#KimC98 http://dx.doi.org/10.1016/S0020-0190(98)00050-7 2003-11-20 Optimal Total Exchange for a 3-D Torus of Processors. 95-102 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#PlateauT92 2003-11-20 Coordinator: A Modification to the Monitor Concept. 73-80 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#KimK89 2003-11-20 A Mean Value Analysis of the Ethernet Throughput. 315-320 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#KimK92 2003-11-20 O(log n) Numerical Algorithms on a Mesh with Wormhole Routing. 129-136 1994 50 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#KimK94 2003-11-20 Starvation-Free Secure Multiversion Concurrency Control. 247-253 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#KimK98 http://dx.doi.org/10.1016/S0020-0190(98)00014-3 2003-11-20 Partial Sum Problem Mapping Into a Hypercube. 221-224 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#KimL90 2003-11-20 The FX Distribution Method for Parallel Processing of Partial Match Queries. 243-252 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#KimP91 2003-11-20 Two-Way Dominant Sequence Clustering for Processor Scheduling. 203-208 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#KimP94 2003-11-20 Simple Algorithms for Multiprocessor Scheduling to Meet Deadlines. 162-164 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Blazewicz77 2003-11-20 Deadline Scheduling of Tasks with Ready Times and Resource Constraints. 60-63 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Blazewicz79 2003-11-25 Personalized cache management for mobile computing environments. 221-228 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00352-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#KimY03 2003-11-20 A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. 129-136 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#LecroqLM97 http://dx.doi.org/10.1016/S0020-0190(97)00011-2 2003-11-20 Cycle Detection in Critical Path Networks. 15-19 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#KarayiannisL78 2003-11-25 On classes of functions for which No Free Lunch results hold. 317-321 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00222-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#IgelT03 2003-11-20 Finitistic Proofs of 0-1 Laws for Fragments of Second-Order Logic. 1-4 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Lacoste96 http://dx.doi.org/10.1016/0020-0190(96)00035-X 2003-11-25 Complexity of min-max subsequence problems. 213-217 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00272-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#MichielsK03 2003-11-20 Bounds on the Weighted Path Length of Binary Trees. 220-225 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#NievergeltPWY72 2003-11-20 "Software Devices" for Processing Graphs Using PL/I Compile Time Facilities. 171-179 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Hansal74 2003-11-20 Removing edge-node intersections in drawings of graphs. 105-110 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#LaiE02 http://dx.doi.org/10.1016/S0020-0190(01)00194-6 2003-11-20 A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions. 119-122 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#LaiS86 2003-11-20 The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs. 21-26 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#LaiW93 2003-11-20 On Distributed Snapshots. 153-158 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#LaiY87 2003-11-20 Universal Types in Concurrent Pascal. 165-166 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Hansen75 2003-11-20 A Cascade Algorithm for the Logical Closure of a Set of Binary Relations. 50-54 1976 5 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Hansen76 2003-11-20 A Predecessor Algorithm for Ordered Lists. 137-138 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Hansen78 2003-11-24 An ENA algorithm to enhance the performance of TCP over satellite links. 215-219 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00372-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KoKL03 2003-11-20 Benign Side Effects. 301-305 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Lamb88 2003-11-20 On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph. 233-235 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#JwoT94 2003-11-20 Some Notes on Strong and Weak log log n Space Complexity. 109-112 1989 33 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Szepietowski89a 2003-11-20 A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments. 109-112 1976 4 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Hanson76 2003-11-20 Code Improvement Via Lazy Evaluation. 163-167 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Hanson80 2003-11-20 The Pagenumber of the Class of Bandwidth-k Graphs is k-1. 71-74 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#SwaminathanGB95 http://dx.doi.org/10.1016/0020-0190(95)00079-R 2003-11-20 Safe Procedural Implementations of Algebraic Types. 147-151 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Laut80 2003-11-20 On Matroids and Hierarchical Graphs. 117-121 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Fernandez-BacaW91 2003-11-20 Sending compressed messages to a learned receiver on a bidirectional line. 63-70 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Carpentieri02 http://dx.doi.org/10.1016/S0020-0190(01)00316-7 2003-11-20 Random 2-SAT and unsatisfiability. 119-123 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#Verhoeven99 http://dx.doi.org/10.1016/S0020-0190(99)00128-3 2003-11-20 Computing Values of a Polynomial with Only few Multiplications. 33-37 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Veljan94 2003-11-20 Strong Equivalence of Relational Wxpressions Under Dependencies. 57-62 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#GrahamM82 2003-11-20 Automating the Semantic Component. 299-305 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Koch87 2003-11-20 On the Calculation of Control Transition Probabilities in a Program. 273-276 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#AlankoS86 2003-11-25 Effects of broadcast errors on concurrency control in wireless broadcasting environments. 13-21 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00448-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#KooM03 2003-11-20 On the effective clustering of multidimensional data sequences. 87-95 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#LeeC01 http://dx.doi.org/10.1016/S0020-0190(01)00144-2 2003-11-20 The Power of Geometric Duality Revisited. 117-122 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#LeeC85 2003-11-20 SLR(k) Covering for LR(k) Grammars. 337-347 1991 37 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#LeeC91 2003-11-20 Grammar Coverings of a Deterministic Parser with Action Conflicts. 85-92 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#LeeC94 2003-11-20 Integrating Authentication in Public Key Distribution System. 49-52 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#LeeC96 http://dx.doi.org/10.1016/0020-0190(95)00177-8 2003-11-20 Authenticated Encryption Schemes with Linkage Between Message Blocks. 247-250 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#LeeC97 http://dx.doi.org/10.1016/S0020-0190(97)00118-X 2003-11-20 Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem. 39-45 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#LeeC99 http://dx.doi.org/10.1016/S0020-0190(98)00191-4 2003-11-25 On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle. 271-275 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00297-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#LeeH03 2003-11-20 Semantics and Properties of Existential Quantifiers in Deductive Databases. 101-108 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#LeeH93 2003-11-20 Effects of Message Loss on the Termination of Distributed Protocols. 181-188 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#KooT88 2003-11-20 An efficient nearest neighbor search in high-dimensional data spaces. 239-246 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#LeeK02 http://dx.doi.org/10.1016/S0020-0190(01)00236-8 2003-11-20 Resolving all Deadlocks in Distributed Systems. 265-271 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#LeeK95 http://dx.doi.org/10.1016/0020-0190(95)00115-S 2003-11-20 Characterization of Extended LR(k) Grammars. 75-82 1997 64 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#LeeK97 http://dx.doi.org/10.1016/S0020-0190(97)00152-X 2003-11-20 On a Circle-Cover Minimization Problem. 109-115 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#LeeL84 2003-11-20 The All Nearest-Neighbor Problem for Convex Polygons. 189-192 1978 7 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#LeeP78 2003-11-20 Parallel Batched Planar Point Location on the CCC. 175-179 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#LeeP89 2003-11-20 The All-Pairs Quickest Path Problem. 261-267 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#LeeP93 2003-11-20 The Length Sets of D0L Languages are Uniformly Bounded. 185-188 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#LeeR74 2003-11-20 Linear systolic multiplier/squarer for fast exponentiation. 105-111 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#LeeY00 http://dx.doi.org/10.1016/S0020-0190(00)00131-9 2003-11-20 Location of Multiple Points in a Planar Subdivision. 190-193 1979 9 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#LeeY79 2003-11-20 A Dynamic Scheduling Algorithm for Large Scale Multimedia Servers. 235-240 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#LeeY98 http://dx.doi.org/10.1016/S0020-0190(98)00168-9 2003-11-20 Closed form bounds for clock synchronization under simple uncertainty assumptions. 151-157 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#BiazW01 http://dx.doi.org/10.1016/S0020-0190(01)00151-X 2003-11-20 An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys. 13-16 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#CesariniS83 2003-11-20 <i>k</i>-MST Problem. 117-118 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#AryaR98 http://dx.doi.org/10.1016/S0020-0190(98)00010-6 2003-11-20 A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm. 245-252 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#SongPLPK89 2003-11-20 The Complexity of Data Flow Criteria for Test Data Selection. 103-109 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Weyuker84 2003-11-20 On a Stable Minimum Storage Merging Algorithm. 5-8 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#DudzinskiD81 2003-11-20 Solving the Hamiltonian cycle problem via an artificial neural network. 237-242 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Tambouratzis00 http://dx.doi.org/10.1016/S0020-0190(00)00116-2 2003-11-20 Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. 239-242 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Monien84 2003-11-24 Optimal reservation policy for two queues in tandem. 27-30 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00334-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KuCH03 2003-11-20 Complete Operator Precedence. 38-40 1975 4 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Levy75 2003-11-20 An Improved List-Searching Algorithm. 43-45 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Levy82 2006-04-26 The compression structure of a process. 225-229 2005 96 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2005.03.015 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl96.html#Vu05 2003-11-20 A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths. 164-167 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Kral72 2003-11-20 On Software Equations. 191-196 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Kral84 2003-11-24 Complexity of weak acceptance conditions in tree automata. 181-187 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00285-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#NeumannSW02 2003-11-20 The Morse Sequence and Iterated Morphisms. 68-70 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Pansiot81 2003-11-20 Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets. 113-117 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Ambos-Spies86 2003-11-20 Optimality of Wait-Free Atomic Multiwriter Variables. 107-112 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#LiV92a 2003-11-20 Traveling the Boundary of Minkowski Sums. 171-174 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#FeketeP98 http://dx.doi.org/10.1016/S0020-0190(98)00053-2 2004-02-04 Sharpening Occam's razor. 267-274 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00427-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#LiTV03 2003-11-20 On the Minimal Number of * Operators to Model Regularity in Fair SCCS. 297-300 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#GuessarianP88 2006-02-21 A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs. 297-300 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#PengC92 http://dx.doi.org/10.1016/0020-0190(92)90115-C 2003-11-20 Relating Bends and Size in Orthogonal Graph Drawings. 111-115 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Biedl98 http://dx.doi.org/10.1016/S0020-0190(97)00207-X 2003-11-20 Approximating the Diameter of a Set of Points in the Euclidean Space. 205-211 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#EgeciogluK89 2003-11-20 Constrained multi-object auctions and b-matching. 29-34 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#PennT00 http://dx.doi.org/10.1016/S0020-0190(00)00073-9 2003-11-20 On the Unimodality of Convex Polygons. 289-292 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Olariu88a 2003-11-20 On the Closure of Triangle-Free Graphs Under Substitution. 97-101 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Olariu90a 2003-11-20 On the approximability of two tree drawing conventions. 237-242 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Penna02 http://dx.doi.org/10.1016/S0020-0190(01)00280-0 2003-11-20 Comments on `Error Resynchronisation in Producer Consumer Systems'. 87-90 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Wurges77 2003-11-20 Welsh-Powell Opposition Graphs. 43-46 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#OlariuR89 2003-11-20 Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm. 179-183 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Hambury86 2003-11-20 A Pursuit-Evasion Problem on a Grid. 5-9 1996 58 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Neufeld96 http://dx.doi.org/10.1016/0020-0190(96)00025-7 2003-11-20 Nonconstructive Advances in Polynomial-Time Complexity. 155-162 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#FellowsL87 2003-11-20 A More Efficient Generalization of Petersons's Mutual Exclusion Algorithm. 219-222 1990 35 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#BlockW90 2003-11-20 On the Angle Restricted Nearest Neighbor Problem. 71-76 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#WeeCW90 2003-11-20 Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. 303-308 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#SajithS94 2003-11-20 Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. 305 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#SajithS95 http://dx.doi.org/10.1016/0020-0190(95)00069-O 2003-11-20 Several Practical Protocols for Authentication and Key Exchange. 91-96 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#LimL95 2003-11-20 The Most Vital Edges in the Minimum Spanning Tree Problem. 25-31 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#LinC93 2003-11-20 The Computational Complexity of the Reliability Problem on Distributed Systems. 143-147 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#LinC97 http://dx.doi.org/10.1016/S0020-0190(97)00150-6 2003-11-25 The computation of hitting sets: Review and new algorithms. 177-184 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00506-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#LinJ03 2003-11-20 Resolving error propagation in distributed systems. 257-262 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#LinK00 http://dx.doi.org/10.1016/S0020-0190(00)00060-0 2003-11-20 Minimal Fully Adaptive Wormhole Routing on Hypercubes. 297-301 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#LinL94 2003-11-20 Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time. 191-195 1999 70 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#LinL99 http://dx.doi.org/10.1016/S0020-0190(99)00058-7 2003-11-20 A Fast Parallel, Algorithm to Recognize, Partitionable Graphs. 153-157 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#LinO90 2003-11-20 Long Edges in the Layouts of Shuffle-Exchange and Cube-Connected Cycles Graphs. 5-9 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#LinS86 2003-11-20 Approximation Algorithms for Geometric Median Problems. 245-249 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#LinV92 2003-11-24 On the terminal Steiner tree problem. 103-107 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00227-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#LinX02 2003-11-20 Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length. 53-57 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#LinX99 http://dx.doi.org/10.1016/S0020-0190(98)00201-4 2003-11-20 Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems. 91-95 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#LinY99 http://dx.doi.org/10.1016/S0020-0190(99)00087-3 2003-11-20 Determining Connected Components in Linear Time by a linear Number of Processors. 401-406 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Peper87 2003-11-20 Optimal Embedding of 2-D Torus Into Ring. 227-231 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#MaNT92 2003-11-20 Characterizing the Regular Prefix Codes and Right Power-Bounded Languages. 5-7 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Veloso79 2003-11-20 On Pushout Consistency, Modularity and Interpolation for Logical Specifications. 59-66 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Veloso96 http://dx.doi.org/10.1016/S0020-0190(96)00146-9 2003-11-20 An efficient algorithm for cyclic reference counting. 145-150 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Lins02 http://dx.doi.org/10.1016/S0020-0190(01)00328-3 2004-01-02 Cyclic Reference Counting with Lazy Mark-Scan. 215-220 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Lins92 2004-01-02 Generational Cyclic Reference Counting. 19-20 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Lins93 2003-11-20 Scheduling with job release dates, delivery times and preemption penalties. 107-111 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#LiuC02 http://dx.doi.org/10.1016/S0020-0190(01)00251-4 2003-11-20 An Algorithm for Testing Lossless Join Property in Relational Databases. 73-76 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#LiuD80 2003-11-20 An Effecient Parallel Sorting Algorithm. 129-133 1992 43 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#LiuK92 2003-11-20 On Decomposing Polygons into Uniformly Monotone Parts. 85-89 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#LiuN88 2003-11-20 An Implementation of a Nonlinear Skewing Scheme. 209-215 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#LiuY92 2003-11-20 Local Calculation of Voronoi Diagrams. 307-312 1998 68 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Kuhn98 http://dx.doi.org/10.1016/S0020-0190(98)00180-X 2003-11-24 ²⁸steps. 117-124 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00269-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Biham02 2003-11-20 A Note on the Power of Integer Division. 71-72 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Vyskoc83 2003-11-20 A Note on Boolean Matrix Multiplication. 249-251 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Vyskoc84 2003-11-20 Making Bubblesort Recursive. 219-220 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Vyskoc90 2003-11-20 A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes. 31-36 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#KuoH96 http://dx.doi.org/10.1016/0020-0190(96)00089-0 2003-11-20 Assessment of Data Redundancy in Fuzzy Relational Databases Based on Semantic Inclusion Degree. 25-29 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#MaZM99 http://dx.doi.org/10.1016/S0020-0190(99)00124-6 2003-11-20 The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching. 261-263 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#KuoT90 2003-11-20 A New Upper Bound on the Complexity of Derivative Evaluation. 146-147 1973 2 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Kung73 2003-11-20 Understanding the Complexity of Interpolation Search. 219-222 1977 6 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#PerlR77 2003-11-20 <i>t</i><i>t</i>+ 1 Rounds. 155-158 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#AguileraT99 http://dx.doi.org/10.1016/S0020-0190(99)00100-3 2003-11-20 Exact Computation of Steiner Minimal Trees in the Plane. 151-156 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#CockayneH86 2003-11-20 Comments on Convex Hull of a Finite Set of Points in Two Dimensions. 173 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Fournier79 2003-11-20 Optimum Extensions of Prefix Codes. 35-40 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Mandoiu98 http://dx.doi.org/10.1016/S0020-0190(98)00026-X 2003-11-20 ⁿmoduli set. 51-56 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Premkumar00 http://dx.doi.org/10.1016/S0020-0190(00)00077-6 2003-11-20 Efficient Test & Set Constructions for Faulty Shared Memory. 41-46 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#OrdaM97 http://dx.doi.org/10.1016/S0020-0190(97)00036-7 2003-11-20 On a Cyclic String-To-String Correction Problem. 73-78 1990 35 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Maes90 2003-11-20 A Representation of Disjoint Sets with Fast Initialization. 21 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Perko83 2003-11-20 The maximum f-depth spanning tree problem. 179-187 2001 80 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#Monnot01 http://dx.doi.org/10.1016/S0020-0190(01)00160-0 2003-11-20 Differential approximation results for the traveling salesman and related problems. 229-235 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Monnot02 http://dx.doi.org/10.1016/S0020-0190(01)00287-3 2003-11-20 Permutations Are Not Context-Free: An Application of the Interchange Lemma. 68-71 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Main82 2003-11-20 An Infinite Square-Free co-CFL. 105-107 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Main85 2003-11-24 The Level-Ancestor problem on Pure Pointer Machines. 275-283 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00428-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#RanjanP03 2003-11-20 A Tool for the Analysis of Manipulation. 117-121 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#RanjanR93 2003-11-20 Complexity Versus Stability for Classes of Propositional Formulas. 161-165 1998 68 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Creignou98 http://dx.doi.org/10.1016/S0020-0190(98)00163-X 2004-06-08 A Study of Page Arrangements for Extendible Hashing. 245-248 1988 27 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Weems88 http://dx.doi.org/10.1016/0020-0190(88)90086-5 2003-11-20 Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. 221-226 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#CrescenziS90 2003-11-20 A Note on the Descriptive Complexity of Maximization. 11-15 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#CrescenziS93 2003-11-20 Digital signature algorithm for securing digital identities. 247-252 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Kwon02 http://dx.doi.org/10.1016/S0020-0190(01)00277-0 2003-11-25 Erratum to: "Digital signature algorithm for securing digital identities": [Information Processing Letters 82 (2002) 247-252]. 201-202 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Kwon03 2003-11-20 Study of Self-Organizing Heuristics for Skewed Access Patterns. 237-244 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#ChngSO89 2003-11-20 How to Prevent Interaction of Functional and Inclusion Dependencies. 115-125 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#LeveneL99 http://dx.doi.org/10.1016/S0020-0190(99)00095-2 2003-11-20 Round-Optimal Perfect Zero-Knowledge Proofs. 93-99 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#CrescenzoP94 2003-11-20 New Statistics for Demand-Based Software Testing. 307-314 1995 53 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#MayL95 http://dx.doi.org/10.1016/0020-0190(94)00217-M 2003-11-20 A Non-Hamiltonian, Nondegenerate Delaunay Triangulation. 149-151 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Dillencourt87a 2003-11-20 Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs. 249-252 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Supowit85 2003-11-20 An O(n log n) Algorithm for Finding Dissimilar Strings. 135-139 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#AbbasiS97 http://dx.doi.org/10.1016/S0020-0190(97)00057-4 2003-11-20 Tight Lower Bounds on the Length of Word Chains. 275-276 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Althofer90 2003-11-20 Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. 156-161 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Frederickson80 2003-11-20 Scheduling Unit-Time Tasks With Integer Release Times and Deadlines. 171-173 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Frederickson83 2003-11-20 On Linear-Time Algorithms for Five-Coloring Planar Graphs. 219-224 1984 19 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Frederickson84 2003-11-20 Timed Automata and Recognizability. 313-318 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Herrmann98 http://dx.doi.org/10.1016/S0020-0190(97)00217-2 2003-11-20 Self-Modifying Finite Automata: An Introduction. 185-190 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#RubinsteinS95 http://dx.doi.org/10.1016/0020-0190(95)00157-8 2003-11-20 On vertex ranking of a starlike graph. 131-135 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Hsieh02 http://dx.doi.org/10.1016/S0020-0190(01)00262-9 2003-11-20 Comments on ``Always-True is not Invariant'': Assertional Reasoning About Invariance. 231-233 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Pettersson91 2003-11-25 An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution. 229-234 2003 87 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(03)00311-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Long03 2003-11-20 Halfspace Learning, Linear Programming, and Nonmalicious Distributions. 245-250 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Long94 2003-11-20 The Order of Appel's Algorithm. 141-147 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Esseling92 2003-11-20 On-Line Longest Fragment First Parsing Algorithm. 91-96 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#NagumoLW96 http://dx.doi.org/10.1016/0020-0190(96)00066-X 2003-11-20 An Efficient Strategy for Robot Navigation in Unknown Environment. 51-56 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#MeiI94 2003-11-20 A Polynomial Time Solvable Instance of the Feasible Minimum Cover Problem. 141-146 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Low98a http://dx.doi.org/10.1016/S0020-0190(98)00154-9 2003-11-20 A Note on the Pebble Game. 24-26 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Loui80 2003-11-20 An Attack on the Needham-Schroeder Public-Key Authentication Protocol. 131-133 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Lowe95 http://dx.doi.org/10.1016/0020-0190(95)00144-2 2003-11-20 Lower Bounds of the Complexity of Linear Algebras. 46-47 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#BiniC79 2003-11-20 Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power. 79-81 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#BiniP85 2003-11-20 A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division. 233-237 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#BiniP87 2006-10-05 A Probabilistic Algorithm for Vertex Connectivity of Graphs. 135-136 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#BeckerDDHKKMNRW82 2003-11-20 Linear-Time Construction of Treaps and Cartesian Trees. 253-257 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Weiss94 2003-11-20 A Note on Construction of Treaps and Cartesian Trees. 127 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Weiss95 http://dx.doi.org/10.1016/0020-0190(94)00234-P 2003-11-20 Completeness Results Concerning Systolic Tree Automata and EOL Languages. 11-16 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#MontiR95 http://dx.doi.org/10.1016/0020-0190(94)00170-4 2003-11-20 A Gap Theorem for the Anonymous Torus. 279-285 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#MontiR96 http://dx.doi.org/10.1016/0020-0190(95)00197-2 2003-11-20 A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m. 117-120 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#LuCW94 2003-11-20 What is an Abstract Datatype? 42-43 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Bergstra78 2003-11-20 Computing the Number of Mergings with Constraints. 289-292 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#AtkinsonC87 2003-11-20 Guarding in a simple polygon. 153-158 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#LuHT00 http://dx.doi.org/10.1016/S0020-0190(00)00100-9 2003-11-20 A Practical Algorithm for Boolean Matrix Multiplication. 37-38 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#AtkinsonS88 2003-11-20 Generating Binary Trees at Random. 21-23 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#AtkinsonS92 2003-11-20 Uniform Generation of Forests of Restricted Height. 323-327 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#AtkinsonS94 2003-11-20 Transformational vs Reactive Refinement in Real-Time Systems. 201-210 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#AtkinsonS95 http://dx.doi.org/10.1016/0020-0190(95)00095-T 2003-11-20 Pop-Stacks in Parallel. 63-67 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#AtkinsonS99 http://dx.doi.org/10.1016/S0020-0190(99)00049-6 2003-11-20 Enumerating k-Way Trees. 73-75 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#AtkinsonW93 2003-11-20 Faster broadcasting in unknown radio networks. 53-56 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#MarcoP01 http://dx.doi.org/10.1016/S0020-0190(00)00178-2 2003-11-20 Broadcasting in Hypercubes and Star Graphs with Dynamic Faults. 321-326 1998 66 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#MarcoV98 http://dx.doi.org/10.1016/S0020-0190(98)00074-X 2003-11-20 Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment. 29-32 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Fisher74 2005-05-23 Graphs which Locally Mirror the Hypercube Structure. 87-90 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#KlavzarKM99 http://dx.doi.org/10.1016/S0020-0190(99)00089-7 2003-11-20 A Note on Implementing Prolog in Lisp. 261-264 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Stojanovski86 2003-11-20 Steiner trees in uniformly quasi-bipartite graphs. 195-200 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#GroplHNP02 http://dx.doi.org/10.1016/S0020-0190(01)00335-0 2003-11-24 A combinatorial characterization of regular anonymous perfect threshold schemes. 131-135 2003 85 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00368-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Miao03 2003-11-20 Synchronous Communication Between Asynchronous Components. 127-130 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Snepscheut81 2003-11-20 Evaluating Expressions with a Queue. 65-66 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Snepscheut85 2003-11-20 "Algorithms for On-the-Fly Garbage Collection" Revisited. 211-216 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Snepscheut87 2003-11-20 Inversion of a Recursive Tree Traversal. 265-267 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Snepscheut91 2003-11-20 A LISP Programming Exercise. 103-108 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Snepscheut92 2003-11-20 Complexity of Solving Algebraic Equations. 178-179 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#FraenkelY80 2003-11-20 The alpha-beta Algorithm: An Exercise in Program Transformation. 53-57 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#BirdH87 2003-11-20 P_4-laden Graphs: A New Class of Brittle Graphs. 29-36 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Giakoumakis96 http://dx.doi.org/10.1016/S0020-0190(96)00134-2 2003-11-20 On Computing Representatives. 1-7 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BirdR97 http://dx.doi.org/10.1016/S0020-0190(97)00087-2 2003-11-20 Verifying Programs by Induction on Their Data Structure: General Format and Applications. 155-160 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Mili83 2003-11-20 A Combinatorial Property of the Fibonacci Words. 193-195 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Luca81 2003-11-20 A Division Property of the Fibonacci Word. 307-312 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Luca95 http://dx.doi.org/10.1016/0020-0190(95)00067-M 2003-11-20 A Note on Array Grammars. 51-54 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Yodogawa84 2003-11-20 Constructing the Visibility Graph for n-Line Segments in O(n²) Time. 167-171 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Welzl85 2003-11-20 Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines. 265-269 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Gergov94 2003-11-20 Optimality of Intuitive Checkpointing Policies. 63-66 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Magazine83 2003-11-20 Why is the 3D Delaunay Triangulation Difficult to Construct. 275-280 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#SugiharaI95 http://dx.doi.org/10.1016/0020-0190(95)00028-B 2003-11-20 On the performance of the first-fit coloring algorithm on permutation graphs. 265-273 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#NikolopoulosP00 http://dx.doi.org/10.1016/S0020-0190(00)00109-5 2004-04-30 On the Number of Spanning Trees of Multi-Star Related Graphs. 183-188 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#NikolopoulosR98 http://dx.doi.org/10.1016/S0020-0190(98)00008-8 2003-11-20 Attacks on Okamoto and Tanaka's One-Way ID-Based Key Distribution System. 81-86 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Hwang92a 2003-11-20 Efficient ID-Based Key Distribution with Tamperfree Devices. 31-34 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Hwang92b 2003-11-20 On the Security of SPLICE/AS - The Authentication System in WIDE Internet. 91-101 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#HwangC95 http://dx.doi.org/10.1016/0020-0190(94)00178-2 2003-11-20 A note on cyclic-cubes. 131-135 1999 72 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#HwangC99 http://dx.doi.org/10.1016/S0020-0190(99)00138-6 2003-11-20 Some Proofs of Data Refinement. 179-185 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Lutz90 2006-06-29 Sequential construction of a circular consecutive-2 system. 231-235 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#HwangP00 http://dx.doi.org/10.1016/S0020-0190(00)00106-X 2003-11-20 Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders. 189-193 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#HwangW98 http://dx.doi.org/10.1016/S0020-0190(98)00011-8 2003-11-20 In-Place Random List Permutations. 255-257 1999 70 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#HwangW99 http://dx.doi.org/10.1016/S0020-0190(99)00076-9 2003-11-20 On the Convergence of Difference Schemes Approximating a Plane Static Problem of the Theory of Elasticity with Mixed Boundary Conditions. 118- 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#MolchanovG73 2003-11-20 On One Class of Iterative Methods for Obtaining the Generalized Solution of Non-Consistent Systems of Linear Algebraic Equations. 86-90 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#MolchanovI73 2003-11-20 On an Approach to Integrating Boundary Problems With a Non-Unique Solution. 168-172 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#MolchanovN72 2003-11-20 Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis. 249-252 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#YoussefT95 http://dx.doi.org/10.1016/0020-0190(95)00156-6 2003-11-20 Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion". 271-275 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#YoussefT96 http://dx.doi.org/10.1016/S0020-0190(96)00166-4 2003-11-20 Iterative Methods for Solving Difference Equations of the Theory of Elasticity not Depending on the Spacing of the Difference Set. 205-210 1972 1 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#MolchanovS72 2003-11-20 On Hypergraph Acyclicity and Graph Chordality. 271-274 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#DAtriM88 2003-11-20 An Optimal Algorithm for Generating Minimal Perfect Hash Functions. 257-264 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#CzechHM92 2003-11-20 A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue. 397-401 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#MarieT87 2003-11-20 Wait-free Byzantine consensus. 221-227 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Attie02 http://dx.doi.org/10.1016/S0020-0190(01)00334-9 2003-11-20 A Fast Parallel Coloring of Planar Graphs with Five Colors. 51-53 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Naor87 2003-11-20 Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables. 227-232 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#CasasDS89