2002-01-03 Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. 253-301 1999 30 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#NagamochiI99 2005-02-16 A General Best First Search Algorithm in AND/OR Graphs. 177-187 1992 13 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#ChakrabartiG92 2002-01-03 On the Complexity of Some Algorithms of Matrix Multiplication. 71-85 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Alekseyev85 2002-01-03 Computing the Extreme Distances Between Two Convex Polygons. 213-224 1985 6 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Edelsbrunner85 2002-07-09 Multiplying Schur functions. 471-487 1984 5 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#RemmelW84 2006-11-07 An Efficient Algorithm for Controller Synthesis under Full Observation. 144-161 1997 25 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal25.html#BarbeauKS97 2003-06-23 Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. 174-211 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1183 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#FeigeL01 2003-06-23 A multivariate view of random bucket digital search trees. 121-158 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00210-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#HubalekHLMP02 2002-01-03 Complexity Results for Scheduling Tasks with Discrete Starting Times. 344-361 1982 3 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#NakajimaH82 2002-01-03 Confluently Persistent Deques via Data-Structural Bootstrapping. 513-547 1995 18 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#BuchsbaumT95 2002-01-03 Faster Construction of Optimal Binary Split Trees. 412-424 1986 7 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#HesterHHW86 2002-01-03 Some Open Problems in Computational Molecular Biology. 194-201 2000 34 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#JiangKL00 2002-01-03 A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. 89-101 2000 36 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal36.html#PromelS00 2002-01-03 Decomposable Searching Problems I: Static-to-Dynamic Transformation. 301-358 1980 1 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#BentleyS80 2002-01-03 Generating Sparse 2-Spanners. 222-236 1994 17 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#KortsarzP94 2002-01-03 Online Scheduling with Hard Deadlines. 370-389 2000 34 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#GoldmanPS00 2002-01-03 In Memoriam: Paris C. Kanellakis (1953-1995). 203-204 1996 20 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#Shvartsman96 2002-01-03 Edge-Coloring Bipartite Graphs. 390-396 2000 34 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#KapoorR00 2002-01-03 Placing Resources on a Growing Line. 87-100 1998 26 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#AulettaPP98 2002-01-03 Identification of Algebraic Numbers. 197-204 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Mignotte82 2002-01-03 Faster Computation of Bernoulli Numbers. 431-445 1992 13 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Fillebrown92 2003-06-23 Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True. 304-316 2002 42 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2002.1212 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#BahigN02 2003-06-23 Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": [J. Algorithms 42 (2002) 304-316]. 60-61 2003 47 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00016-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal47.html#BahigN03 2002-01-03 Online Navigation in a Room. 319-341 1994 17 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#Bar-EliBFY94 2002-01-03 Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. 218-235 1998 27 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#KenyonRS98 2002-01-03 Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization. 160-176 1982 3 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#VaishnaviW82 2003-06-23 Deterministic Dictionaries. 69-85 2001 41 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#HagerupMP01 2002-01-03 k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh. 361-382 1995 19 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#Rajasekaran95 2002-01-03 Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses. 68-81 1998 29 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#Rajasekaran98 2002-01-03 An Optimal Algorithm for Geometrical Congruence. 159-172 1987 8 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Atkinson87 2002-01-03 Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. 339-356 1998 27 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#LuptonMY98 2002-01-03 Finding Approximate Patterns in Strings. 132-137 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Ukkonen85 2002-01-03 Searching and Sorting Real Numbers. 1-12 1981 2 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Ehrlich81 2002-01-03 Sylow Subgroups in Parallel. 132-195 1999 31 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#KantorLM99 2002-01-03 Approximation Algorithms for Directed Steiner Problems. 73-91 1999 33 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#CharikarCCDGGL99 2002-01-03 A 5/4 Algorithm for Two-Dimensional Packing. 348-368 1981 2 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#BakerBK81 2002-01-03 Polygon Containment under Translation. 532-548 1986 7 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#BakerFM86 2002-01-03 The Las-Vegas Processor Identity Problem (How and When to Be Unique). 468-494 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#KuttenOP00 2002-01-03 Conway's Parallel Sorting Algorithm. 270-276 1986 7 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#Warshauer86 2003-06-23 Fountains and histograms. 159-176 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00211-0 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#MerliniS02 2002-01-03 The Parallel Complexity of Tree Embedding Problems. 176-200 1995 18 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#GuptaN95 2002-01-03 Constructing Piecewise Linear Homeomorphisms of Simple Polygons. 142-157 1997 22 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#GuptaW97 2002-01-03 Rectangular Tiling in Multidimensional Arrays. 451-467 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#SmithS00 2002-01-03 On-Line Planar Graph Embedding. 201-239 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#Tamassia96 2002-01-03 On the Approximation of Maximum Satisfiability. 475-502 1994 17 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#Yannakakis94 2002-01-03 On-Line Bin Packing in Linear Time. 305-326 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#RamananBLL89 2002-01-03 Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. 1-24 1995 19 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#TorreK95 2002-01-03 A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys. 217-295 1997 22 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#TorreK97 2002-01-03 Superlinear Bounds for Matrix Searching Problems. 55-78 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Klawe92 2002-01-03 An Incremental Algorithm for a Generalization of the Shortest-Path Problem. 267-305 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#RamalingamR96 2002-01-03 Finding the Smallest Triangles Containing a Given Convex Polygon. 359-375 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#KleeL85 2002-01-03 Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs. 331-343 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#Klein93 2002-01-03 Box-Rectangular Drawings of Plane Graphs. 363-398 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#RahmanNN00 2002-01-03 Covering Polygons Is Hard. 2-44 1994 17 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#CulbersonR94 2002-01-03 A Parallel Algorithm for Constructing Minimum Spanning Trees. 51-59 1980 1 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#Bentley80 2002-01-03 A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation. 303-316 1982 3 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#BakerC82 2003-06-23 Sparse Dynamic Programming for Longest Common Subsequence from Fragments. 231-254 2002 42 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2002.1214 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#BakerG02 2002-01-03 How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph. 170-217 1998 27 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#ProppW98 2002-01-03 Self-Alignments in Words and Their Applications. 446-467 1992 13 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#ApostolicoS92 2002-01-03 Improved Approximation Algorithms for Uniform Connectivity Problems. 434-450 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#KhullerR96 2002-01-03 Approximation Algorithms for Graph Augmentation. 214-225 1993 14 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#KhullerT93 2003-09-16 Compact floor-planning via orderly spanning trees. 441-451 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00057-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#LiaoLY03 2002-01-03 A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications. 45-56 1982 3 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#IbarraMH82 2002-01-03 On Efficient Parallel Algorithms for Solving Set Recurrence Equations. 244-257 1993 14 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#IbarraWJ93 2002-01-03 Traversing Layered Graphs Using the Work Function Algorithm. 479-511 1996 20 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#Burley96 2002-01-03 An O(n² log n) Parallel MAX-FLOW Algorithm. 128-146 1982 3 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#ShiloachV82a 2003-06-23 A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs. 255-276 2002 42 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1206 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#Damian-IordacheP02 2002-01-03 How Many Comparisons Does Quicksort Use? 402-431 1995 19 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#EddyS95 2002-01-03 Fairness in Scheduling 306-357 1998 29 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#AjtaiANRSW98 2003-09-16 Optimal mappings with minimum number of connected components in tree-to-tree comparison problems. 385-406 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00079-8 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#FerraroG03 2002-01-03 On Selecting a Random Shifted Young Tableau. 213-234 1980 1 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#Sagan80 2002-01-03 Simplified Stable Merging Tasks. 557-571 1987 8 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#SaloweS87 2002-01-03 An Optimal Contour Algorithm for Iso-Oriented Rectangles. 303-326 1984 5 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Guting84 2003-06-23 An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms. 177-225 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00208-0 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#ChernHT02 2002-01-03 Edge Separators of Planar and Outerplanar Graphs with Applications. 258-279 1993 14 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#DiksDSV93 2003-06-23 Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. 303-333 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#DuncanGK01 2002-01-03 The Byzantine Generals Strike Again. 14-30 1982 3 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Dolev82 2003-06-23 The k-Client Problem. 115-173 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1182 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#AlborziTUW01 2002-01-03 Self-Simulation for the Passive Optical Star. 128-147 2000 34 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#BerthomeHNS00 2002-01-03 Optimal Space Distributed Order-Preserving Lists. 320-334 1999 31 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#SaksZ99 2002-01-03 Dynamic Text Indexing under String Updates. 296-328 1997 22 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#Ferragina97 2002-01-03 A Gray Code for the Ideals of a Forest Poset. 324-340 1993 15 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#KodaR93 2002-01-03 Treewidth of Chordal Bipartite Graphs. 266-281 1995 19 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#KloksK95 2002-01-03 Fixed-Bucket Binary Storage Trees. 276-287 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Knott82 2002-01-03 Direct-Chaining with Coalescing Lists. 7-21 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Knott84 2003-06-23 Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. 443-470 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1188 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#BermanDMR01 2002-01-03 Parameterizing above Guaranteed Values: MaxSat and MaxCut. 335-354 1999 31 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#MahajanR99 2002-01-03 Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. 278-296 1995 18 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#Breslauer95 2002-01-03 Dynamic Huffman Coding. 163-180 1985 6 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Knuth85 2002-01-03 An Exact Analysis of Stable Allocation. 431-442 1996 20 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#Knuth96 2002-01-03 Computing Normalizers in Permutation Groups. 163-175 1983 4 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Butler83 2003-06-23 Using Homogeneous Weights for Approximating the Partial Cover Problem. 137-144 2001 39 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal39.html#Bar-Yehuda01 2002-01-03 NC-Algorithms for Minimum Link Path and Related Problems. 173-203 1995 19 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#ChandruGMRS95 2002-10-18 Cyclic Interlaced Quadtree Algorithms for Quincunx Multiresolution. 97-128 1998 27 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#Hebert98 2003-09-16 Vector assignment problems: a general framework. 360-384 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00055-5 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#EpsteinT03 2003-06-23 Eliminating Migration in Multi-processor Scheduling. 2-24 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#KalyanasundaramP01 2003-11-20 Maximizing job completions online. 63-85 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00074-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#KalyanasundaramP03 2002-01-03 Online Weighted Matching. 478-488 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#KalyanasundaramP93 2002-01-03 Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms. 106-143 1999 30 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#AfekMO99 2002-01-03 A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. 114-127 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Bang-JensenMT92 2002-01-03 The Analysis of a Simple In-Place Merging Algorithm. 366-380 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#Sprugnoli89 2002-01-03 An Optimal Algorithm for Finding Minimal Enclosing Triangles. 258-269 1986 7 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#ORourkeAMB86 2002-01-03 Multiple Optima in Local Search. 250-259 1987 8 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#RodlT87 2003-09-16 A linear lower bound on index size for text retrieval. 2-15 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00043-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#DemaineL03 2003-06-23 On Minimum Edge Ranking Spanning Trees. 411-437 2001 38 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#MakinoUI01 2002-01-03 A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. 567-583 1986 7 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#AlonBI86 2002-01-03 Better Expanders and Superconcentrators. 337-347 1987 8 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#AlonGM87 2003-09-16 A better algorithm for sequencing with release and delivery times on identical machines. 273-293 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00072-5 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#Vakhania03 2002-01-03 Gauss' Algorithm Revisited. 556-572 1991 12 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#Vallee91 2003-06-23 Computing Chow Forms and Some Applications. 52-68 2001 41 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#JeronimoPS01 2002-01-03 Dynamic Point Location in General Subdivisions. 342-380 1994 17 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#BaumgartenJM94 2002-01-03 Open Problems Presented at SCG'98. 449-453 1999 30 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#KhullerAO99 2002-01-03 Acyclic Hypergraph Projections. 400-422 1999 30 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#LustigS99 2002-01-03 Bases for Polynomial Invariants of Conjugates of Permutation Groups. 58-61 1999 32 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal32.html#KhullerGW99 2002-01-03 An Algorithm for Parallel Evaluation of Functions. 271-281 1983 4 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Lozinskii83 2003-09-16 Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. 333-359 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00073-7 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#CalinescuFR03 2002-01-03 A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. 280-289 1994 17 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#KhullerVY94 2002-01-03 Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs. 22-35 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Leung84 2002-01-03 Analysis of an Algorithm for Composition of Binary Quadratic Forms. 157-159 1982 3 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Iliopoulos82 2002-01-03 Fast Parallel and Serial Approximate String Matching. 157-169 1989 10 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#LandauV89 2003-06-23 On the Common Substring Alignment Problem. 338-359 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1191 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#LandauZ01 2002-01-03 A Contraction Algorithm for Finding Small Cycle Cutsets. 470-493 1988 9 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#LevyL88 2002-01-03 Two-Connected Augmentation Problems in Planar Graphs. 87-107 1999 32 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal32.html#ProvanB99 2002-01-03 Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids. 140-165 1999 33 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#LopezR99 2003-06-23 Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. 277-303 2002 42 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2002.1213 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#BradfordGLR02 2002-01-03 Robust Linear Algorithms for Cutsets. 205-217 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Rosen82 2002-01-03 Partitioning with Two Lines in the Plane. 430-433 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Megiddo85 2002-01-03 A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. 66-84 2000 37 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#GargKR00 2003-06-23 Digital Access to Comparison-Based Tree Data Structures and Algorithms. 1-23 2001 40 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal40.html#Roura01 2003-11-20 Matching planar maps. 262-283 2003 49 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00085-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#AltERW03 2002-01-03 A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation. 548-585 1995 18 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#Ruppert95 2002-01-03 Algorithms for a Core and k-Tree Core of a Tree. 143-159 1993 15 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#PengSY93 2002-01-03 An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order. 281-283 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Semba84 2002-01-03 Designing Least-Cost Nonblocking Broadband Networks. 287-309 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#FingerhutST97 2002-01-03 Analysis of Hashing with Chaining in the Prime Area. 36-47 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Larson84 2002-01-03 Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. 33-54 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#EppsteinITTWY92 2002-01-03 Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. 173 1993 15 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#EppsteinITTWY93 2002-01-03 Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. 251-281 2000 34 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#FrigioniMN00 2003-11-20 Fully dynamic shortest paths in digraphs with arbitrary arc weights. 86-113 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00082-8 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#FrigioniMN03 2002-01-03 Page Migration Algorithms Using Work Functions. 124-157 1997 24 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#ChrobakLRW97 2002-01-03 New Upper Bounds for Maximum Satisfiability. 63-88 2000 36 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal36.html#NiedermeierR00 2003-06-23 On efficient fixed-parameter algorithms for weighted vertex cover. 63-77 2003 47 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00005-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal47.html#NiedermeierR03 2002-01-03 On a Conjecture by Plaisted and Hong. 597-598 1988 9 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#OlariuTZ88 2002-01-03 Randomized On-Line Scheduling of Parallel Jobs. 149-175 1996 21 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#Sgall96 2002-01-03 Optimal Point Placement for Mesh Smoothing. 302-322 1999 30 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#AmentaBE99 2006-04-19 On the average performance of orthogonal range search in multidimensional data structures. 226-245 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00213-4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#DuchM02 2003-11-20 Analogs & duals of the MAST problem for sequences & trees. 192-216 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00081-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#FellowsHS03 2002-01-03 A Parallel Fault Identification Algorithm. 231-241 1990 11 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#SchmeichelHOS90 2002-01-03 On-Line Paging Against Adversarially Biased Random Inputs. 218-235 2000 37 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#Young00 2002-01-03 Unranking and Ranking Spanning Trees of a Graph. 271-286 1989 10 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#ColbournDN89 2002-01-03 Two Algorithms for Unranking Arborescences. 268-281 1996 20 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#ColbournMN96 2002-01-03 Convex Hulls for Random Lines. 381-394 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#DevroyeT93 2002-01-03 Fast Randomized Consensus Using Shared Memory. 441-461 1990 11 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#AspnesH90 2002-01-03 Spreading Rumors Rapidly Despite an Adversary. 386-411 1998 26 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#AspnesH98 2003-06-23 Fast deterministic consensus in a noisy environment. 16-39 2002 45 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00220-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal45.html#Aspnes02 2002-01-03 Time- and Space-Efficient Randomized Consensus. 414-431 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#Aspnes93 2002-01-03 Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. 416-446 1993 15 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#BoothT93 2002-01-03 Distributed Paging for General Networks. 67-104 1998 28 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#AwerbuchBF98 2003-11-20 Fitting points on the real line and its application to RH mapping. 42-62 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00083-X http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#HastadIL03 2002-01-03 A Survey of Fast Exponentiation Methods. 129-146 1998 27 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#Gordon98 2002-01-03 Data Structures for Mobile Data. 1-28 1999 31 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#BaschGH99 2002-01-03 Self-Adjusting k-ary Search Trees. 25-44 1995 19 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#Sherk95 2002-01-03 Gray Codes for the Ideals of Interval Orders. 52-66 1997 25 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal25.html#HabibNS97 2002-01-03 Factorizing Words over an Ordered Alphabet. 363-381 1983 4 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Duval83 2002-01-03 <i>k</i>-Trees. 325-369 1998 26 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#NarayananN98 2002-01-03 Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. 291-328 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#HighamKAA97 2002-01-03 The Variance of Two Game Tree Algorithms. 21-39 1998 28 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#Zhang98 2003-06-23 A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. 162-204 2001 39 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal39.html#AnderssonEH01 2002-01-03 Realization of Matrices and Directed Graphs. 61-74 1998 27 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#Motwani98 2002-01-03 Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling. 140-150 1989 10 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#CypherSS89 2002-01-03 Inverse Pattern Matching. 325-339 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#AmirAL97 2002-01-03 Optimal Two-Dimensional Compressed Matching. 354-379 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#AmirBF97 2002-01-03 Domino Treewidth. 94-123 1997 24 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#BodlaenderE97 2003-06-23 Approximation of pathwidth of outerplanar graphs. 190-200 2002 43 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00001-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#BodlaenderF02 2003-06-23 Kayles and Nimbers. 106-119 2002 43 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2002.1215 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#BodlaenderK02 2002-01-03 A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. 160-172 1993 15 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#BodlaenderK93 2002-01-03 Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. 358-402 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#BodlaenderK96 2003-06-23 Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. 138-152 2002 43 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2002.1221 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#GaurIK02 2002-01-03 Graphs with Branchwidth at Most Three. 167-194 1999 32 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal32.html#BodlaenderT99 2002-01-03 Pattern Matching in Hypertext. 82-99 2000 35 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal35.html#AmirLL00 2003-11-20 Inplace 2D matching in compressed images. 240-261 2003 49 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00088-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#AmirLS03 2002-01-03 Efficient Pattern Matching with Scaling. 2-32 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#AmirLV92 2002-01-03 SODA '95 Papers. 203 1998 29 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#Clarkson98 2002-01-03 Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms. 223-265 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#GiancarloG97 2002-01-03 Isomorph-Free Exhaustive Generation. 306-324 1998 26 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#McKay98 2003-06-23 Polynomial time approximation schemes for general multiprocessor job shop scheduling. 167-191 2002 45 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00248-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal45.html#JansenP02 2002-01-03 Shortest-Path Routing in Arbitrary Networks. 105-131 1999 31 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#HeideV99 2002-01-03 Optimal Expected-Time Algorithms for Merging. 341-357 1986 7 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#ThanhAB86 2002-01-03 <i>n</i><i>n</i>Algorithm for Online BDD Refinement. 133-154 1999 32 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal32.html#Klarlund99 2002-01-03 An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. 18-46 1988 9 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#HershbergerG88 2002-01-03 Finding Tailored Partitions. 431-463 1991 12 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#HershbergerS91 2002-01-03 A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. 403-431 1995 18 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#HershbergerS95 2002-01-03 Off-Line Maintenance of Planar Configurations. 453-475 1996 21 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#HershbergerS96 2002-01-03 Fast Algorithms forK4Immersion Testing. 344-378 1999 30 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#BoothGLR99 2003-06-23 Constructing set systems with prescribed intersection sizes. 321-337 2002 44 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00204-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#Grolmusz02 2002-01-03 An O(n log n) Algorithm for Finding All Repetitions in a String. 422-432 1984 5 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#MainL84 2003-06-23 On the complexity of bicoloring clique hypergraphs of graphs. 40-54 2002 45 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00221-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal45.html#KratochvilT02 2002-01-03 Generating the Maximum Spanning Trees of a Weighted Graph. 592-597 1987 8 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Gavril87 2003-09-16 Dynamic TCP acknowledgment in the LogP model. 407-428 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00058-0 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#FrederiksenLNU03 2002-01-03 Average Case Analysis of Heap Building by Repeated Insertion. 126-153 1991 12 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#HaywardM91 2002-01-03 Planar 3DM is NP-Complete. 174-184 1986 7 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#DyerF86 2002-01-03 The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. 451-489 1989 10 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#DyerF89 2002-01-03 On Markov Chains for Independent Sets. 17-49 2000 35 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal35.html#DyerG00 2002-01-03 An Algorithm for the Determination of the Variance of a Partially Ordered Set. 441-448 1995 19 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#Engel95 2002-01-03 An O(n log m) Algorithm for the Josephus Problem. 262-270 1983 4 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Lloyd83 2002-01-03 The Parallel Complexity of TSP Heuristics. 249-270 1989 10 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#KindervaterLS89 2002-01-03 A Linear Algorithm for Nonhomogeneous Spectra of Numbers. 187-198 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#BoshernitzanF84 2002-01-03 Using Separation Algorithms in Fixed Dimension. 79-98 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#NortonPT92 2002-01-03 Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds. 323-343 1999 30 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#ChudakS99 2002-01-03 NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. 238-274 1998 26 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#HuntMRRRS98 2002-01-03 Approximation Algorithms for Min-Max Tree Partition. 266-286 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#Guttmann-BeckH97 2002-01-03 The Traveler's Problem. 148-160 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#HirschbergL92 2002-01-03 A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. 194-220 1997 24 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#Henzinger97 2002-01-03 An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree. 105-119 1986 7 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#Tiwari86 2002-01-03 Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. 296-318 1999 33 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#BertsimasG99 2002-01-03 Nonpreemptive Ensemble Motion Planning on a Tree. 29-60 1993 15 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#FredericksonG93 2002-01-03 Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. 61-80 1983 4 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#FredericksonJ83 2002-01-03 Increasing the Weight of Minimum Spanning Trees. 244-266 1999 33 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#FredericksonS99 2002-01-03 Range Searching and Point Location among Fat Objects. 629-656 1996 21 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#OvermarsS96 2002-01-03 On Rectangular Visibility. 372-390 1988 9 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#OvermarsW88 2002-01-03 Random Spanning Tree. 214-220 1983 4 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Guenoche83 2002-01-03 Tree Powers. 111-131 1998 29 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#KearneyC98 2002-01-03 Improved Routing Strategies with Succinct Tables. 307-341 1990 11 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#AwerbuchBLP90 2003-06-23 Limit laws for the height in PATRICIA tries. 63-97 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00212-2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#KnesslS02 2003-06-23 Approximation Algorithms for Dispersion Problems. 438-465 2001 38 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#ChandraH01 2002-01-03 Constructing Reliable Communication Networks of Small Weight Online. 159-175 1995 18 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#ChandraV95 2002-01-03 Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. 303-338 1998 27 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#LevcopoulosK98 2002-01-03 Adaptive Heapsort. 395-413 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#LevcopoulosP93 2002-01-03 Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. 137-149 1983 4 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Feig83a 2002-01-03 The Greedy Coloring Is a Bad Probabilistic Algorithm. 674-684 1991 12 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#Kucera91 2002-01-03 Generating Coset Representatives for Permutation Groups. 227-244 1981 2 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Allison81 2002-02-21 The Set of Minimal Braids is co-NP-Complete. 393-408 1991 12 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#PatersonR91 2002-02-21 Point Retrieval for Polygons. 441-447 1986 7 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#PatersonY86 2002-02-21 Optimal Binary Space Partitions for Orthogonal Objects. 99-113 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#PatersonY92 2002-01-03 The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms. 241-264 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#BartalR97 2002-01-03 Scheduling Interval Ordered Tasks in Parallel. 34-47 1998 26 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#SunderH98 2002-01-03 Approximation Algorithms for Steiner and Directed Multicuts. 241-269 1997 22 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#KleinPRT97 2002-01-03 A Randomized Parallel Algorithm for Planar Graph Isomorphism. 290-314 1998 28 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#GazitR98 2002-01-03 More Efficient Parallel Totally Monotone Matrix Searching. 386-400 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#BradfordFS97 2002-01-03 Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers. 564-576 1992 13 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Lotti92 2002-01-03 Probabilistic Computation of Integer Polynomial GCDs. 365-371 1988 9 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Schonhage88 2002-01-03 The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. 1-28 1993 15 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#Csirik93 2002-01-03 A Better than "Best Possible" Algorithm to Edge Color Multigraphs. 79-104 1986 7 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#HochbaumNS86 2002-01-03 Recognizing Disguised NR(1) Instances of the Satisfiability Problem. 97-103 1980 1 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#Aspvall80 2002-01-03 Khachiyan's Linear Programming Algorithm. 1-13 1980 1 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#AspvallS80 2002-01-03 The Probability of Splitters in a List. 151-154 1989 10 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#HamidouneRJFK89 2002-09-17 Randomized Routing and Sorting on Fixed-Connection Networks. 157-205 1994 17 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#LeightonMRR94 2002-01-03 Intersection Queries in Curved Objects. 229-266 1993 15 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#AgarwalKO93 2002-01-03 Distance Approximating Trees for Chordal and Dually Chordal Graphs. 166-184 1999 30 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#BrandstadtCD99 2002-01-03 Ray Shooting Amidst Convex Polygons in 2D. 508-519 1996 21 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#AgarwalS96a 2002-01-03 Parallel Strategies for Geometric Probing. 320-349 1992 13 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#LindenbaumB92 2002-01-03 Applications of Parametric Searching in Geometric Optimization. 292-318 1994 17 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#AgarwalST94 2002-01-03 Zero Divisors in Quaternion Algebras. 494-506 1988 9 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Ronyai88a 2002-01-03 Foreword. 1 2000 37 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#Karloff00 2002-01-03 Tight Lower Bounds for Shellsort. 242-251 1990 11 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#WeissS90 2002-01-03 Coloring Planar Graphs in Parallel. 470-479 1987 8 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#BoyarK87 2003-09-16 Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. 91-134 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00046-4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#Meyer03 2002-05-02 On-Line Load Balancing of Temporary Tasks. 93-110 1997 22 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#AzarKPPW97 2003-06-23 Preface. 1-3 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00219-5 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#ProdingerV02 2002-01-03 Stability in Circular Arc Graphs. 314-320 1988 9 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#GolumbicH88 2002-01-03 Analysis of a Local Search Heuristic for Facility Location Problems. 146-188 2000 37 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#KorupoluPR00 2003-06-23 Placement Algorithms for Hierarchical Cooperative Caching. 260-302 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#KorupoluPR01 2003-06-30 Constructing Optimal Trees from Quartets. 237-259 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#BryantS01 2002-01-03 Minimal String Difference Encodings. 147-156 1982 3 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Goldberg82 2002-01-03 Efficient Algorithms for Listing Unlabeled Graphs. 128-143 1992 13 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Goldberg92 2002-01-03 An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. 1-29 1997 22 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#Goldberg97 2003-09-16 Making data structures confluently persistent. 16-58 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00044-0 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#FiatK03 2002-01-03 Splitting an Expander Graph. 166-172 1999 33 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#FriezeM99 2002-01-03 Analysis of Two Simple Heuristics on a Random Instance of k-SAT. 312-355 1996 20 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#FriezeS96 2002-01-03 Safety Zone Problem. 538-569 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#NandyBH00 2002-01-03 Domination in Permutation Graphs. 309-321 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#FarberK85 2003-06-23 Fault-Tolerant Broadcasting in Radio Networks. 47-67 2001 39 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal39.html#KranakisKP01 2003-01-22 Graph Minors. II. Algorithmic Aspects of Tree-Width. 309-322 1986 7 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#RobertsonS86 2002-01-03 Triangulating a Polygon in Parallel. 327-351 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#Goodrich89 2004-03-23 A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. 432-440 1995 19 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#BampisHMS95 2002-01-03 Finding k Points with Minimum Diameter and Related Problems. 38-56 1991 12 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#AggarwalIKS91 2002-01-03 NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. 10-16 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#MillerO85 2002-01-03 Bicriteria Network Design Problems. 142-171 1998 28 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#MaratheRSRRH98 2002-01-03 On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. 579-597 1996 21 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#ChazelleM96 2002-01-03 The Complexity of Generating an Exponentially Distributed Variate. 463-488 1986 7 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#FlajoletS86 2003-09-16 New text indexing functionalities of the compressed suffix arrays. 294-313 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00087-7 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#Sadakane03 2002-01-03 Better Computing on the Anonymous Ring. 204-238 1991 12 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#AttiyaS91 2002-01-03 Heuristic Matching for Graphs Satisfying the Triangle Inequality. 163-179 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Plaisted84 2004-04-20 Quicksort asymptotics. 4-28 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00216-X http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#FillJ02 2004-12-17 Generating and Counting Hamilton Cycles in Random Regular Graphs. 176-198 1996 21 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#FriezeJMRW96 2003-11-20 Computing homotopic shortest paths in the plane. 284-303 2003 49 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00090-7 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#Bespamyatnikh03 2002-01-03 Space Searching for Intersecting Objects. 348-361 1987 8 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#DobkinE87 2002-01-03 A Linear Algorithm for Determining the Separation of Convex Polyhedra. 381-392 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#DobkinK85 2002-01-03 Efficient Uses of the Past. 455-465 1985 6 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#DobkinM85 2002-01-03 Scheduling Precedence Graphs of Bounded Height. 48-59 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#DolevW84 2003-06-23 Locating Sources to Meet Flow Demands in Undirected Networks. 54-68 2002 42 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2001.1203 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#ArataIMF02 2002-01-03 The Graph Genus Problem is NP-Complete. 568-576 1989 10 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#Thomassen89 2002-01-03 The Even Cycle Problem for Planar Digraphs. 61-75 1993 15 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#Thomassen93 2002-01-03 Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems. 205-223 1988 9 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Soroker88 2002-01-03 Simple Optimal Parallel Multiple Pattern Matching. 1-13 2000 34 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#Muthukrishnan00 2005-05-18 An O(N²) Algorithm for Coloring Perfect Planar Graphs. 60-68 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#TuckerW84 2002-01-03 On the Effects of Feedback in Dynamic Network Protocols. 342-373 1990 11 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#Awerbuch90 2002-01-03 Greedily Finding a Dense Subgraph. 203-221 2000 34 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#AsahiroITT00 2002-01-03 The Rotation Graph of Binary Trees is Hamiltonian. 503-535 1987 8 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Lucas87 2004-07-01 Algorithms for Leader Election by Cellular Automata. 302-329 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1175 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#NichitiuMR01 2002-01-03 The Minimum-Length Generator Sequence Problem is NP-Hard. 311-313 1981 2 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#EvenG81 2002-01-03 Computing a Segment Center for a Planar Point Set. 314-323 1993 15 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#AgarwalEST93 2002-01-03 How to Predict Congruential Generators. 527-545 1992 13 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Krawczyk92 2002-01-03 alpha-Connectivity: A Gradually Nonparallel Graph Problem. 526-544 1996 20 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#IwamaI96 2002-01-03 A Simpler Parallel Algorithm for Graph Conectivity. 190-217 1994 16 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#IwamaK94 2003-06-23 A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. 145-161 2001 39 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal39.html#IwamaM01 2002-01-03 The Recognition of Double Euler Trails in Series-Parallel Networks. 216-257 1998 28 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#HoSHTH98 2002-01-03 Centroids, Representations, and Submodular Flows. 586-628 1995 18 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#Gabow95 2002-01-03 Algorithms for Graphic Polymatroids and Parametris s-Sets. 48-86 1998 26 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#Gabow98 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 288-300 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Johnson82a 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 381-395 1982 3 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Johnson82b 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 89-99 1982 3 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Johnson82c 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 189-203 1983 4 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Johnson83a 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 286-300 1983 4 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Johnson83b 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 397-411 1983 4 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Johnson83c 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 284-299 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Johnson84a 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 433-447 1984 5 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Johnson84b 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 595-609 1984 5 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Johnson84c 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 291-305 1985 6 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Johnson85a 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 434-451 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Johnson85b 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 584-601 1986 7 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#Johnson86a 2002-01-03 The NP-Completeness Column: An Ongoing Guide. 438-448 1987 8 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Johnson87a 2002-01-03 A Parallel Algorithm for Computing Minimum Spanning Trees. 383-401 1995 19 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#JohnsonM95 2002-01-03 Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing. 462-491 1990 11 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#JohnsonZ90 2003-06-23 Combinatorial Approximation Algorithms for Generalized Flow Problems. 135-169 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#Oldham01 2002-01-03 Improved Constants for Some Separator Theorems. 572-578 1987 8 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Venkatesan87 2003-06-23 Resource augmentation for online bounded space bin packing. 308-320 2002 44 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00202-X http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#CsirikW02 2002-01-03 On a Dual Version of the One-Dimensional Bin Packing Problem. 502-525 1984 5 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#AssmannJKL84 2002-01-03 Fastest Pattern Matching in Strings. 163-189 1994 16 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#Colussi94 2002-01-03 An Algorithmic Characterization of Total Digraphs. 120-133 1986 7 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#SkowronskaSZ86 2002-01-03 On Finding the Core of a Tree with a Specified Length. 345-352 1983 4 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#MiniekaP83 2002-01-03 Shifting Algorithms for Tree Partitioning with General Weighting Functions. 101-120 1983 4 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#BeckerP83 2002-01-03 Average Costs of a Graph Exploration: Upper and Lower Bounds. 148-176 2000 34 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#Galli00 2002-01-03 Batched Dynamic Solutions to Decomposable Searching Problems. 515-542 1985 6 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#EdelsbrunnerO85 2002-01-03 Some Efficient Algorithms for Permutation Graphs. 453-469 1994 16 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#IbarraZ94 2002-01-03 Finding the Maximum, Merging, and Sorting in a Parallel Computation Model. 88-102 1981 2 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#ShiloachV81 2002-01-03 An O(log n) Parallel Connectivity Algorithm. 57-67 1982 3 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#ShiloachV82 2002-01-03 Optimal Linear Broadcast. 288-315 1993 14 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#BitanZ93 2002-01-03 On-Line Load Balancing for Related Machines. 108-121 2000 35 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal35.html#BermanCK00 2003-06-23 Approximation algorithms for MAX-MIN tiling. 122-134 2003 47 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00015-4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal47.html#BermanDM03 2002-01-03 Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. 199-211 1997 22 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#BermanDP97 2002-01-03 Efficient Parallel Algorithms for Edge Coloring Problems. 39-52 1987 8 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#KarloffS87 2002-01-03 A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. 291-305 1998 26 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#MakinoI98 2002-01-03 Lower Bounds for Combinatorial Problems on Graphs. 393-399 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#NakayamaNS85 2002-01-03 Pyramid Computer Solutions of the Closest Pair Problem. 200-212 1985 6 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Stout85 2003-06-23 Rates of convergence for Quicksort. 52-62 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00206-7 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#NeiningerR02 2002-01-03 The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform. 1-9 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Devroye85 2002-01-03 Parallel Algorithms for Parity Graphs. 96-109 1991 12 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#PrzytyckaC91 2003-06-23 Expected search duration for finite backtracking adaptive search. 78-86 2003 47 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00018-X http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal47.html#AlexanderBW03 2002-01-03 Two Fast GCD Algorithms. 110-144 1994 16 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#Sorenson94 2002-01-03 A Polynomial Time Algorithm for Unidimensional Unfolding Representations. 218-233 1994 16 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#DoignonF94 2004-08-23 Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach. 306-330 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#NarayananRP96 2003-09-16 Approximation algorithms for TSP with neighborhoods in the plane. 135-159 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00047-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#DumitrescuM03 2002-01-03 Dynamization of Order Decomposable Set Problems. 245-260 1981 2 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Overmars81 2002-01-03 Corrigendum: Dynamization of Order Decomposable Set Problems. 301 1983 4 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Overmars83 2002-01-03 Efficient Data Structures for Range Searching on a Grid. 254-275 1988 9 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Overmars88 2003-06-23 Diagnosability of regular systems. 126-143 2002 45 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00250-X http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal45.html#CarusoCMS02 2002-01-03 Approximating Node-Deletion Problems for Matroidal Properties. 211-227 1999 31 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#Fujito99 2003-06-23 Optimality and Greed in Dynamic Allocation. 244-261 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1198 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#Winkler01 2003-06-23 Interval selection: Applications, algorithms, and lower bounds. 27-53 2003 46 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00291-2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal46.html#ErlebachS03 2002-01-03 An Efficient Reconstruction of a Graph from its Line Graph in Parallel. 132-143 1990 11 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#NaorN90 2002-01-03 Small-Rank Selection in Parallel, with Applications to Heap Construction. 33-51 1999 30 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#DietzR99 2002-01-03 Efficient and Robust Sharing of Memory in Message-Passing Systems. 109-127 2000 34 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#Attiya00 2002-01-03 Linear Time Algorithms for Knapsack Problems with Bounded Weights. 1-14 1999 33 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#Pisinger99 2002-01-03 Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. 415-433 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#Hoogeveen96 2005-02-16 Improving Greedy Algorithms by Lookahead-Search. 1-23 1994 16 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#SarkarCGS94 2005-06-27 Addition Chains Using Continued Fractions. 403-412 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#BergeronBBD89 2002-01-03 Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. 199-214 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Soisalon-SoininenW84 2002-01-03 How to Allocate Network Centers. 385-415 1993 15 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#Bar-IlanKP93 2002-01-03 An Algorithmic Proof of a Generalization of the Birkhoff-Von Neumann Theorem. 323-330 1986 7 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#LewandowskiLL86 2003-06-23 Efficient Dynamic Embeddings of Binary Trees into Hypercubes. 51-84 2002 43 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2002.1218 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#HeunM02a 2002-01-03 Incremental and Decremental Maintenance of Planar Width. 570-577 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#Eppstein00 2002-01-03 Sequence Comparison with Mixed Convex and Concave Costs. 85-101 1990 11 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#Eppstein90 2002-01-03 Offline Algorithms for Dynamic Minimum Spanning Tree Problems. 237-250 1994 17 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#Eppstein94 2002-01-03 Minimum Range Balanced Cuts via Dynamic Subset Sums. 375-385 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#Eppstein97 2002-01-03 Lower Bounds for Algebraic Decision Trees. 1-8 1982 3 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#SteeleY82 2002-01-03 Some Results on V-ary Asymmetric Tries. 224-244 1988 9 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Szpankowski88 2002-01-03 Transformations on Words. 172-191 1998 28 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#FoataH98 2002-01-03 Finding the Convex Hull Facet by Facet. 17-48 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Swart85 2002-01-03 Improved Dynamic Text Indexing. 291-319 1999 31 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal31.html#FerraginaG99 2002-01-03 Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms. 142-186 1980 1 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#Lagarias80 2003-06-23 A primal-dual schema based approximation algorithm for the element connectivity problem. 1-15 2002 45 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00222-5 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal45.html#JainMVW02 2002-01-03 On-Line Coloring of Sparse Random Graphs and Random Trees. 195-205 1997 23 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#PittelW97 2002-01-03 Choosing Subsets with Maximum Weighted Average. 177-193 1997 24 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#EppsteinH97 2002-01-03 Repetitive Hidden Surface Removal for Polyhedra. 80-101 1996 21 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#Pellegrini96 2002-01-03 Time-Randomness Trade-offs in Parallel Computation. 1-19 1996 20 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#Krizanc96 2002-01-03 An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. 336-358 1997 25 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal25.html#BhattacharyaK97 2002-01-03 On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. 177-193 1997 25 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal25.html#BhattacharyaS97 2002-01-03 Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. 121-136 1983 4 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#BhattacharyaT83 2002-01-03 Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. 449-469 1988 9 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#BhattacharyaZ88 2002-01-03 General Balanced Trees. 1-18 1999 30 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#Andersson99 2002-01-03 Approximating the Bandwidth for Asteroidal Triple-Free Graphs. 41-57 1999 32 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal32.html#KloksKM99 2002-01-03 Minimum Fill-in on Circle and Circular-Arc Graphs. 272-289 1998 28 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#KloksKW98 2002-01-03 Polynomial-Time Analysis of Toroidal Periodic Graphs. 14-39 2000 34 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#HoftingW00 2003-09-16 Capacitated vertex covering. 257-270 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00053-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#GuhaHKO03 2002-01-03 Projective Planarity in Linear Time. 482-502 1993 15 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#Mohar93 2002-01-03 Parallel Algorithms with Processor Failures and Delays. 45-86 1996 20 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#BussKRS96 2002-01-03 <i>³)</i>Expected Time. 125-141 1998 28 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#KolliopoulosS98 2002-01-03 All-Pairs Min-Cut in Sparse Networks. 82-110 1998 29 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#ArikatiCZ98 2002-01-03 Hash Table Collision Resolution with Direct Chaining. 20-34 1989 10 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#KnottT89 2003-06-23 Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation. 104-121 2003 47 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00017-8 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal47.html#Tsaban03 2002-01-03 Minimizing Sums of Addition Chains. 281-307 1991 12 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#Zantema91 2002-01-03 Greedy Packet Scheduling on Shortest Paths. 449-465 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#MansourP93 2002-01-03 Finding the Edge Connectivity of Directed Graphs. 76-85 1989 10 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#MansourS89 2002-01-03 Sorting on a Ring of Processors. 622-630 1990 11 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#MansourS90 2003-06-23 Median Bounds and Their Application. 184-236 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#Siegel01 2002-01-03 Competitive Parallel Disk Prefetching and Buffer Management. 152-181 2000 36 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal36.html#BarveKVV00 2003-06-23 Oblivious Gossiping on Tori. 1-19 2002 42 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2001.1200 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#MeyerS02 2003-11-20 [Delta]-stepping: a parallelizable shortest path algorithm. 114-152 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00076-2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#MeyerS03 2002-01-03 Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. 189-203 1991 12 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#CsirikFGK91 2003-11-03 Repeated Random Insertion into a Priority Queue. 466-477 1985 6 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#BollobasS85 2003-06-23 Foreword. 1 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#Moret01 2002-01-03 A Separator Theorem for Graphs of Bounded Genus. 391-407 1984 5 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#GilbertHT84 2002-01-03 Deletion Algorithms for Hashing That Preserve Randomness. 261-275 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Vitter82 2002-01-03 A Weighted Matroid Intersection Algorithm. 328-336 1981 2 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Frank81 2003-11-20 Preface. 1 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00084-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#BilardiI03 2002-01-03 A "Retraction" Method for Planning the Motion of a Disc. 104-111 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#ODunlaingY85 2002-01-03 Algorithmic Aspects of Tree Amalgamation. 522-537 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#BockerBDS00 2002-01-03 The Theory and Computation of Evolutionary Distances: Pattern Recognition. 359-373 1980 1 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#Sellers80 2002-01-03 Competitive Algorithms for Server Problems. 208-230 1990 11 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#ManasseMS90 2003-09-16 Scheduling data transfers in a network and the set scheduling problem. 314-332 2003 48 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00054-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#GoelHPT03 2002-01-03 Graph Sandwich Problems. 449-473 1995 19 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#GolumbicKS95 2002-01-03 Finding the Contour of a Union of Iso-Oriented Rectangles. 235-246 1980 1 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#LipskiP80 2002-01-03 Segments, Rectangles, Contours. 63-76 1981 2 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#LipskiP81 2002-01-03 Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles. 301-302 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#LipskiP82 2003-06-23 An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. 212-224 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1184 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#ChekuriB01 2002-01-03 On Vectorial Addition Chains. 13-21 1981 2 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Olivos81 2002-01-03 Evaluation of a MULTIFIT-Based Scheduling Algorithm. 35-59 1986 7 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#FriesenL86 2002-01-03 Computing Vertex Connectivity: New Bounds from Old Techniques. 222-250 2000 34 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal34.html#HenzingerRG00 2002-01-03 Computing pi(x): An Analytic Method. 173-191 1987 8 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#LagariasO87 2002-01-03 On Assessing the Performance of Randomized Algorithms. 344-362 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#Froda00 2002-01-03 Searching in 2-Dimensional Partial Orders. 95-105 1987 8 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Steiner87 2002-01-03 A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. 400-408 1985 6 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Noshita85 2003-06-23 Improved approximation of Max-Cut on graphs of bounded degree. 201-219 2002 43 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00005-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#FeigeKL02 2002-01-03 The Measure Problem for Rectangular Ranges in d-Space. 282-300 1981 2 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#LeeuwenW81 2002-01-03 Deterministic Permutation Routing on Meshes. 111-141 1997 22 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#SibeynCK97 2002-01-03 Weighted Heuristic Search in Networks. 550-576 1985 6 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#BagchiS85 2002-01-03 A Personnel Assignment Problem. 132-144 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#RamananDL84 2002-01-03 A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. 114-128 1988 9 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#LeisersonS88 2002-01-03 Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. 299-313 1988 9 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Ramachandran88 2002-01-03 Parallel Algorithms for Reducible Flow Graphs. 1-31 1997 23 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#Ramachandran97 2002-01-03 Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition. 205-240 2000 36 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal36.html#Dahlhaus00 2002-01-03 A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. 577-588 1992 13 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#AverbuchBK92 2002-01-03 Pattern Matching with Swaps. 247-266 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#AmirALLL00 2002-01-03 Computing the Visibility Polygon from a Convex Set and Related Problems. 75-95 1991 12 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#Ghosh91 2002-01-03 Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain. 657-662 1996 21 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#Ghosh96 2002-01-03 Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields. 482-489 1991 12 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#Huang91a 2002-01-03 Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. 204-228 1999 33 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#HuangR99 2002-01-03 Security, Verifiability, and Universality in Distributed Computing. 492-521 1990 11 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#HuangT90 2002-01-03 Extended Hilbert Irreducibility and Its Applications. 121-145 2000 37 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#HuangW00 2002-01-03 Optimal Binary Split Trees. 69-79 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#HuangW84 2003-06-23 The Complexity of Gene Placement. 225-243 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1172 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#GoldbergGPPSS01 2002-01-03 A Linear 5-Coloring Algorithm of Planar Graphs. 317-327 1981 2 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#ChibaNS81 2002-01-03 Very Fast Approximation of the Matrix Chain Product Problem. 71-79 1996 21 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#Czumaj96 2002-01-03 An Algorithm to Determine When Certain Sets Have 0-Density. 31-43 1981 2 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Klarner81 2002-01-03 On the Computational Complexity of Continuous Routing. 86-108 1989 10 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#ChangHS89 2002-01-03 A Linear Time Algorithm for Finding a k-Tree Core. 281-290 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#ShiouraU97 2002-01-03 On the Comparison Complexity of the String Prefix-Matching Problem. 18-67 1998 29 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#BreslauerCT98 2002-01-03 Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. 51-72 1999 33 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#Fleischer99 2002-01-03 Rotations of Periodic Strings and Short Superstrings. 340-353 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#BreslauerJJ97 2002-01-03 Worst Case Bounds for Shortest Path Interval Routing. 1-25 1998 27 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal27.html#GavoilleG98 2002-01-03 Fast Approximation Algorithms for a Nonconvex Covering Problem. 305-323 1987 8 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#HochbaumM87 2002-01-03 Approximation Algorithms for Network Design Problems on Bounded Subsets. 403-414 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#HochbaumN96 2002-01-03 Large Deviations for Quicksort. 476-507 1996 21 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#McDiarmidH96 2002-01-03 Building Heaps Fast. 352-365 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#McDiarmidR89 2002-01-03 On Bipartite Matchings of Minimum Density. 480-502 1987 8 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#AtallahH87 2002-01-03 An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. 394-413 1992 13 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#AtallahK92 2002-01-03 A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. 31-40 1999 32 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal32.html#DinitzN99 2002-01-03 Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines. 1-6 1984 5 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Gusfield84 2002-01-03 Gray Code Sequences of Partitions. 577-595 1989 10 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#Savage89 2003-06-23 An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. 212-233 2001 40 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal40.html#KaoLST01 2002-01-03 Optimal Constructions of Hybrid Algorithms. 142-164 1998 29 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#KaoMSY98 2002-01-03 Approximating the Minimum-Degree Steiner Tree to within One of Optimal. 409-423 1994 17 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#FurerR94 2002-01-03 An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. 203-220 1995 18 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#FurerR95 2002-01-03 On Local Register Allocation. 37-65 2000 37 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#Farach-ColtonL00 2003-06-23 Largest empty rectangle among a point set. 54-78 2003 46 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00285-7 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal46.html#ChaudhuriND03 2002-01-03 New Algorithms for Selection. 557-578 1984 5 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#RamananH84 2002-01-03 On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. 240-266 1996 21 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal21.html#TsengL96 2002-01-03 Bipartite Graph Matching for Points on a Line or a Circle. 277-284 1986 7 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#WermanPMK86 2002-01-03 A Bijective Proof of the Hook-Length Formula. 317-343 1982 3 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#FranzblauZ82 2002-01-15 Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. 238-255 1995 18 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#BodlaenderGHK95 2004-09-21 A Non-Factorial Algorithm for Canonical Numbering of a Graph. 345-362 1984 5 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#CorneilG84 2002-01-03 A Probabilistic Algorithm for Computing Hough Transforms. 639-656 1991 12 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#BergenS91 2002-01-03 Scheduling with Concurrency-Based Constraints. 98-123 1995 18 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal18.html#BergerC95 2002-01-03 Tight Bounds for the Maximum Acyclic Subgraph Problem. 1-18 1997 25 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal25.html#BergerS97 2002-01-03 Algorithmic Extremal Problems in Combinatorial Optimization. 225-244 1982 3 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Lieberherr82 2002-01-03 An Analysis of Optimum Caching. 181-199 1985 6 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Knuth85a 2002-01-03 Finding the Number of Factors of a Polynomial. 180-186 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Weinberger84 2003-06-23 Approximation Algorithms for the Achromatic Number. 404-416 2001 41 J. Algorithms 2 http://dx.doi.org/10.1006/jagm.2001.1192 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal41.html#ChaudharyV01 2002-02-26 An Algorithmic Proof of Tutte's f-Factor Theorem. 112-131 1985 6 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Anstee85 2003-06-23 Reflected Brownian Bridge area conditioned on its local time at the origin. 29-51 2002 44 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00209-2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#ChassaingL02 2003-11-20 Dispatching in perfectly-periodic schedules. 219-239 2003 49 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00089-0 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#BrakerskiDP03 2002-01-03 Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. 116-143 1995 19 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal19.html#AggarwalBKKS95 2002-01-03 Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). 267-282 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#CattellRSSM00 2002-01-03 Parallel and On-Line Graph Coloring. 265-280 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#Halldorsson97 2003-06-23 Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). 21-26 2003 46 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(02)00286-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal46.html#SawadaR03 2003-06-23 Cut Tree Algorithms: An Experimental Study. 51-83 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#GoldbergT01 2002-01-03 Faster Parallel String Matching via Larger Deterministic Samples. 295-308 1994 16 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#GoldbergZ94 2002-01-03 On the Solution of Inequality Systems Relevant to IC-Layout. 408-421 1984 5 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Lengauer84 2002-01-03 Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. 260-284 1987 8 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#Lengauer87 2002-01-03 Implementation of Simultaneous Memory Address Access in Models That Forbid It. 45-50 1983 4 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#Vishkin83 2002-01-03 A Parallel Blocking Flow Algorithm for Acyclic Networks. 489-501 1992 13 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Vishkin92 2002-01-03 Lower Bounds for Shellsort. 221-240 1997 23 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#PlaxtonS97 2002-01-03 Uniform Generation of Random Regular Graphs of Moderate Degree. 52-67 1990 11 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#McKayW90 2002-01-03 Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups. 478-514 1985 6 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#Kantor85 2002-01-03 Finding Sylow Normalizers in Polynomial Time. 523-563 1990 11 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#Kantor90 2002-01-03 Finding an Oriented Hamiltonian Path in a Tournament. 253-275 2000 36 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal36.html#Havet00 2002-01-03 Minimum Color Sum of Bipartite Graphs. 339-365 1998 28 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#Bar-NoyK98 2003-09-16 Competitive on-line stream merging algorithms for media-on-demand. 59-90 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00045-2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#Bar-NoyL03 2002-01-03 Genus g Graphs Have Pagenumber O(sqrt(g)). 85-109 1994 17 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#Malitz94a 2002-01-03 A Better Algorithm for an Ancient Scheduling Problem. 400-430 1996 20 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#KargerPT96 2002-01-03 Transitive Compaction in Parallel via Branchings. 110-125 1991 12 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#GibbonsKRST91 2002-01-03 Representing Sets with Constant Time Equality Testing. 353-373 1992 13 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#Yellin92 2002-01-03 Processor Efficient Parallel Solution of Linear Systems of Equations. 122-126 2000 35 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal35.html#Villard00 2002-01-03 An Adaptive Algorithm for System Level Diagnosis. 526-530 1984 5 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#HakimiS84 2002-01-03 On the Complexity of Certified Write-All Algorithms. 361-387 1994 16 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal16.html#MartelS94 2002-01-03 A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. 198-203 1981 2 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal2.html#Bar-YehudaE81 2002-01-03 Fault Tolerant Distributed Majority Commitment. 568-582 1988 9 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#Bar-YehudaK88 2003-06-23 Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. 20-40 2002 42 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2001.1196 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal42.html#Bar-YehudaR02 2002-01-03 Design of Practical and Provably Good Random Number Generators. 358-389 1998 29 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#AielloRV98 2002-01-03 Constructing Computer Virus Phylogenies. 188-208 1998 26 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#GoldbergGPS98 2003-09-16 An efficient graph algorithm for dominance constraints. 194-219 2003 48 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00050-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal48.html#AlthausDKMNT03 2002-01-03 Finding Scores in Tournaments. 380-394 1997 24 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#BalasubramanianRS97 2002-01-03 Generating Binary Trees by Transpositions. 68-84 1990 11 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#RuskeyP90 2002-01-03 Incremental Algorithms for Minimal Length Paths. 615-638 1991 12 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal12.html#AusielloIMN91 2002-01-03 Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. 245-253 1988 9 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#HesterHL88 2002-01-03 On Finding and Updating Shortest Paths Distributively. 235-257 1992 13 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal13.html#RamaraoV92 2002-01-03 Exploring Unknown Undirected Graphs. 281-295 1999 33 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#PanaiteP99 2002-01-03 On the Generation of All Topological Sortings. 150-162 1983 4 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#KalvinV83 2002-01-03 Binary Tree Gray Codes. 225-238 1985 6 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal6.html#ProskurowskiR85 2002-01-03 Finding Feasible Paths for a Two-Point Body. 109-119 1989 10 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#FeinbergP89 2002-01-03 On Deletion in Threaded Binary Trees. 395-411 1986 7 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#Brinck86 2002-01-03 Sparser: A Paradigm for Running Distributed Algorithms. 316-328 1993 14 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#AfekR93 2002-01-03 Optimal Time-Space Tradeoff for Shared Memory Leader Election. 95-117 1997 25 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal25.html#AfekS97 2002-01-03 The Instancy of Snapshots and Commuting Objects. 68-105 1999 30 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal30.html#AfekW99 2002-01-03 Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. 197-215 1998 28 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal28.html#BerkmanMR98 2002-01-03 Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. 344-370 1993 14 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#BerkmanSV93 2002-01-03 A Compact Representation for Permutation Groups. 60-78 1986 7 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#Jerrum86 2002-01-03 An Improved Block-Interchange Algorithm. 113-121 1987 8 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal8.html#MohammedS87 2002-01-03 Approximate Indexed Lists. 256-276 1998 29 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal29.html#AnderssonP98 2002-01-03 Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. 507-537 1988 9 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal9.html#CheriyanM88 2002-01-03 Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. 15-50 1999 33 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal33.html#CheriyanT99 2002-01-03 Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. 115-138 1993 14 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal14.html#HellK93 2002-01-03 The Complexity of Finding Generalized Paths in Tournaments. 303-309 1983 4 J. Algorithms 4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal4.html#HellR83 2003-06-23 Efficient Algorithms for Petersen's Matching Theorem. 110-134 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#BiedlBDL01 2002-12-19 Generalized Planar Matching. 153-184 1990 11 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal11.html#BermanJLSS90 2002-01-03 Monte-Carlo Approximation Algorithms for Enumeration Problems. 429-448 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#KarpLM89 2002-01-03 Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. 57-92 1997 22 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal22.html#Palios97 2003-11-25 Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. 207-221 1994 17 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#GavrilLW94 2002-01-03 Complexity of Recognizing Equal Unions in Families of Sets. 495-504 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#JacobsJ00 2002-01-03 Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants. 259-295 1980 1 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal1.html#BrentGY80 2002-01-03 Generating Random Regular Graphs. 247-280 1984 5 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal5.html#Wormald84 2003-06-23 Thresholds and optimal binary comparison search trees. 338-358 2002 44 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00203-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal44.html#AndersonKKL02 2002-09-06 Reversing Trains: A Turn of the Century Sorting Problem. 413-428 1989 10 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#AmatoBIR89 2002-01-03 Improved Approximations for the Steiner Tree Problem. 381-408 1994 17 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal17.html#BermanR94 2003-06-23 Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. 264-283 2002 43 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00006-8 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#Liben-Nowell02 2003-06-23 Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. 17-50 2002 43 J. Algorithms 1 http://dx.doi.org/10.1006/jagm.2002.1217 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal43.html#HeunM02 2002-01-03 A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. 375-399 1996 20 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal20.html#HeunM96 2002-01-03 Edge Weight Reduction Problems in Directed Acyclic Graphs. 66-93 1997 24 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal24.html#HambruschT97 2004-11-30 Techniques for scheduling with rejection. 175-191 2003 49 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00078-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal49.html#EngelsKKSUW03 2002-01-03 Simple Optimal String Matching Algorithm. 102-116 2000 36 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal36.html#AllauzenR00 2002-01-03 Randomized Single-Target Hot-Potato Routing. 101-120 1997 23 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#AroyaNS97 2002-01-03 Fast Algorithms for Direct Enclosures and Direct Dominances. 170-186 1989 10 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal10.html#GutingNO89 2002-01-03 A Nonquadratic Minimal Algorithm for a System of Quadratic Forms. 41-40 1982 3 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal3.html#Tolimieri82 2002-01-03 On Rotations and the Generation of Binary Trees. 343-366 1993 15 J. Algorithms 3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal15.html#LucasBR93 2002-01-03 Load Balancing for Response Time. 1-16 2000 35 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal35.html#Westbrook00 2002-01-03 Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. 51-73 1997 23 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal23.html#GoodrichT97 2002-01-03 A Framework for Drawing Planar Graphs with Curves and Polylines. 399-421 2000 37 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal37.html#GoodrichW00 2002-01-03 Computing the Convex Hull of Line Intersections. 285-288 1986 7 J. Algorithms 2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal7.html#Atallah86 2002-02-26 Polygon Graph Recognition. 101-140 1998 26 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal26.html#ElmallahS98 2003-06-23 Wavelength Conversion in Optical Networks. 25-50 2001 38 J. Algorithms 1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal38.html#KleinbergK01 2004-01-15 <i>n</i><i>n</i>) time and linear space. 96-105 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#Han04 2004-01-15 <i>m</i>-set packing. 106-117 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#JiaZC04 2004-01-15 Compact roundtrip routing in directed networks. 79-95 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#CowenW04 2004-01-15 Rectangular drawings of planar graphs. 62-78 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00126-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#RahmanNG04 2004-01-15 An 8/13-approximation algorithm for the asymmetric maximum TSP. 23-48 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00112-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#Blaser04 2004-01-15 Algorithms with large domination ratio. 118-131 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#AlonGK04 2004-01-15 Algorithms for optimal multi-resolution quantization. 1-22 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00099-3 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#DumitrescuW04 2004-01-15 Multiway cuts in node weighted graphs. 49-61 2004 50 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00111-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#GargVY04 2004-07-07 Faster algorithms for string matching with k mismatches. 257-275 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00097-X http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#AmirLP04 2004-07-07 Instability of FIFO in session-oriented networks. 232-245 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00096-8 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#Andrews04 2004-07-07 Cooperative facility location games. 194-214 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00098-1 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#GoemansS04 2004-07-07 Restructuring ordered binary trees. 168-193 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00094-4 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#EvansK04 2004-07-07 Strong bias of group generators: an obstacle to the "product replacement algorithm". 215-231 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00091-9 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#BabaiP04 2004-07-07 Foreword. 133 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00095-6 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#Shmoys04 2004-07-07 An approximation algorithm for finding long paths in Hamiltonian graphs. 246-256 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00093-2 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#Vishwanathan04 2004-07-07 The complexity of finding small triangulations of convex 3-polytopes. 134-167 2004 50 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(03)00092-0 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal50.html#BelowLR04 2004-07-07 Exact algorithms for finding minimum transversals in rank-3 hypergraphs. 107-121 2004 51 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#Wahlstrom04 2004-07-07 Tree exploration with little memory. 38-63 2004 51 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#DiksFKP04 2004-07-07 ₄-comparability graphs. 77-104 2004 51 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#NikolopoulosP04 2004-07-07 Permuting in place: analysis of two stopping rules. 170-184 2004 51 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#PanholzerPR04 2004-07-07 Uniform consensus is harder than consensus. 15-37 2004 51 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#Charron-BostS04 2004-07-07 Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. 1-14 2004 51 J. Algorithms 1 http://dx.doi.org/10.1016/S0196-6774(03)00086-5 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#BadgerKLTJ04 2004-07-07 Cuckoo hashing. 122-144 2004 51 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2003.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#PaghR04 2005-07-25 Establishing wireless conference calls under delay constraints. 145-169 2004 51 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2003.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#Bar-NoyM04 2004-07-07 Circular arrangements and cyclic broadcast scheduling. 185-215 2004 51 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2003.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#Liberatore04 2004-07-07 Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees. 64-76 2004 51 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal51.html#Georgakopoulos04 2004-07-07 All-norm approximation algorithms. 120-133 2004 52 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#AzarERW04 2004-07-07 Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. 134-151 2004 52 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2003.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#AlberF04 2004-07-07 Efficient communication in an ad-hoc network. 1-7 2004 52 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#FlaxmanFU04 2004-07-07 Efficient algorithms for the scaled indexing problem. 82-100 2004 52 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#WangLK04 2004-07-07 Parameterized self-adjusting heaps. 103-119 2004 52 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#Elmasry04 2004-12-10 The dominating set problem is fixed parameter tractable for graphs of bounded genus. 152-168 2004 52 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#EllisFF04 2004-07-07 Performance guarantee for EDF under overload. 193-206 2004 52 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2003.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#LamNT04 2004-07-07 Logarithmic inapproximability of the radio broadcast problem. 8-25 2004 52 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#ElkinK04 2004-07-07 Parameterized complexity: exponential speed-up for planar graph problems. 26-56 2004 52 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#AlberFN04 2004-07-07 Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. 57-81 2004 52 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#AndrewsZ04 2004-07-07 Seat reservation allowing seat changes. 169-192 2004 52 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal52.html#BoyarKN04 2005-10-31 A locality-preserving cache-oblivious dynamic dictionary. 115-136 2004 53 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.04.014 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#BenderDIW04 2005-10-31 On external-memory MST, SSSP and multi-way planar graph separation. 186-206 2004 53 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#ArgeBT04 2005-10-31 MAX CUT in cubic graphs. 169-185 2004 53 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#HalperinLZ04 2005-10-31 Approximation algorithms for partial covering problems. 55-84 2004 53 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#GandhiKS04 2005-10-31 Detecting tetrahedralizations of a set of line segments. 1-35 2004 53 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#YangW04 2005-10-31 Analysis of queueing policies in QoS switches. 137-168 2004 53 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#Zhu04 2005-10-31 Inverse parametric sequence alignment. 36-54 2004 53 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#SunFY04 2005-10-31 Distance labeling in graphs. 85-112 2004 53 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal53.html#GavoillePPR04 2005-10-31 Generating Huffman sequences. 115-121 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#HoffmanJW05 2006-03-30 Estimating the maximum. 105-114 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#GumLLF05 2005-10-31 Factoring into coprimes in essentially linear time. 1-30 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Bernstein05 2005-10-31 Linear time algorithms for the ring loading problem with demand splitting. 45-57 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Wang05 2005-10-31 An algorithm for the satisfiability problem of formulas in conjunctive normal form. 40-44 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.012 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Schuler05 2005-10-31 A modular integer GCD algorithm. 152-167 2005 54 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.006 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#WeberTM05 2005-10-31 3-coloring and 3-clique-ordering of locally connected graphs: . 122-125 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Kochol05 2005-10-31 Efficient parallel exponentiation in GF(qn) using normal basis representations. 205-221 2005 54 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#LeeKPC05 2005-10-31 ⁿ). 168-204 2005 54 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#BeigelE05 2005-10-31 Compositional competitiveness for distributed algorithms. 127-151 2005 54 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#AspnesW05 2005-10-31 A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm. 58-71 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.04.010 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Pemantle05 2005-10-31 Cycles in random k-ary maps and the poor performance of random number generation. 72-84 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Pemantle05a 2005-10-31 Approximation algorithms for array partitioning problems. 85-104 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#MuthukrishnanS05 2005-10-31 Simple constant amortized time generation of fixed length numeric partitions. 31-39 2005 54 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal54.html#Boyer05 2005-10-31 A polynomial-time algorithm for near-unanimity graphs. 177-191 2005 55 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.04.011 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#LaroseLZ05 2006-04-25 Data migration to minimize the total completion time. 42-57 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.07.009 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#Kim05 2005-10-31 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. 29-41 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#SparlZ05 2005-10-31 An online throughput-competitive algorithm for multicast routing and admission control. 1-20 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#GoelHP05 2005-10-31 Irreducibility testing of lacunary 0, 1-polynomials. 21-28 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#FilasetaM05 2005-10-31 Randomized k-server algorithms for growth-rate bounded graphs. 192-202 2005 55 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#BartalM05 2005-10-31 Competitive queue policies for differentiated services. 113-141 2005 55 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#AielloMRR05 2005-10-31 On approximating a geometric prize-collecting traveling salesman problem with time windows. 76-92 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#Bar-YehudaES05 2005-10-31 On fairness in the carpool problem. 93-98 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#Naor05 2005-10-31 An improved data stream summary: the count-min sketch and its applications. 58-75 2005 55 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2003.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#CormodeM05 2005-10-31 The Guessing Secrets problem: a probabilistic approach. 142-176 2005 55 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#LungoLMM05 2005-10-31 Tight bounds for the performance of Longest In System on DAGs. 101-112 2005 55 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.04.013 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal55.html#AdlerR05 2005-10-31 Insufficiency of four known necessary conditions on string unavoidability. 96-123 2005 56 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.07.010 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal56.html#Heitsch05 2005-10-31 A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. 77-95 2005 56 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.01.008 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal56.html#Nagamochi05 2005-10-31 Transposition invariant string matching. 124-153 2005 56 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal56.html#MakinenNU05 2005-12-23 Conditional location of path and tree shaped facilities on trees. 50-75 2005 56 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2005.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal56.html#TamirPMR05 2005-10-31 Cutwidth II: Algorithms for partial w-trees of bounded degree. 25-49 2005 56 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal56.html#ThilikosSB05a 2005-10-31 Cutwidth I: A linear time fixed parameter algorithm. 1-24 2005 56 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal56.html#ThilikosSB05 2005-10-31 Virtual logarithms. 140-147 2005 57 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#Schirokauer05 2005-10-31 Complexity of preemptive minsum scheduling on unrelated parallel machines. 37-48 2005 57 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#Sitters05 2005-10-31 Optimal non-preemptive semi-online scheduling on two related machines. 49-73 2005 57 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#EpsteinF05 2005-10-31 Estimating all pairs shortest paths in restricted graph families: a unified approach. 1-21 2005 57 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#Dragan05 2005-10-31 FFT-based algorithms for the string matching with mismatches problem. 130-139 2005 57 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#SchoenmeyrZ05 2005-10-31 Minimizing the total completion time on-line on a single machine, using restarts. 95-129 2005 57 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#SteeP05 2005-10-31 Lowest common ancestors in trees and directed acyclic graphs. 75-94 2005 57 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#BenderFPSS05 2005-10-31 TSP with neighborhoods of varying size. 22-36 2005 57 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2005.01.010 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal57.html#BergGKLOS05 2006-07-04 Partial alphabetic trees. 81-103 2006 58 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#BarkanK06 2006-07-04 A wide-range algorithm for minimal triangulation from an arbitrary ordering. 33-66 2006 58 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#BerryBHSV06 2006-07-04 On finding approximate optimal paths in weighted regions. 1-32 2006 58 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#SunR06 2006-07-04 Posted price profit maximization for multicast by approximating fixed points. 150-164 2006 58 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#MehtaSV06 2006-07-04 A new kind of graph coloring. 118-133 2006 58 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#Zverovich06 2006-07-04 Refinements of Miller's algorithm for computing the Weil/Tate pairing. 134-149 2006 58 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.01.009 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#BlakeMX06 2006-07-04 Polynomial time recognition of unit circular-arc graphs. 67-78 2006 58 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#DuranGMST06 2006-07-04 External selection. 104-117 2006 58 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal58.html#Sibeyn06 2006-07-04 An algorithmic sign-reversing involution for special rim-hook tableaux. 149-161 2006 59 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#SaganL06 2006-07-04 On generalized gossiping and broadcasting. 81-106 2006 59 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#KhullerKW06 2006-07-04 <i>k</i>-tree core problem in a tree network. 107-124 2006 59 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#WangPYK06 2006-07-04 Computing bounded-degree phylogenetic roots of disconnected graphs. 125-148 2006 59 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#ChenT06 2006-07-04 Space efficient algorithms for directed series-parallel graphs. 85-114 2006 60 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#JakobyLR06 2006-07-04 The load rebalancing problem. 42-59 2006 60 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#AggarwalMZ06 2006-07-04 Broadcasting algorithms in radio networks with unknown topology. 115-143 2006 60 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#CzumajR06 2006-07-04 Algorithms for non-uniform size data placement on parallel disks. 144-167 2006 60 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#KashyapK06 2006-07-04 ²rounding technique for semidefinite programs. 1-23 2006 60 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#FeigeL06 2006-07-04 Scheduling policies for CIOQ switches. 60-83 2006 60 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#KesselmanR06 2006-07-04 Graph minimum linear arrangement by multilevel weighted edge contractions. 24-41 2006 60 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2004.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal60.html#SafroRB06 2006-07-24 Maintaining time-decaying stream aggregates. 19-36 2006 59 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2005.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#CohenS06 2006-07-24 A linear time approximation scheme for the single machine scheduling problem with controllable processing times. 37-52 2006 59 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2005.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#Mastrolilli06 2006-07-24 Approximations for minimum and min-max vehicle routing problems. 1-18 2006 59 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2005.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#ArkinHL06 2006-07-24 Semi-matchings for bipartite graphs and load balancing. 53-78 2006 59 J. Algorithms 1 http://dx.doi.org/10.1016/j.jalgor.2005.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/jal/jal59.html#HarveyLLT06 2004-02-04 Embedding Defaults into Terminological Knowledge Representation Formalisms. 149-180 1995 14 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#BaaderH95 2004-02-04 Mechanical Verification of Strategies. 69-93 1995 15 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#Subramanian95 2004-02-04 Priorities on Defaults with Prerequisites, and Their Application in Treating Specificity in Terminological Default Logic. 41-68 1995 15 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#BaaderH95a 2004-02-04 I-SATCHMO: An Improvement of SATCHMO. 313-322 2001 27 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#He01 2004-02-04 Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing. 1-31 2003 30 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#Tinelli03 2004-02-04 Vectorial Equations Solving for Mechanical Geometry Theorem Proving. 83-121 2000 25 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#Li00 2004-02-04 On the Complexity of Nested-Object Matching. 317-323 1995 14 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Vadaparty95 2004-02-04 Computer Proofs in Group Theory. 251-286 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Yu90 2004-02-04 Interweaving Knowledge Extracting, Organizing and Evaluating: A Concrete Design for Preventing Logic and Structure Bugs while Interviewing Experts. 299-317 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Piazza90 2004-02-04 Wort Unification and Transformation of Generalized Equations. 149-184 1993 11 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Schulz93 2004-02-04 Some Experiments in Nonassociative Ring Theory with an Automated Theorem Prover. 211-221 1987 3 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Stevens87 2004-02-04 Intractable Unifiability Problems and Backtracking. 37-47 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Wolfram89 2004-02-04 Completeness of a Prover for Dense Linear Orders. 45-75 1992 8 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Hines92 2004-02-04 A Tribute to Woody Bledsoe. 1-4 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Hines97 2004-02-04 Fast Subsumption Checks Using Anti-Links. 47-83 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#RameshBHM97 2004-02-04 Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation. 35-82 2000 25 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#BryY00 2004-02-04 A Method for the Mechanical Derivation of Formulas in Elementary Geometry. 291-299 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Chou87 2004-02-04 An Introduction to Wu's Method for Mechanical Theorem Proving in Geometry. 237-267 1988 4 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Chou88 2004-02-04 CLIN-S - A Semantically Guided First-Order Theorem Prover. 183-188 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#ChuP97 2004-02-04 Unification Algorithms for Eliminating and Introducing Quantifiers in Natural Deduction Automated Theorem Proving. 105-134 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Dafa97 2004-02-04 Unification in Datastructure Multisets. 75-88 1986 2 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Buttner86 2004-02-04 Reasoning about Solids Using Constraint Logic Programming. 241-262 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#PesantB99 2004-02-04 A More Expressive Formulation of Many Sorted Logic. 113-200 1987 3 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Cohn87 2004-02-04 The Notion of Proof in Hardware Verification. 127-139 1989 5 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Cohn89 2004-02-04 First-Order Modal Tableaux. 191-213 1988 4 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Fitting88 2004-02-04 Tableaux for Logic Programming. 175-188 1994 13 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Fitting94 2004-02-04 A Note on the Parallel Complexity of Anti-Unification. 381-389 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#KuperMPP92 2004-02-04 Structure Sharing for Quantified Terms: Fundamentals. 115-145 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#StaplesR90 2004-02-04 An Inexact Reasoning Algorithm Based on Fuzzy Rule Matrix Transformations. 77-90 1992 8 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#ChenKC92 2004-02-04 Automated Proof Construction in Type Theory Using Resolution. 253-275 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#BezemHN02 2004-02-04 Violet. 259-264 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Greenbaum97 2004-02-04 Uncertainty Management with Imprecise Knowledge with Application to Design. 217-230 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#BrownM92 2004-02-04 Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm. 53-177 2003 30 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#RusinowitchSK03 2004-02-04 Single Elementary Associative-Commutative Matching. 35-51 2002 28 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#Eker02 2004-02-04 Equivalence of Propositional Prolog Programs. 319-335 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#BuningLS90 2004-02-04 An Approach to Systems Verification. 411-428 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#BevierHMY89 2004-02-04 Ordered Semantic Hyper-Linking. 167-217 2000 25 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#PlaistedZ00 2004-02-04 On the Computation of the Disjunctive Well-Founded Semantics. 333-356 2001 26 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#Johnson01 2004-02-04 On the Termination of Clause Graph Resolution. 83-115 1994 13 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Johnson94 2004-02-04 Deduction Trees and the View Update Problem in Indefinite Deductive Databases. 31-85 1997 19 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#Johnson97 2004-02-04 Type Inference Verified: Algorithm W in Isabelle/HOL. 299-318 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#NaraschewskiN99 2004-02-04 Using Resolution for Testing Modal Satisfiability and Building Models. 205-232 2002 28 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#HustadtS02 2004-02-04 The CADE-13 ATP System Competition. 137-138 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#SutcliffeS97 2004-02-04 The TPTP Problem Library - CNF Release v1.2.1. 177-203 1998 21 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#SutcliffeS98 2004-02-04 The CADE-15 ATP System Competition. 1-23 1999 23 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#SutcliffeS99 2004-02-04 Towards Mechanical Metamathematics. 407-434 1985 1 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Shankar85 2004-02-04 Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy. 137-193 1999 23 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#Gelder99 2004-02-04 Distributivity in [Lstrok][aleph]0 and Other Sentential Logics. 141-156 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#HarrisF01 2004-02-04 Computer Proofs in Gödel's Class Theory with Equational Definitions for Composite and Cross. 311-339 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#Belinfante99 2004-02-04 Comparing Parameter Schemes for Propositional Reasoning: An Empirical Study. 367-394 1992 8 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Hall92 2004-02-04 Proving Termination of Normalization Functions for Conditional Experessions. 63-74 1986 2 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Paulson86 2004-02-04 The Foundation of a Generic Theorem Prover. 363-397 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Paulson89 2004-02-04 Set Theory for Verification: I. From Foundations to Functions. 353-389 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Paulson93 2004-02-04 Simplification in a Satisfiability Checker for VLSI Applications. 115-136 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Vlach93 2004-02-04 Set Theory for Verification. II: Induction and Recursion. 167-215 1995 15 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#Paulson95 2004-02-04 Decidability by Resolution for Propositional Modal Logics. 379-396 1999 22 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#Schmidt99 2004-02-04 Triviality and Dimension of a System of Algebraic Differential Equations. 365-385 1998 20 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#Kandri-RodyMS98 2004-02-04 Partial Functions in a Total Setting. 85-104 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#FinnFL97 2004-02-04 Transcendental Functions and Mechanical Theorem Proving in Elemantary Geometries. 403-417 1990 6 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Gao90 2004-02-04 Research in Intelligent Robots. 13-17 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Hong85 2004-02-04 SETHEO: A High-Performance Theorem Prover. 183-212 1992 8 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#LetzSBB92 2004-02-04 Basic Principles of Mechanical Theorem Proving in Elementary Geometries. 221-252 1986 2 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Wen-Tsun86 2004-02-04 Mechanical Theorem Proving of Differential Geometries and Some of its Applications in Mechanics. 171-191 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Wen-Tsun91 2004-02-04 Partial Instantiation Methods for Inference in First-Order Logic. 371-396 2002 28 J. Autom. Reasoning 5 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#HookerRCS02 2004-02-04 Testing Positiveness of Polynomials. 23-38 1998 21 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#HongJ98 2004-02-04 Protected Completions of First-Order General Logic Programs. 147-172 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#LuS90 2004-02-04 Completeness Issues in RUE-NRF Deduction: The Undecidability of Viability. 371-388 1993 10 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#LuS93 2004-02-04 A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases. 191-235 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#NgS93 2004-02-04 Hierarchical Deduction. 35-77 1987 3 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#WangB87 2004-02-04 SPASS - Version 0.49. 247-252 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Weidenbach97 2004-02-04 Solving Open Problems in Right Alternative Rings with Z-Module Reasoning. 141-165 1989 5 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#WangS89 2004-02-04 Local Search Algorithms for SAT: An Empirical Evaluation. 421-481 2000 24 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#HoosS00 2004-02-04 Microprocessor Design Verification. 429-460 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Hunt89 2004-02-04 OTTER Experiments in a System of Combinatory Logic. 413-426 1995 14 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Jech95 2004-02-04 How to Clear a Block: A Theory of Plans. 343-377 1987 3 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#MannaW87 2004-02-04 A Milestone Reached and a Secret Revealed. 89-95 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Wos01 2004-02-04 The Strategy of Cramming. 179-204 2003 30 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#Wos03 2004-02-04 Editorial: A Journal Is Born. 1-3 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Wos85 2004-02-04 Some Obstacles to the Automation of Reasoning and the Problem of Redundant Information. 81-90 1987 3 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Wos87 2004-02-04 The Problem of Finding a Strategy to Control Binary Paramodulation. 101-107 1988 4 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Wos88 2004-02-04 The Problem of Finding an Inference Rule for Set Theory. 93-95 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Wos89 2004-02-04 The Problem of Choosing between Logic Programming and General-Purpose Automated Reasoning. 77-78 1990 6 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Wos90 2004-02-04 The Problem of Finding a Restriction Strategy More Effective Than the Set of Support Strategy. 105-107 1991 7 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Wos91 2004-02-04 The Problem of Choosing between Using and Avoiding Eqyality Predicates. 307-309 1992 8 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Wos92 2004-02-04 The Problem of Automated Theorem Finding. 137-138 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Wos93 2004-02-04 Searching for Circles of Pure Proofs. 279-315 1995 15 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#Wos95 2004-02-04 The Power of Combining Resonance with Heat. 23-81 1996 17 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#Wos96 2004-02-04 Automating the Search for Elegant Proofs. 135-175 1998 21 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#Wos98 2004-02-04 Parallelization of a Hyper-Linking-Based Theorem Prover. 67-106 2001 26 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#WuL01 2004-02-04 Well-Behaved Inference Rules for First-Order Theorem Proving. 381-400 1998 21 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#WuL98 2004-02-04 A Benchmark Method for the Propositional Modal Logics K, KT, S4. 297-317 2000 24 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#BalsigerHS00 2004-02-04 SATCHMORE: SATCHMO with REIevancy. 325-351 1995 14 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#LovelandRW95 2004-02-04 Interest Driven Suppositional Reasoning. 419-461 1990 6 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Pollock90 2004-02-04 Model Theoretic Approach to View Updates in Deductive Databases. 171-197 1996 17 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#FernandezGM96 2004-02-04 General Algorithms for Permutations in Equational Inference. 223-268 2001 26 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#AvenhausP01 2004-02-04 Predicate Logic Hacker Tricks. 435-440 1985 1 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Ohlbach85 2004-02-04 Link Inheritance in Abstract Clause Graphs. 1-34 1987 3 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Ohlbach87 2004-02-04 Elimination of Self-Resolving Clauses. 317-336 1998 20 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#Ohlbach98 2004-02-04 Coloring Terms to Control Equational Reasoning. 399-442 1997 18 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Hutter97 2004-02-04 Approaching Hard Non-Classical Problems. 635-637 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#ThistlewaiteM91 2004-02-04 Strategies for Modal Resolution: Results and Problems. 1-38 1990 6 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#AuffrayEH90 2004-02-04 Short Proofs of the Pigeonhole Formulas Based on the Connection Method. 287-297 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Bibel90 2004-02-04 Eliminating Duplication with the Hyper-Linking Strategy. 25-42 1992 9 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#LeeP92 2004-02-04 Improving the Efficiency of a Hyperlinking-Based Theorem Prover by Incremental Evaluation with Network Structures. 359-388 1994 12 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#LeeW94 2004-02-04 LINUS - A Link Instantion Prover with Unit Support. 205-210 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Letz97 2004-02-04 Robot Selection Expert `Rose'. 357-390 1985 1 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Mauceri85 2004-02-04 Implementing the `Fool's Model' of Combinatory Logic. 597-630 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#MeyerBP91 2004-02-04 Interpreting Disjunctive Logic Programs Based on a Strong Sense of Disjunction. 345-370 1993 10 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#LuBH93 2004-02-04 Inductive Expansion: A Calculus for Verifying and Synthesizing Functional and Logic Programs. 27-103 1991 7 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Padawitz91 2004-02-04 Backchain Iteration: Towards a Practical Inference Method That Is Simple Enough to Be Proved Terminating, Sound, and Complete. 1-22 1993 11 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Walker93 2004-02-04 A Framework for Automated Reasoning in Multiple-Valued Logics. 39-67 1998 21 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#LuMR98 2004-02-04 Inference Rules Using Local Contexts. 445-462 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Monk88 2004-02-04 A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles. 235-256 2002 28 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#CremannsO02 2004-02-04 Challenge Problems in Elementary Calculus. 341-359 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Bledsoe90 2004-02-04 SETHEO and E-SETHEO - The CADE-13 Systems. 237-246 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#MoserILSGSM97 2004-02-04 Mathematical Programming Embeddings of Logic. 91-106 2002 29 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#BorkarCM02 2004-02-04 An Algorithm for General Set Unification and Its Complexity. 45-63 1999 22 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#Stolzenburg99 2004-02-04 The Saturated Tableaux for Linear Miniscoped Horn-like Temporal Logic. 391-407 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Pliuskevicius94 2004-02-04 An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases. 145-172 1994 13 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#SakamaI94 2004-02-04 On the Completeness of Incidence Calculus. 355-368 1996 16 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#WangWY96 2004-02-04 Automated Reasoning in Differential Geometry and Mechanics Using the Characteristic Set Method. Part II. Mechanical Theorem Proving. 173-189 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#ChouG93a 2004-02-04 Experimenting with Isabelle in ZF Set Theory. 15-58 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Noel93 2004-02-04 A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering. 219-246 2000 25 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#ChouGZ00 2004-02-04 Automated Production of Traditional Proofs in Solid Geometry. 257-291 1995 14 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#ChouGZ95 2004-02-04 Automated Generation of Readable Proofs with Geometric Invariants. 349-370 1996 17 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#ChouGZ96 2004-02-04 Expert Systems. 28-35 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Buchanan85 2004-02-04 Model Minimization - An Alternative to Circumscription. 1-13 1988 4 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Hintikka88 2004-02-04 Algorithms and Proofs Inheritancey in the FOC Language. 337-363 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#PrevostoD02 2004-02-04 Automatically Identifying the Asymptotic Behavior of Nonlinear Singularly Perturbed Boundary Value Problems. 395-419 1992 8 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#RussoP92 2004-02-04 Gentzen-Type Systems, Resolution and Tableaux. 265-281 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Avron93 2004-02-04 The Unification Hierarchy is Undecidable. 369-381 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Nutt91 2004-02-04 Cotrolled Integration of the Cut Rule into Connection Tableaux Calculi. 297-337 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#LetzMG94 2006-05-08 A Fuzzy Expert System Shell Using Both Exact and Inexact Reasoning. 207-233 1989 5 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#LeungL89 2004-02-04 Generating Relevant Models. 359-368 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Ramsay91 2004-02-04 Theorem Proving for Intensional Logic. 237-255 1995 14 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Ramsay95 2004-02-04 Tableaux-based Theorem Provers: Systems and Implementations. 409-421 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Schumann94 2004-02-04 An Improved Refutation System for Intuitionistic Predicate Logic. 361-373 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#MiglioliMO94 2004-02-04 Automated Reasoning about Elementary Point-Set Topology. 239-255 1989 5 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#WickM89 2004-02-04 A Type-Theoretic Interpretation of Constructive Domain Theory. 369-425 1996 16 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#Hedberg96 2004-02-04 A New Probabilistic Induction Method. 5-24 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#HouHTK97 2004-02-04 TABLEAUX: A General Theorem Prover for Modal Logics. 489-510 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Catach91 2004-02-04 Semi-Thue Systems with an Inhibitor. 409-431 2001 26 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#McNaughton01 2004-02-04 On the Declarative and Procedural Semantics of Logic Programs. 167-205 1989 5 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Przymusinski89 2004-02-04 A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions. 347-371 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#Jaume99 2004-02-04 Formalizing Synthetic Domain Theory. 411-444 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#Reus99 2004-02-04 Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability. 271-284 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#ParlamentoP91 2004-02-04 Tractability Through Symmetries in Propositional Calculus. 89-102 1994 12 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#BenhamouS94 2004-02-04 More Proofs of an Axiom of Lukasiewicz. 59-66 2002 29 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#Slaney02 2004-02-04 The Ackermann Constant Theorem: A Computer-Assisted Investigation. 453-474 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Slaney91 2004-02-04 Finding Shortest Proofs: An Application of Linked Inference Rules. 123-139 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Veroff01 2004-02-04 The Linked Inference Principle, I: The Formal Treatment. 213-274 1992 8 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Veroff92 2004-02-04 Using Hints to Increase the Effectiveness of an Automated Reasoning Program: Case Studies. 223-239 1996 16 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#Veroff96 2004-02-04 Automated Analysis of Operators on State Tables: A Technique for Intelligent Search. 127-153 1986 2 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Kramer86 2004-02-04 Efficient Parallel Term Matching and Anti-Unification. 391-406 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#DelcherK92 2004-02-04 Resolution for Skeptical Stable Model Semantics. 391-421 2001 27 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Bonatti01 2004-02-04 Autoepistemic Logic Programming. 35-67 1994 13 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Bonatti94 2004-02-04 Kit and the Short Stack. 519-530 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Bevier89 2004-02-04 TPS: A Theorem-Proving System for Classical Type Theory. 321-353 1996 16 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#AndrewsBINPX96 2004-02-04 Satchmo - The Compiling and Functional Variants. 227-236 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#GeislerPS97 2004-02-04 Studies of a Theory of Specifications with Built-in Program Extraction. 61-87 2001 27 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#SeveriS01 2004-02-04 Temporal Logic CTL + PROLOG. 49-65 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Tang89 2004-02-04 Programming in Temporal-Nonmonotonic Reasoning. 383-401 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Tang91 2004-02-04 Exploitation of Parallel Processing for Implementing High-Performance Deduction Systems. 23-38 1992 8 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#JindalOK92 2004-02-04 Recognizing Unnecessary Clauses in Resolution Based Systems. 43-76 1992 9 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Benanav92 2004-02-04 A Correct Logic Programming Computation of Default Logic Extensions. 25-46 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#AntoniouL97 2004-02-04 RRTP - A Replacement Rule Theorem Prover. 221-226 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#ParamasivamP97 2004-02-04 Automated Deduction Techniques for Classification in Description Logic Systems. 337-364 1998 20 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#ParamasivamP98 2004-02-04 Guided Local Search for Solving SAT and Weighted MAX-SAT Problems. 205-223 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#MillsT00 2004-02-04 A Note on a Canonical Theory with Undecidable Unification and Matching Problem. 379-381 1987 3 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Bockmayr87 2004-02-04 The Automation of Syllogistic. 173-187 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#CantoneOP90 2004-02-04 Shortest Single Axioms for the Equivalential Calculus with CD and RCD. 283-316 1998 20 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#Hodgson98 2004-02-04 A Logic Programming System for Nonmonotonic Reasoning. 93-147 1995 14 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#AlferesDP95 2004-02-04 `Classical' Negation in Nonmonotonic Reasoning and Logic Programming. 107-142 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#AlferesPP98 2004-02-04 Z-Match: An Inference Rule for Incrementally Elaborating Set Instantiations. 391-428 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#BailinB93 2004-02-04 An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic. 297-311 2001 27 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Fiorino01 2004-02-04 Computational Complexity of Simultaneous Elementary Matching Problems. 107-136 1999 23 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#HermannK99 2004-02-04 Case Studies of Z-Module Reasoning: Proving Benchmark Theorems from Ring Theory. 437-451 1987 3 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Wang87 2004-02-04 Inference Flexibility in Horn Clause Knowledge Bases and the Simplex Method. 269-288 1993 11 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Wang93 2004-02-04 A New Approach for Automatic Theorem Proving in Real Geometry. 357-380 1998 21 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#DolzmannSW98 2004-02-04 Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof. 587-596 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#MintsT91 2004-02-04 The Propositional Formula Checker HeerHugo. 101-125 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#GrooteW00 2004-02-04 Non-Negative Integer Basis Algorithms for Linear Equations with Integer Coefficients. 25-35 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Lankford89 2004-02-04 Automated Reasoning in Differential Geometry and Mechanics Using the Characteristic Set Method. Part I. An Improved Version of Ritt-Wu's Decomposition Algorithm. 161-172 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#ChouG93 2004-02-04 Automated Generation of Readable Proofs with Geometric Invariants I. Multiple and Shortest Proof Generation. 325-347 1996 17 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#ChouG96 2004-02-04 Formal Verification of a Partial-Order Reduction Technique for Model Checking. 265-298 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#ChouP99 2004-02-09 Proving Geometry Theorems with Rewrite Rules. 253-273 1986 2 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#ChouS86 2004-02-04 A Model-Based Belief Revision System. 157-208 1994 12 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#ChouW94 2004-02-04 Bounded-Overhead Caching for Definite-Clause Theorem Proving. 83-113 1993 11 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#SegreS93 2004-02-04 A Decision Method for Nonmonotonic Reasoning Based on Autoepistemic Reasoning. 3-42 1995 14 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Niemela95 2004-02-04 Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus. 107-124 2002 29 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#WosUF02 2004-02-04 Paramodulation and Knuth-Bendix Completion with Nontotal and Nonmonotonic Orderings. 99-120 2003 30 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#BofillGNR03 2004-02-04 Preface: Logics for Artificial Intelligence. 1-3 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#AlferesP98 2004-02-04 Conquering the Meredith Single Axiom. 175-199 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Wos01a 2004-02-04 What Is Automated Reasoning? 6-9 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Wos85a 2004-02-04 The Problem of Choosing the Inference Rule to Employ. 201-209 1987 3 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Wos87a 2004-02-04 The Problem of Extending the Set of Support Strategy. 319-328 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Wos87b 2004-02-04 The Problem of Definition Expansion and Contraction. 433-435 1987 3 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Wos87c 2004-02-04 The Problem of Explaining the Disparate Performance of Hyperresolution and Paramodulation. 215-217 1988 4 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Wos88a 2004-02-04 The Problem of Self-Analytically Choosing the Set of Support. 327-329 1988 4 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Wos88b 2004-02-04 The Problem of Self-Analytically Choosing the Weights. 463-464 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Wos88c 2004-02-04 The Problem of Determining the Size of a Complete Set of Reductions. 235-237 1989 5 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Wos89a 2004-02-04 The Problem of Guaranteeing the Existence of a Complete Set of Reductions. 399-401 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Wos89b 2004-02-04 The Problem of Guaranteeing the Absence of a Complete Set of Reductions. 531-532 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Wos89c 2004-02-04 The Problem of Finding a Mapping between Clause Representation and Natural-Deduction Representation. 211-212 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Wos90a 2004-02-04 Meeting the Challenge of Fifty Years of Logic. 213-232 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Wos90b 2004-02-04 The Problem of Finding a Semantic Strategy for Focusing Inference Rules. 337-339 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Wos90c 2004-02-04 The Problem of Choosing between Predicate and Function Notation for Problem Representation. 463-464 1990 6 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Wos90d 2004-02-04 The Problem of Choosing the Type of Subsumption to Use. 435-438 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Wos91a 2004-02-04 The Problem of Choosing the Representation, Inference Rule, and Strategy. 631-634 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Wos91b 2004-02-04 The Problem of Reasoning from Inequalities. 421-426 1992 8 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Wos92a 2004-02-04 The Problem of Demodulation During Inference Rule Application. 141-143 1992 9 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Wos92b 2004-02-04 Note on McCune's Article on Discrimination Trees. 145-146 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Wos92c 2004-02-04 The Problem of Demodulator Adjunction. 289-290 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Wos92d 2004-02-04 The Problem of Demodulating Across Argument and Literal Boundaries. 407-408 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Wos92e 2004-02-04 The Problem of Selecting an Approach Based on Prior Success. 283-284 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Wos93a 2004-02-04 The Kernel Strategy and Its Use for the Study of Combinatory Logic. 287-343 1993 10 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Wos93b 2004-02-04 The Problem of Reasoning by Analogy. 421-422 1993 10 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Wos93c 2004-02-04 The Problem of Naming and Function Replacement. 147-148 1993 11 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Wos93d 2004-02-04 The Problem of Reasoning by Case Analysis. 289-291 1993 11 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Wos93e 2004-02-04 The Problem of Induction. 433-434 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Wos93f 2004-02-04 OTTER and the Moufang Identity Problem. 215-257 1996 17 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#Wos96a 2004-02-04 The Hot List Strategy. 1-44 1999 22 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#WosP99 2004-02-04 An Automated Reasoning Problem Associated with Proving Claims about Programs Using Floyd-Hoare Inductive Assertin Methods. 533-540 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#ChisholmSW89 2004-02-04 Experiments with Discrimination-Tree Indexing and Path Indexing for Term Retrieval. 147-167 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#McCune92a 2004-02-04 Experiments with Semantic Paramodulation. 231-261 1985 1 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#McCuneH85 2004-02-04 A Case Study in Automated Theorem Proving: Finding Sages in Combinatory Logic. 91-107 1987 3 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#McCuneW87 2004-02-04 Otter - The CADE-13 Competition Incarnations. 211-220 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#McCuneW97 2004-02-04 Near-Horn Prolog and Beyond. 1-26 1991 7 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Loveland91 2004-02-04 The Use of Lemmas in the Model Elimination Procedure. 117-141 1997 19 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#AstrachanL97 2004-02-04 Deduction in Non-Horn Databases. 141-160 1985 1 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#YahyaH85 2004-02-04 Incidence Calculus: A Mechanism for Probabilistic Reasoning. 263-283 1985 1 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Bundy85 2004-02-04 Correctness Criteria of Some Algorithms for Uncertain Reasoning Using Incidence Calculus. 109-126 1986 2 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Bundy86 2004-02-04 Ordered Semantic Hyper Tableaux. 17-57 2002 29 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#YahyaP02 2004-02-04 CLP(R) and Some Electrical Engineering Problems. 231-260 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#HeintzeMS92 2004-02-04 Default Reasoning by Deductive Planning. 1-40 1995 15 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#ThielscherS95 2004-02-04 Seventy-Five Problems for Testing Automatiac Theorem Provers. 191-216 1986 2 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Pelletier86 2004-02-04 A Class of Confluent Term Rewriting Systems and Unification. 391-418 1986 2 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#YouS86 2004-02-04 Reduction and Unification in Lambda Calculi with a General Notion of Subtype. 389-406 1994 12 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#QianN94 2004-02-04 Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem. 181-222 1996 16 J. Autom. Reasoning 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#KaufmannP96 2004-02-04 Middle-Out Reasoning for Synthesis and Induction. 113-145 1996 16 J. Autom. Reasoning 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#KraanBB96 2004-02-04 Autoepistemic Logic of First Order and Its Expressive Power. 69-82 1994 13 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Yuan94 2004-02-04 A Skeptic's Approach to Combining HOL and Maple. 279-294 1998 21 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#HarrisonT98 2004-02-04 Automated Proofs of Löb's Theorem and Gödel's Two Incompleteness Theorems. 219-231 1988 4 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Quaife88 2004-02-04 Automated Development of Tarski's Geometry. 97-118 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Quaife89 2004-02-04 Unsolved Problems in Elementary Number Theory. 287-300 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Quaife91 2004-02-04 Automated Deduction in von Neumann-Bernays-Gödel Set Theory. 91-147 1992 8 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Quaife92 2004-02-04 Robbins Algebra: Conditions That Make a Near-Boolean Algebra Boolean. 465-489 1990 6 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Winker90 2004-02-04 SAT Local Search Algorithms: Worst-Case Study. 127-143 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#Hirsch00 2004-02-04 Algorithms for Finding Matrix Models of Propositional Calculi. 475-487 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Pritchard91 2004-02-04 SLDNF-Resolution with Equality. 297-306 1992 8 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Shepherdson92 2004-02-04 Automated Deduction by Theory Resolution. 333-355 1985 1 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Stickel85 2004-02-04 Schubert's Steamroller Problem: Formulation and Solutions. 89-101 1986 2 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Stickel86 2004-02-04 A Comparison of the Variable-Abstraction and Constant-Abstraction Methods for Associative-Commutative Unification. 285-289 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Stickel87 2004-02-04 A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. 353-380 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Stickel88 2004-02-04 Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction. 189-210 1994 13 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Stickel94 2004-02-04 A Calculus of Lambda Calculus Contexts. 29-59 2001 27 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#BognarV01 2004-02-04 The Theory of Idempotent Semigroups is of Unification Type Zero. 283-286 1986 2 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Baader86 2004-02-04 Automated Reasoning and Nonclassical Logics: Introduction. 447-451 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#McRobbie91 2004-02-04 A SAT Solver Using Reconfigurable Hardware and Virtual Logic. 5-36 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#AbramoviciS00 2004-02-04 Reasoning about Qualitative Spatial Relationships. 291-328 2000 25 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#SistlaY00 2004-02-04 Proof Sytrategies in Linear Logic. 273-304 1994 12 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#Tammet94 2004-02-04 Gandalf. 199-204 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Tammet97 2004-02-04 Flatterms, Discrimination Nets, and Fast Term Rewriting. 95-113 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Christian93 2004-02-04 Formalizing Strong Normalization Proofs of Explicit Substitution Calculi in ALF. 59-98 2003 30 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#KamareddineH03 2004-02-04 Some Lambda Calculus and Type Theory Formalized. 373-409 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#McKinnaP99 2004-02-04 A New Implementation of Automath. 365-387 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#Wiedijk02 2004-02-04 Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference. 347-376 1997 19 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#SturgillS97 2004-02-04 The Tail-Recursive SECD Machine. 43-62 1999 23 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#Ramsdell99 2004-02-04 Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases. 1-34 2002 28 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#Yahya02 2004-02-04 Conclusions about the CADE-13 ATP System Competition. 287-296 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#PelletierSS97 2004-02-04 Proving Matijasevich's Lemma with a Default Arithmetic Strategy. 439-446 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Wilding91 2004-02-04 An Implementation of LF with Coercive Subtyping & Universes. 3-27 2001 27 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#CallaghanL01 2004-02-04 Automated Synthesis of Recursive Programs from a forall-exists Logical Specification. 233-275 1998 21 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#ChazarainM98 2004-02-04 ROGET: A Knowledge-Based System for Acquiring the Conceptual Structure of a Diagnostic Expert System. 49-74 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Bennett85 2004-02-04 A Hyperbase for Binary Lattice Hyperidentities. 365-370 2000 24 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#PadmanabhanP00 2004-02-04 On the Recursive Decomposition Ordering with Lexicographical Status and Other Related Orderings. 39-49 1990 6 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Lescanne90 2004-02-04 Tableaux-Based Characterization and Theorem Proving for default Logic. 223-242 1994 13 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#RischS94 2004-02-04 Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car-Sequencing Problem. 1-42 1986 2 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#ParrelloK86 2004-02-04 Strategies in Model-Based Diagnosis. 81-105 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#FrohlichNS98 2004-02-04 What Holds in a Context? 79-93 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Corella93 2004-02-04 Unification in Abelian Semigroups. 247-283 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#HeroldS87 2004-02-04 The Lion and the Unicorn. 327-332 1985 1 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#OhlbachS85 2004-02-04 A Note on Assumptions about Skolem Functions. 267-275 1995 15 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#OhlbachW95 2004-02-04 Managing Structural Information by Higher-Order Colored Unification. 123-164 2000 25 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#HutterK00 2004-02-04 A Generalization of Analytic Deduction via Labelled Deductive Systems. Part I: Basic Substructural Logics. 243-281 1994 13 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#DAgostinoG94 2004-02-04 Computer-Aided Construction of Finite Geometric Spaces: Automated Verification of Geometric Constraints. 139-160 2001 26 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#GehrkeP01 2004-02-04 Experiments with Proof Plans for Induction. 303-324 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#BundyHHS91 2004-02-04 Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem. 319-346 1997 19 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#BundyGVW97 2004-02-04 Ordered Model Trees: A Normal Form for Disjunctive Deductive Databases. 117-143 1994 13 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#YahyaFM94 2004-02-04 A General Setting for Flexibly Combining and Augmenting Decision Procedures. 257-305 2002 28 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#JanicicB02 2004-02-04 Meta-Level Inference: Two Applications. 15-27 1988 4 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#BundyS88 2004-02-04 Relaxations of the Satisfiability Problem Using Semidefinite Programming. 37-65 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#KlerkMW00 2004-02-04 Weak Generalized Closed World Assumption. 293-307 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#RajasekarLM89 2004-02-04 A Branching Time Temporal Framework for Quantitative Reasoning. 205-232 2003 30 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#ChatterjeeDC03 2004-02-04 Solving Open Questions and Other Challenge Problems Using Proof Sketches. 157-174 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Veroff01a 2004-02-04 Certification of a Type Inference Tool for ML: Damas-Milner within Coq. 319-346 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#DuboisM99 2004-02-04 Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability. 173-204 2002 28 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#HorrocksP02 2004-02-04 Integrating Computer Algebra into Proof Planning. 327-355 1998 21 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#KerberKS98 2004-02-04 Decision Procedures for Elementary Sublanguages of Set Theory. 189-201 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#CantoneC90 2004-02-04 Decision Procedures for Elementary Sublanguages of Set Theory: XI. Multilevel Syllogistic Extended by Some Elementary Map Constructs. 231-256 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#CantoneS91 2004-02-04 A lambda-Unifiability Test for Set Theory. 269-286 1988 4 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Bailin88 2004-02-04 Meteor: Exploring Model Elimination Theorem Proving. 283-296 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Astrachan94 2004-02-04 On the Completeness of SLDENF-Resolution. 199-214 1996 17 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#Thielscher96 2004-02-04 The Watson Theorem Prover. 357-408 2001 26 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#HolmesA01 2004-02-04 Alternative Translation Techniques for Propositional and First-Order Modal Logics. 397-415 2002 28 J. Autom. Reasoning 5 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#MontanariPS02 2004-02-04 Reasoning about Equality. 209-228 1985 1 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#LuskO85a 2004-02-04 leanTAP: Lean Tableau-based Deduction. 339-358 1995 15 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#BeckertP95 2004-02-04 Resolution versus Search: Two Strategies for SAT. 225-275 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#RishD00 2004-02-04 External Rewriting for Skeptical Proof Assistants. 309-336 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#NguyenKK02 2004-02-04 Structuring Resolution Proofs by Introducing New Lemmata. 173-203 1997 19 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#Horwein97 2004-02-04 An Integral Theorem Prover And The Role Of Proof Planning. 275-295 1992 8 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#BakerZ92 2004-02-04 Explicit Representation of Terms Defined by Counter Examples. 301-317 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#LassezM87 2004-02-04 On Fourier's Algorithm for Linear Arithmetic Constraints. 373-379 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#LassezM92 2004-02-04 Designing Deductive Databases. 29-68 1988 4 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#HelmanV88 2005-04-25 On Subsumption in Distributed Derivations. 225-240 1994 12 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#BurkeH94 2004-02-04 Linear and Unit-Resulting Refutations for Horn Theories. 241-319 1996 16 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#Baumgartner96 2004-02-04 Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. 83-104 1999 23 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#BrodskyLLM99 2004-02-04 Signed Systems for Paraconsistent Reasoning. 191-213 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#BesnardS98 2004-02-04 Recursive Program Optimization Through Inductive Synthesis Proof Transformation. 65-115 1999 22 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#MaddenBS99 2004-02-04 Replacing Unification by Constraint Satisfaction to Improve Logic Program Expressiveness. 51-75 1990 6 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#RoachSW90 2004-02-04 A Path Ordering for Proving Termination of AC Rewrite Systems. 293-316 1995 14 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#KapurSZ95 2004-02-04 Circumscription and Implicit Definability. 391-405 1985 1 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Doyle85 2004-02-04 Modifying LOTOS Specifications by Means of Automatable Formula-Based Integrations. 33-58 2003 30 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#SantoneV03 2004-02-04 A Proof Procedure for the Logic of Hereditary Harrop Formulas. 115-145 1993 11 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Nadathur93 2004-02-04 Logic, Topology, and Integration. 353-381 1995 14 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Schlechta95 2004-02-04 Evaluation of Queries under Closed-World Assumption. Part II: The Hierarchical Case. 247-289 2000 25 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#Suchenek00 2004-02-04 First -Order Syntactic Characterizations of Minimal Entailment, Domain-Minimal Entailment, and Herbrand Entailment. 237-263 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Suchenek93 2004-02-04 Evaluation of Queries under Closed-World Assumption. 357-398 1997 18 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Suchenek97 2004-02-04 CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates. 337-356 1997 18 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#RameshBM97 2004-02-04 Intelligent Backtracking in Deduction Systems by Means of Extended Unification Graphs. 44-62 1986 2 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#DilgerJ86 2004-02-04 Relevant Logic Programming. 563-585 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Bollen91 2004-02-04 IMPS: An Interactive Mathematical Proof System. 213-248 1993 11 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#FarmerGT93 2004-02-04 A New Technique for Verifying and Correcting Logic Programs. 277-318 1997 19 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#CaferraP97 2004-02-04 Informational Logic as a Tool for Automated Reasoning. 167-190 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#ForcheriGM98 2004-02-04 Missing Proofs Found. 201-225 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#FitelsonW01 2004-02-04 Nonclassical Logic Theorem Proving. 35-37 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Wrightson85 2004-02-04 Automated Proofs of the Moufang Identities in Alternative Rings. 79-109 1990 6 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#AnantharamanH90 2004-02-04 Resolving Contradictions: A Plausible Semantics for Inconsistent Systems. 1-32 1994 12 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#Lozinskii94 2004-02-04 The Liberalized delta-Rule in Free Variable Semantic Tableaux. 211-221 1994 13 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#HahnleS94 2004-02-04 Proving Consistency Assertions for Automotive Product Data Management. 145-163 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#KuchlinS00 2004-02-04 Computing Circumscription Revisited: A Reduction Algorithm. 297-336 1997 18 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#DohertyLS97 2004-02-04 Nonstandard Analysis in ACL2. 323-351 2001 27 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#GamboaK01 2004-02-04 What You Always Wanted to Know about Rigid E-Unification. 47-80 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#DegtyarevV98 2004-02-04 Some Group Theoretic Examples with Completion Theorem Provers. 145-169 1996 17 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#LintonS96 2004-02-04 Inferring Negative Information from Disjunctive Databases. 397-424 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#RossT88 2004-02-04 Gröbner Bases in Exterior Algebra. 233-250 1990 6 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Stokes90 2004-02-04 A Procedure to Prove Statements in Differential Geometry. 203-209 1990 6 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#FerroG90 2004-02-04 An Erratum for Some Errata to ATP Problems. 135 1997 18 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#PelletierS97 2004-02-04 Triple Dots in a Formal Language. 223-239 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#Lukaszewicz99 2004-02-04 Stable and Extension Class Theory for Logic Programs and Default Logics. 345-366 1992 8 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#BaralS92 2004-02-04 Dualities Between Alternative Semantics for Logic Programming and Nonmonotonic Reasoning. 399-420 1993 10 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#BaralS93 2004-02-04 A Mechanically Verified Code Generator. 493-518 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Young89 2004-02-04 A Decidable First-Order Logic for Knowldge Representation. 361-388 1990 6 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Patel-Schneider90 2004-02-04 A Comparison of Mizar and Isar. 389-411 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#WenzelW02 2004-02-04 A Tableaux Prover for Domain Minimization. 375-390 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#Lorenz94 2004-02-04 Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. 337-358 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#SchreyeMSB91 2004-02-04 View Updates in Stratified Disjunctive Databases. 249-267 1993 11 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#GrantHLM93 2004-02-04 Current Trends in Logical Frameworks and Metalanguages. 1-2 2001 27 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#BasinF01 2004-02-04 A Calculus for and Termination of Rippling. 147-180 1996 16 J. Autom. Reasoning 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#BasinW96 2004-02-04 Structured Theory Development for a Mechanized Logic. 161-203 2001 26 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#KaufmannJM01 2004-02-04 Automated Reasoning in Geometry Theorem Proving with Prolog. 329-390 1986 2 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#CoelhoP86 2004-02-04 Choosing Directions for Rules. 395-431 1987 3 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#TreitelG87 2004-02-04 Automated Proofs of Equality Problems in Overbeek's Competition. 333-351 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Zhang93 2004-02-04 Constructing Finite Algebras with FALCON. 1-22 1996 17 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#Zhang96 2004-02-04 Single Axioms for Groups. 291-308 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Kunen92 2004-02-04 A Ramsey Theorem in Boyer-Moore Logic. 217-235 1995 15 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#Kunen95 2004-02-04 The Semantics of Answer Literals. 83-95 1996 17 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#Kunen96 2004-02-04 Nonconstructive Computational Mathematics. 69-97 1998 21 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#Kunen98 2004-02-04 Automatic Discovery of Theorems in Elementary Geometry. 63-82 1999 23 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#RecioV99 2004-02-04 Unification under Associativity and Idempotence is of Type Nullary. 277-281 1986 2 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Schmidt-Schauss86 2004-02-04 Inferring from Inconsistency in Preference-Based Argumentation Frameworks. 125-169 2002 29 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#AmgoudC02 2004-02-04 A Legacy Recalled and a Tradition Continued. 97-122 2001 27 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Ulrich01 2004-02-04 Checking Simple Properties of Transition Systems Defined by Thue Specifications. 337-369 2002 28 J. Autom. Reasoning 5 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#Knapik02 2004-02-04 Simplification Orderings: Putting Them to the Test. 389-397 1993 10 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#Steinbach93 2004-02-04 The CADE-11 Competitions: A Personal View. 315-316 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Overbeek93 2004-02-04 Autoepistemic Circumscription and Logic Programming. 143-160 1993 10 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#YuanY93 2004-02-04 The CADE-14 ATP System Competition. 99-134 1998 21 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#SuttnerS98 2004-02-04 Negation as Failure. Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions. 155-170 1986 2 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#AquilanoBBM86 2004-02-04 Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. 67-100 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#GomesSCK00 2004-02-04 Competing for the AC-Unification Race. 185-212 1993 11 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Boudet93 2004-02-04 Analogy in Inductive Theorem Proving. 117-147 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#MelisW99 2004-02-04 T-Resolution: Refinements and Model Elimination. 433-483 1999 22 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#FormisanoP99 2004-02-04 Generalization in the Presence of Free Variables: A Mechanically-Checked Correctness Proof for one Algorithm. 109-158 1991 7 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Kaufmann91 2004-02-04 An Extension of the Boyer-Moore Theorem Prover to Support First-Order Quantification. 355-372 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Kaufmann92 2004-02-04 Adding Equality to Semantic Tableaux. 225-246 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Reeves87 2004-02-04 A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion. 205-262 1997 19 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#BaumgartnerB97 2004-02-04 Model Elimination Without Contrapositives and Its Application to PTTP. 339-359 1994 13 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#BaumgartnerF94 2004-02-04 An Algorithm for the Retrieval of Unifiers from Discrimination Trees. 5-25 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#Nivelle98 2004-02-04 <sub>1</sub><sub>p</sub><sub>AC</sub><sub>1</sub><sub>q</sub>. 39-44 1992 8 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Domenjoud92 2004-02-04 Optimizing the Clausal Normal Form Transformation. 325-336 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Socher91 2004-02-04 Hilbert's Tenth Problem is of Unification Type Zero. 169-178 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Franzen92 2004-02-04 Decision Procedures for Elementary Sublanguages of Set Theory: X. Multilevel Syllogistic Extended by the Singleton and Powerset Operators. 193-230 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Cantone91 2004-02-04 Semantic Generalizations for Proving and Disproving Conjectures by Analogy. 27-45 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#DefourneauxBP98 2004-02-04 Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language. 41-81 1993 11 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#Felty93 2004-02-04 Nonsystematic Search and No-Good Learning. 483-533 2000 24 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#RichardsR00 2004-02-04 Induction Using Term Orders. 3-37 1996 16 J. Autom. Reasoning 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#BronsardRH96 2004-02-04 Hilbert's Twenty-Fourth Problem. 67-89 2002 29 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#ThieleW02 2004-02-04 Decision Procedures for Elementary Sublanguages of Set Theory: XII. Multilevel Syllogistic Extended with Singleton and Choice Operators. 257-270 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Ferro91 2004-02-04 An Extension of a Procedure to Prove Statements in Differential Geometry. 351-358 1994 12 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#Ferro94 2004-02-04 Clifford Algebraic Reduction Method for Automated Theorem Proving in Differential Geometry. 1-21 1998 21 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#HongboM98 2004-02-04 Modality and Interrupts. 43-91 1995 14 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Ginsberg95 2004-02-04 SLT-Resolution for the Well-Founded Semantics. 53-97 2002 28 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#ShenYY02 2004-02-04 Toupie: The µ-calculus over Finite Domains as a Constraint Language. 143-171 1997 19 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#CorsiniR97 2004-02-04 The Heine-Borel Challenge Problem. In Honor of Woody Bledsoe. 255-282 1998 20 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#Melis98 2004-02-04 Proof Reflection in Coq. 277-307 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#Hendriks02 2004-02-04 Using Typed Lambda Calculus to Implement Formal Systems on a Machine. 309-354 1992 9 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#AvronHMP92 2004-02-04 The Inevitability of Inconsistent Abstract Spaces. 23-41 1993 11 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#GiunchigliaW93 2004-02-04 Reasoning Theories. 291-331 2001 26 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#GiunchigliaPT01 2004-02-04 SAT-Based Decision Procedures for Classical Modal Logics. 143-171 2002 28 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#GiunchigliaTG02 2004-02-04 Single Step Tableaux for Modal Logics. 319-364 2000 24 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#Massacci00 2004-02-04 Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. 87-115 1997 19 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#NarendranO97 2004-02-04 Any Ground Associative-Commutative Theory Has a Finite Canonical System. 131-143 1996 17 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#NarendranR96 2004-02-04 Program Verification. 17-23 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#BoyerM85 2004-02-04 The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover. 117-172 1988 4 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#BoyerM88 2004-02-04 Proving Unsatisfiability of CNFs Locally. 417-434 2002 28 J. Autom. Reasoning 5 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#Goldberg02 2004-02-04 Short Single Axioms for Boolean Algebra. 1-16 2002 29 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#McCuneVFHFW02 2004-02-04 An Experiment with the Boyer-Moore Theorem Prover: A Proof of Wilson's Theorem. 121-139 1985 1 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Russinoff85 2004-02-04 A Mechanical Proof of Quadratic Reciprocity. 3-21 1992 8 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Russinoff92 2004-02-04 How to Avoid the Derivation of Redundant Clauses in Reasoning Systems. 77-97 1992 9 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Socher-Ambrosius92 2004-02-04 Proving Self-Utterances. 329-338 1987 3 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#MillerP87 2004-02-04 A Decision Procedure for Combinations of Propositional Temporal Logic and Other Specialized Theories. 171-190 1986 2 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#Plaisted86 2004-02-04 Non-Horn Clause Logic Programming Without Contrapositives. 287-325 1988 4 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Plaisted88 2004-02-04 A Sequent-Style Model Elimination Strategy and a Positive Refinement. 389-402 1990 6 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar6.html#Plaisted90 2004-02-04 The CADE-16 ATP System Competition. 371-396 2000 24 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#Sutcliffe00 2004-02-04 The CADE-17 ATP System Competition. 227-250 2001 27 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#Sutcliffe01 2004-02-04 Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution. 1-34 2000 25 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar25.html#SpencerH00 2004-02-04 Gazing: An Approach to the Problem of Definition and Lemma Use. 311-344 1992 8 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#Barker-Plummer92 2004-02-04 Unification Types of Completely Regular Semigroups. 171-182 2002 29 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#Mashevitzky02 2004-02-04 Completion for Multiple Reduction Orderings. 25-42 1999 23 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#KuriharaK99 2004-02-04 An Efficient Algorithm to Generate Prime Implicants. 149-170 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#ShinyP99 2004-02-04 A Machine-Checked Implementation of Buchberger's Algorithm. 107-137 2001 26 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#Thery01 2004-02-04 Metalogical Frameworks II: Developing a Reflected Decision Procedure. 171-221 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#AitkenCU99 2004-02-04 Resolution Theorem Proving in Reified Modal Logics. 103-130 1994 12 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#AitkenRS94 2004-02-04 A Set-Theoretic Translation Method for Polymodal Logics. 317-337 1995 15 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#DAgostinoMP95 2004-02-04 Parallelization of Deduction Strategies: An Analytical Study. 1-33 1994 13 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar13.html#BonacinaH94 2004-02-04 Uniform Strategies: The CADE-11 Theorem Proving Contest. 317-331 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#LuskM93 2005-02-16 Identification of Inductive Properties during Verification of Synchronous Sequential Circuits. 427-462 1995 14 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#ChakrabartiSM95 2004-02-04 CLIN-E - Smallest Instance First Hyper-Linking. 177-182 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Alexander97 2004-02-04 Non-Horn Problems. 103-114 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#LuskO85 2004-02-04 On Computing Logic Programs. 259-289 1996 17 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#Dimopoulos96 2004-02-04 An Algorithm for Dual Transformation in First-Order Logic. 353-389 2001 27 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#BittencourtT01 2004-02-04 Fuzzy Operator Logic and Fuzzy Resolution. 59-78 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#WeigertTL93 2004-02-04 SPTHEO - A Parallel Theorem Prover. 253-258 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#Suttner97 2004-02-04 SPS-Parallelism + SETHEO = SPTHEO. 397-431 1999 22 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#Suttner99 2004-02-04 A Semantics for a Class of Non-Deterministic and Causal Production System Programs. 305-349 1994 12 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#RaschidL94 2004-02-04 Logical Cryptanalysis as a SAT Problem. 165-203 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#MassacciM00 2004-02-04 The Design of the CADE-13 ATP System Competition. 139-162 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#SutcliffeS97a 2004-02-04 The Procedures of the CADE-13 ATP System Competition. 163-169 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#SutcliffeS97b 2004-02-04 The Results - of the CADE-13 ATP System Competition. 271-286 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#SutcliffeS97c 2004-02-04 The IJCAR ATP System Competition. 307-320 2002 28 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#SutcliffeSP02 2004-02-04 Obvious Inferences. 383-393 1987 3 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar3.html#Rudnicki87 2004-02-04 On Connections and Higher-Order Logic. 257-291 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Andrews89 2004-02-04 More on the Problem of Finding a Mapping between Clause Representation and Natural Deduction Representation. 285-286 1991 7 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#Andrews91 2004-02-04 The Rue Theorem-Proving System: The Complete Set if LIM+ Challenge Problems. 241-264 1994 12 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#Digricoli94 2004-02-04 A Simple and Efficient Boolean Solver for Constraint Logic Programming. 97-129 1996 17 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#CodognetD96 2004-02-04 Implementing the Davis-Putnam Method. 277-296 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#ZhangS00 2004-02-04 Barcelona. 171-176 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#NieuwenhuisRV97 2004-02-04 Set-Var. 293-314 1993 11 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar11.html#BledsoeF93 2004-02-04 What Is Automated Theorem Proving? 23-28 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#BledsoeH85 2004-02-04 Satisfiability in the Year 2000. 1-3 2000 24 J. Autom. Reasoning 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#GentW00 2004-02-04 Satisfiability in the Year 2000. 99 2002 28 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#GentW02 2004-02-04 Computations in Fragments of Intuitionistic Propositional Logic. 537-561 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#JonghHL91 2004-02-04 A Mechanically Verified Language Implementation. 461-492 1989 5 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Moore89 2004-02-04 Introduction to the OBDD Algorithm for the ATP Community. 33-46 1994 12 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#Moore94 2004-02-04 Automated Discovery of New Axiomatizations of the Left Group and Right Group Calculi. 1-24 1992 9 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#McCune92 2004-02-04 Single Axioms for Groups and Abelian Groups with Various Operations. 1-13 1993 10 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar10.html#McCune93 2004-02-04 Solution of the Robbins Problem. 263-276 1997 19 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#McCune97 2004-02-04 DISCOUNT - A Distributed and Learning Equational Prover. 189-198 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#DenzingerKS97 2004-02-04 New Worst-Case Upper Bounds for SAT. 397-420 2000 24 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar24.html#Hirsch00a 2004-02-04 Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA. 143-165 1998 20 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#BrassD98 2004-02-04 The Concept and Implementation of Skeletal Plans. 161-208 1985 1 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#FriedlandI85 2004-02-04 A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases. 263-309 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#ArieliA99 2004-02-04 On Equivalents of Well-Foundedness. 197-234 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#RudnickiT99 2004-02-04 Subgoal Strategies for Solving Board Puzzles. 215-253 1998 20 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar20.html#HuangM98 2004-02-04 Induction Proofs with Partial Functions. 1-49 2001 26 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#Giesl01 2004-02-04 Termination of Nested and Mutually Recursive Algorithms. 1-29 1997 19 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar19.html#Giesl97 2004-02-04 Autarkic Computations in Formal Proofs. 321-336 2002 28 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#BarendregtB02 2004-02-04 Horn Equational Theories and Paramodulation. 309-337 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#FurbachHS89 2004-02-04 A Compendium of Continuous Lattices in MIZAR. 189-224 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#BancerekR02 2004-02-04 Mechanical Certification of Systolic Algorithms. 67-91 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#PurushothamanS89 2004-02-04 TMPR: A Tree-Structured Modified Problem Reduction Proof Procedure and Its Extension to Three - Valued Logic. 47-88 1994 12 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#Mellouli94 2004-02-04 Set Theory in First-Order Logic: Clauses for Gödel's Axioms. 287-327 1986 2 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#BoyerLMOSW86 2004-02-04 On Computer-Assisted Proofs in Ordinal Number Theory. 341-378 1999 22 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar22.html#Belinfante99a 2004-02-04 Branching Rules for Satisfiability. 359-383 1995 15 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#HookerV95 2004-02-04 HARP: A Tableau-Based Theorem Prover. 69-100 1988 4 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#OppacherS88 2004-02-04 Tableaux and Sequent Calculus for Minimal Entailment. 99-139 1992 9 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#Olivetti92 2004-02-04 More Church-Rosser Proofs. 51-66 2001 26 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#Nipkow01 2004-02-04 A New Reduction Rule for the Connection Graph Proof Procedure. 425-444 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Munch88 2004-02-04 Productive Use of Failure in Inductive Proof. 79-111 1996 16 J. Autom. Reasoning 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#Ireland96 2004-02-04 Mechanical Procedure for Proof Construction via Closed Terms in Typed \lambda Calculus. 173-190 1988 4 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#Zaionc88 2004-02-04 A Foray Into Combinatory Logic. 419-431 1986 2 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar2.html#GlickfeldO86 2004-02-04 Formula Databases for High-Performance Resolution/Paramodulation Systems. 139-156 1994 12 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar12.html#ButlerO94 2004-02-04 On the Role of Automated Theorem Proving in the Compile-Time Derivation of Concurrency. 75-101 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Lengauer85 2004-02-04 Implicit Induction in Conditional Theories. 189-235 1995 14 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#BouhoulaR95 2004-02-04 A Mechanization of Unity in PC-NQTHM-92. 445-498 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#Goldschlag99 2004-02-04 Single Axioms for Odd Exponent Groups. 383-412 1995 14 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#HartK95 2004-02-04 Pattern-Directed Invocation with Changing Equations. 403-433 1991 7 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#FeldmanR91 2004-02-04 Writing Programs that Construct Proofs. 285-326 1985 1 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#ConstableKB85 2004-02-04 What Is the Inverse Method? 1-23 1989 5 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#Lifschitz89 2004-02-04 Preface to the Special Issue on Commonsense and Nonmonotonic Reasoning. 1 1995 14 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar14.html#Lifschitz95 2004-02-04 Logic Programming. 9-13 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Pereira85 2004-02-04 Analytica - An Experiment in Combining Theorem Proving and Symbolic Computation. 295-325 1998 21 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#BauerCZ98 2004-02-04 Opening the AC-Unification Race. 465-474 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#BurckertHKSSTZ88 2004-02-04 Unification in Boolean Rings. 381-396 1988 4 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#MartinN88 2004-02-04 Stochastic Boolean Satisfiability. 251-296 2001 27 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar27.html#LittmanMP01 2004-02-04 PARTHENON: A Parallel Theorem Prover for Non-Horn Clauses. 153-181 1992 8 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar8.html#BoseCLM92 2004-02-04 A Family of Goal Directed Theorem Provers Based on Conjunction and Implication: Part I. 511-536 1991 7 J. Autom. Reasoning 4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar7.html#GabbayK91 2004-02-04 Mechanizing Set Theory. 291-323 1996 17 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#PaulsonG96 2004-02-04 Complexity of Unification Problems with Associative-Commutative Operators. 261-288 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#KapurN92 2004-02-04 New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. 39-78 1996 16 J. Autom. Reasoning 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar16.html#KapurS96 2004-02-04 Proving Equivalence of Different Axiomatizations of Free Groups. 331-352 1988 4 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar4.html#KapurZ88 2004-02-04 A Formal Proof of Sylow's Theorem. 235-264 1999 23 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar23.html#KammullerP99 2004-02-04 The Warshall Algorithm and Dickson?s Lemma: Two Examples of Realistic Program Extraction. 205-221 2001 26 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#BergerSS01 2004-02-04 A Logic for Reasoning with Inconsistency. 179-215 1992 9 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar9.html#KiferL92 2004-02-04 An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. 101-142 2002 28 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar28.html#CadoliSGG02 2004-02-04 Using an Extended PROLOG to Solve the Lion and Unicorn Puzzle. 403-408 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#SchmidSF89 2004-02-04 Nicolog: A Simple Yet Powerful cc(FD) Language. 371-403 1996 17 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar17.html#SidebottomH96 2004-02-04 Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification. 121-151 2003 30 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#Voronkov03 2004-02-04 The Anatomy of Vampire Implementing Bottom-up Procedures with Code Trees. 237-265 1995 15 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#Voronkov95 2004-02-04 <i>E</i>-Unification. 205-231 1998 21 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar21.html#Voronkov98 2004-02-04 WALDMEISTER - High-Performance Equational Deduction. 265-270 1997 18 J. Autom. Reasoning 2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar18.html#HillenbrandBVL97 2004-02-04 STMM: A Set Theory for Mechanized Mathematics. 269-289 2001 26 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar26.html#Farmer01 2004-02-04 What Is Program Synthesis? 37-41 1985 1 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar1.html#Green85 2004-02-04 Discovering Inequality Conditions in the Analytic Solution of Optimization Problems. 339-362 1989 5 J. Autom. Reasoning 3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar5.html#CharMS89 2004-02-04 A Proof of GMP Square Root. 225-252 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#BertotMZ02 2004-02-04 A New Methodology for Query Answering in Default Logics via Structure-Oriented Theorem Proving. 95-165 1995 15 J. Autom. Reasoning 1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar15.html#Schaub95 2004-02-04 Special Issue Mechanizing and Automating Mathematics: In honour of N.G. de Bruijn - Preface. 183-188 2002 29 J. Autom. Reasoning 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar29.html#Kamareddine02 2004-02-04 A Type System for the Java Bytecode Language and Verifier. 271-321 2003 30 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/A:1025011624925 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#FreundM03 2004-02-04 Java Bytecode Verification. 233-233 2003 30 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/A:1025086804452 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#Nipkow03 2004-02-04 Java Bytecode Verification: Algorithms and Formalizations. 235-269 2003 30 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/A:1025055424017 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#Leroy03 2004-02-04 Bytecode Verification by Model Checking. 399-444 2003 30 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/A:1025059508087 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#BasinFG03 2004-02-04 Verified Bytecode Subroutines. 363-398 2003 30 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/A:1025095122199 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#KleinW03 2004-02-04 Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler. 323-361 2003 30 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/A:1025003423108 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar30.html#StarkS03 2004-02-04 From Bisimulation to Simulation: Coarsest Partition Problems. 73-103 2003 31 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/A:1027328830731 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#GentiliniPP03 2004-02-04 Herbrand Award Acceptance Speech. 169-187 2003 31 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000009552.54063.f3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#Andrews03 2004-02-04 The CADE-18 ATP System Competition. 23-32 2003 31 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/A:1027302123309 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#SutcliffeS03 2004-02-04 Partial Functions in ACL2. 107-127 2003 31 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000009505.07087.34 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#ManoliosM03 2004-02-04 Announcement. 105-105 2003 31 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000009622.67092.8d http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#Kapur03 2004-02-04 Abstract Congruence Closure. 129-168 2003 31 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000009518.26415.49 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#BachmairTV03 2004-02-04 Theorem Proving Modulo. 33-72 2003 31 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/A:1027357912519 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#DowekHK03 2004-02-04 A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke. 1-9 2003 31 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/A:1027322305654 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#Veroff03 2004-02-04 Theorem Proving Based on the Extension Rule. 11-21 2003 31 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/A:1027339205632 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#HaiSY03 2005-02-15 Living Book - Deduction, Slicing, and Interaction. 259-286 2004 32 J. Autom. Reasoning 3 http://dx.doi.org/10.1023/B:JARS.0000044872.51237.c9 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#BaumgartnerFGS04 2005-02-15 Top-Down Query Processing in First-Order Deductive Databases under the DWFS. 167-184 2004 32 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000030010.90643.41 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#Johnson04 2005-02-15 ETPS: A System to Help Students Write Formal Proofs. 75-92 2004 32 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/B:JARS.0000021871.18776.94 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#AndrewsBPBIX04 2005-02-15 Preface. 185-186 2004 32 J. Autom. Reasoning 3 http://dx.doi.org/10.1023/B:JARS.0000044948.61098.6c http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#Kapur04a 2005-02-15 A Matrix Characterization for Multiplicative Exponential Linear Logic. 121-166 2004 32 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000029976.22387.ac http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#KreitzM04 2005-02-15 Knowledge Compilation Using the Extension Rule. 93-102 2004 32 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000029959.45572.44 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#HaiS04 2005-02-15 Abductive Theorem Proving for Analyzing Student Explanations to Guide Feedback in Intelligent Tutoring Systems. 187-226 2004 32 J. Autom. Reasoning 3 http://dx.doi.org/10.1023/B:JARS.0000044823.50442.cd http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#MakatchevJV04 2005-02-15 Preface. 1-2 2004 32 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/B:JARS.0000022020.08299.5b http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#Kapur04 2005-02-15 Verification in the Classroom. 35-73 2004 32 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/B:JARS.0000021872.64036.41 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#WaltherS04 2005-02-15 A Proof Environment for Teaching Mathematics. 227-258 2004 32 J. Autom. Reasoning 3 http://dx.doi.org/10.1023/B:JARS.0000044825.55318.95 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#SommerN04 2005-02-15 Fast Term Indexing with Coded Context Trees. 103-120 2004 32 J. Autom. Reasoning 2 http://dx.doi.org/10.1023/B:JARS.0000029963.64213.ac http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#GanzingerNN04 2005-02-15 GRAMY: A Geometry Theorem Prover Capable of Construction. 3-33 2004 32 J. Autom. Reasoning 1 http://dx.doi.org/10.1023/B:JARS.0000021960.39761.b7 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar32.html#MatsudaV04 2005-03-18 <i>ACUI</i>Plus Distributivity Axioms. 1-28 2004 33 J. Autom. Reasoning 1 http://www.springerlink.com/index/10.1007/s10817-004-2279-7 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#AnantharamanNR04 2005-03-18 A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case. 251-269 2004 33 J. Autom. Reasoning 3-4 http://www.springerlink.com/index/10.1007/s10817-004-6243-3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#ZarbaCS04 2005-03-18 Octopus: Combining Learning and Parallel Search. 171-218 2004 33 J. Autom. Reasoning 2 http://www.springerlink.com/index/10.1007/s10817-004-3243-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#NewbornW04 2005-03-18 On the Complexity of Deduction Modulo Leaf Permutative Equations. 271-317 2004 33 J. Autom. Reasoning 3-4 http://www.springerlink.com/index/10.1007/s10817-004-6244-2 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#TourE04 2005-03-18 Reachability Analysis over Term Rewriting Systems. 341-383 2004 33 J. Autom. Reasoning 3-4 http://www.springerlink.com/index/10.1007/s10817-004-6246-0 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#FeuilladeGT04 2005-03-18 Representing and Building Models for Decidable Subclasses of Equational Clausal Logic. 133-170 2004 33 J. Autom. Reasoning 2 http://www.springerlink.com/index/10.1007/s10817-004-5555-7 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#Peltier04 2005-03-18 Constraint Solving for Proof Planning. 51-88 2004 33 J. Autom. Reasoning 1 http://www.springerlink.com/index/10.1007/s10817-004-2725-6 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#ZimmerM04 2005-03-18 Organizing Numerical Theories Using Axiomatic Type Classes. 29-49 2004 33 J. Autom. Reasoning 1 http://www.springerlink.com/index/10.1007/s10817-004-3997-6 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#Paulson04 2005-03-18 Preface. 219-220 2004 33 J. Autom. Reasoning 3-4 http://www.springerlink.com/index/10.1007/s10817-004-6240-6 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#KapurV04 2005-03-18 Model-Theoretic Methods in Combined Constraint Satisfiability. 221-249 2004 33 J. Autom. Reasoning 3-4 http://www.springerlink.com/index/10.1007/s10817-004-6241-5 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#Ghilardi04 2005-03-18 MPTP - Motivation, Implementation, First Experiments. 319-339 2004 33 J. Autom. Reasoning 3-4 http://www.springerlink.com/index/10.1007/s10817-004-6245-1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#Urban04 2005-03-18 Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts. 89-132 2004 33 J. Autom. Reasoning 2 http://www.springerlink.com/index/10.1007/s10817-004-6885-1 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar33.html#LiangNQ04 2006-03-30 A Trustworthy Proof Checker. 231-260 2003 31 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/B:JARS.0000021013.61329.58 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#AppelMSV03 2006-03-30 Preface. 189-190 2003 31 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/B:JARS.0000021173.25739.c5 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#Felty03 2006-03-30 Lightweight Bytecode Verification. 303-334 2003 31 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/B:JARS.0000021015.15794.82 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#Rose03 2006-03-30 Heap-Bounded Assembly Language. 261-302 2003 31 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/B:JARS.0000021014.79255.33 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#AspinallC03 2006-03-30 Trust and Partial Typing in Open Systems of Mobile Agents. 335-370 2003 31 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/B:JARS.0000021016.61054.3b http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#RielyH03 2006-03-30 A Syntactic Approach to Foundational Proof-Carrying Code. 191-229 2003 31 J. Autom. Reasoning 3-4 http://dx.doi.org/10.1023/B:JARS.0000021012.97318.e9 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar31.html#HamidSTMN03 2006-03-30 A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. 73-101 2005 34 J. Autom. Reasoning 1 http://dx.doi.org/10.1007/s10817-005-1970-7 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#JurkowiakLU05 2006-03-30 An Effective Algorithm for the Futile Questioning Problem. 31-47 2005 34 J. Autom. Reasoning 1 http://dx.doi.org/10.1007/s10817-005-0981-8 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#RemshagenT05 2006-03-30 Termination of String Rewriting Proved Automatically. 105-139 2005 34 J. Autom. Reasoning 2 http://dx.doi.org/10.1007/s10817-005-6545-0 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#Zantema05 2006-03-30 Preface. 103-104 2005 34 J. Autom. Reasoning 2 http://dx.doi.org/10.1007/s10817-006-7237-0 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#GieslK05 2006-03-30 Combining Sets with Cardinals. 1-29 2005 34 J. Autom. Reasoning 1 http://dx.doi.org/10.1007/s10817-005-3075-8 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#Zarba05 2006-03-30 Verifying Termination and Reduction Properties about Higher-Order Logic Programs. 179-207 2005 34 J. Autom. Reasoning 2 http://dx.doi.org/10.1007/s10817-005-6534-3 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#Pientka05 2006-03-30 Termination of Floating-Point Computations. 141-177 2005 34 J. Autom. Reasoning 2 http://dx.doi.org/10.1007/s10817-005-6546-z http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#SerebrenikS05 2006-03-30 A Tableau-Based Decision Procedure for a Fragment of Set Theory with Iterated Membership. 49-72 2005 34 J. Autom. Reasoning 1 http://dx.doi.org/10.1007/s10817-004-8271-4 http://www.informatik.uni-trier.de/~ley/db/journals/jar/jar34.html#CantoneZC05 2003-08-20 Editorial: Methodological Review. 51 2001 34 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1006/jbin.2001.1006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#X01 2003-08-20 Two biomedical sublanguages: a description based on the theories of Zellig Harris. 222-235 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00012-1 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#FriedmanKR02 2003-08-20 The potential of latent semantic analysis for machine grading of clinical case summaries. 3-7 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00004-7 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Kintsch02 2003-08-20 Book Reviews. 143 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1020 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#X01a 2003-08-20 JBI status report. 279-280 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00038-8 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Shortliffe02a 2003-08-20 Exploring the Utility of Demographic Data and Vaccination History Data in the Deduplication of Immunization Registry Patient Records. 37-50 2001 34 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1006/jbin.2001.1001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#MillerFS01 2005-09-12 A dynamic approach to mapping coordinates between microplates and microarrays. 306-312 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00033-9 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#CheungHNWLSWM02 2003-08-20 Comparing the Similarity of Time-Series Gene Expression Using Signal Processing Metrics. 396-405 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1037 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#ButteBRWK01 2003-08-20 Letters to the Editor. 299 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2002.1026 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#Basehoar01 2003-08-20 Logistic regression and artificial neural network classification models: a methodology review. 352-359 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00034-0 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#DreiseitlO02 2003-08-20 Methods of Cognitive Analysis to Support the Design and Evaluation of Biomedical Systems: The Case of Clinical Practice Guidelines. 52-66 2001 34 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1006/jbin.2001.1002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#PatelADGS01 2003-08-20 Information extraction from biomedical text. 260-264 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00015-7 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Hobbs02 2003-08-20 Archimedes: a new model for simulating health care systems--the mathematical formulation. 37-50 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00006-0 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#SchlessingerE02 2003-08-20 Automatic Lumbar Vertebral Identification Using Surface-Based Registration. 74-84 2001 34 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1006/jbin.2001.1003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#HerringD01 2003-08-20 Image Understanding Methods in Biomedical Informatics and Digital Imaging. 377-386 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1034 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#OgielaT01 2003-08-20 Electronic Medical Records: A Guide for Clinicians and Administrators.. 140-141 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00503-8 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Lowe02 2003-08-20 Maintaining and Incrementally Revalidating a Computer-Based Clinical Guideline: A Case Study. 99-111 2001 34 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1006/jbin.2001.1011 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#MillerFS01a 2003-08-20 Modeling Medical Prognosis: Survival Analysis Techniques. 428-439 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1038 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#Ohno-Machado01 2003-08-20 Methodology Used for "Software for Automated Linkage in Italy" (SALI). 387-395 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1036 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#MasoBF01 2003-08-20 The structure of science information. 215-221 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00011-X http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Harris02 2003-08-20 Ethical issues in public health informatics: implications for system design when sharing geographic information. 178-185 2002 35 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(02)00527-0 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#OlvingsonHTL02 2003-08-20 Rutabaga by any other name: extracting biological names. 247-259 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00014-5 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#HirschmanMY02 2003-08-20 Selective Automated Indexing of Findings and Diagnoses in Radiology Reports. 262-273 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2001.1025 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#HershMAL01 2003-08-20 Book Review: Computational inverse problems in electrocardiography. 51 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00008-4 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Widman02 2003-08-20 The epidemiology of liver disease in Tayside database: a population-based record-linkage study. 186-193 2002 35 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(02)00526-9 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#SteinkeWMMD02 2003-08-20 Comparative genomics approaches to study organism similarities and differences. 142-150 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00506-3 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#WeiLDSP02 2003-08-20 A Comparison of Machine Learning Methods for the Diagnosis of Pigmented Skin Lesions. 28-36 2001 34 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1006/jbin.2001.1004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#DreiseitlOKVBB01 2003-08-20 The cohesive metaschema: a higher-level abstraction of the UMLS Semantic Network. 194-212 2002 35 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(02)00528-2 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#PerlCHGZP02 2003-08-20 Accessing Heterogeneous Sources of Evidence to Answer Clinical Questions. 85-98 2001 34 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1006/jbin.2001.1012 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#MendoncaCJS01 2003-08-20 Editorial. 1-2 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00007-2 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Shortliffe02 2003-08-20 Wavelets and Imaging Informatics: A Review of the Literature. 129-141 2001 34 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1006/jbin.2001.1010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#Wang01 2003-08-20 Clinical Knowledge and Practice in the Information Age: A Handbook for Health Professionals. 144-145 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1017 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#Cimino01 2003-08-20 Health Geomatics: An Enabling Suite of Technologies in Health and Healthcare. 195-219 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1015 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#BoulosRC01 2003-08-20 Measuring agreement in medical informatics reliability studies. 99-110 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00500-2 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#HripcsakH02 2006-07-04 Characteristic attributes in cancer microarrays. 111-122 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00504-X http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#SarkarPBSSDF02 2003-08-20 Cell Image Segmentation with Kernel-Based Dynamic Clustering and an Ellipsoidal Cell Shape Model. 67-73 2001 34 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1006/jbin.2001.1009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#YangJ01 2003-09-24 Symbolic Representation of Anatomical Knowledge: Concept Classification and Development Strategies. 321-347 2001 34 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1006/jbin.2001.1030 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#CerveriP01 2003-08-20 Visualization and evaluation of clusters for exploratory analysis of gene expression data. 25-36 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00001-1 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#KimKO02 2003-08-20 Digital Subtraction Angiogram Registration Method with Local Distortion Vectors to Decrease Motion Artifact. 182-194 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1018 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#HiroshimaFHNOOFNTIY01 2003-08-20 A Comparison of Classification Algorithms to Automatically Identify Chest X-Ray Reports That Support Pneumonia. 4-14 2001 34 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1006/jbin.2001.1000 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#ChapmanFCH01 2003-08-20 Hierarchical data security in a Query-By-Example interface for a shared database. 171-177 2002 35 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(02)00524-5 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Taylor02 2003-08-20 Information extraction for enhanced access to disease outbreak reports. 236-246 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00013-3 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#GrishmanHY02 2003-08-20 Cancerous nuclei detection on digitized pathological lung color images. 92-98 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00501-4 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#SammoudaSNYM02 2003-08-20 A Knowledge-Based, Concept-Oriented View Generation System for Clinical Data. 112-128 2001 34 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1006/jbin.2001.1013 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#ZengC01 2003-08-20 Patient Safety, Potential Adverse Drug Events, and Medical Device Design: A Human Factors Engineering Approach. 274-284 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2001.1028 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#LinVD01 2003-08-20 Disambiguating Ambiguous Biomedical Terms in Biomedical Narrative Text: An Unsupervised Method. 249-261 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2001.1023 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#LiuLF01 2004-12-29 Medical Informatics and Bioinformatics: European Efforts to Facilitate Synergy. 423-427 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1042 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#MaojoIMCK01 2003-08-20 Automatically identifying gene/protein terms in MEDLINE abstracts. 322-330 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00032-7 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#YuHRW02 2003-08-20 Representations of health concepts: a cognitive perspective. 17-24 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00003-5 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Zhang02 2003-08-20 Reconstruction of the genetic regulatory dynamics of the rat spinal cord development: Local Invariants approach. 343-351 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00035-2 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#FofanovP02 2003-08-20 Revising regulatory networks: from expression data to linear causal models. 289-297 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00031-5 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#BaySPL02 2003-08-20 Editorial. 213-214 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00010-8 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Friedman02 2003-08-20 Formal nursing terminology systems: a means to an end. 298-305 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00002-9 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#HardikerBCH02 2003-08-20 Analysis of Complex Decision-Making Processes in Health Care: Cognitive Approaches to Health Informatics. 365-376 2001 34 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1006/jbin.2001.1021 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#Kushniruk01 2003-08-20 Computational selection of distinct class- and subclass-specific gene expression signatures. 160-170 2002 35 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(02)00525-7 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#BushelHBGAMAP02 2003-08-20 Extracting Knowledge from Dynamics in Gene Expression. 15-27 2001 34 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1006/jbin.2001.1005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#ReisBK01 2003-08-20 Representing Patient Preference-Related Concepts for Inclusion in Electronic Health Records. 415-422 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1035 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#RulandB01 2003-08-20 Developing, implementing, and evaluating decision support systems for shared decision making in patient care: a conceptual model and case illustration. 313-321 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00037-6 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#RulandB02 2003-08-20 A Hybrid Input-Output Approach to Model Metabolic Systems: An Application to Intracellular Thiamine Kinetics. 221-248 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2001.1022 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#BellazziGIP01 2003-08-20 Neural network-based system for early keratoconus detection from corneal topography. 151-159 2002 35 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(02)00513-0 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#AccardoP02 2003-08-20 Patients' and physicians' understanding of health and biomedical concepts: relationship to the design of EMR systems. 8-16 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00002-3 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#PatelAK02 2003-08-20 Heterogeneous Database Integration in Biomedicine. 285-298 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2001.1024 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#Sujansky01 2003-08-20 Emerging paradigms of cognition in medical decision-making. 52-75 2002 35 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/S1532-0464(02)00009-6 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#PatelKA02 2006-07-05 A Simple Algorithm for Identifying Negated Findings and Diseases in Discharge Summaries. 301-310 2001 34 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1006/jbin.2001.1029 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#ChapmanBHCB01 2003-08-20 Toward a Representation Format for Sharable Clinical Guidelines. 157-169 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1019 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#BoxwalaTPZOGSP01 2006-02-07 Reply. 299-300 2001 34 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1006/jbin.2002.1027 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#ReisBK01a 2003-08-20 A variance-based measure of inter-rater agreement in medical databases. 331-342 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00036-4 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#PeterssonGA02 2003-08-20 Automated enhancement of description logic-defined terminologies to facilitate mapping to ICD9-CM. 281-288 2002 35 Journal of Biomedical Informatics 5-6 http://dx.doi.org/10.1016/S1532-0464(03)00019-4 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#ElkinB02 2003-08-20 Evolutionary partial differential equations for biomedical image processing. 77-91 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00502-6 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#SartiMSL02 2003-08-20 High-Performance Implementation and Analysis of the Linkmap Program. 406-414 2001 34 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1006/jbin.2002.1031 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#KothariLP01 2003-08-20 An Evaluation of Extended vs. Weighted Least Squares for Parameter Estimation in Physiological Modeling. 348-364 2001 34 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1006/jbin.2001.1033 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#SpilkerV01 2004-03-11 Automatic Localization of Cephalometric Landmarks. 146-156 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1014 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#GrauALMK01 2003-08-20 Evidence-based careflow management systems: the case of post-stroke rehabilitation. 123-139 2002 35 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/S1532-0464(02)00505-1 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#PanzarasaMQPS02 2003-08-20 Sharable Representation of Clinical Guidelines in GLIF: Relationship to the Arden Syntax. 170-181 2001 34 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1006/jbin.2001.1016 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#PelegBBTGS01 2003-08-20 Use of an Interactive Tool to Assess Patients' Willingness-to-Pay. 311-320 2001 34 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1006/jbin.2002.1032 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi34.html#MatthewsRWG01 2003-08-20 Paraphrasing for condensation in journal abstracting. 265-277 2002 35 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/S1532-0464(03)00016-9 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi35.html#Kittredge02 2006-07-05 Inductive creation of an annotation schema for manually indexing clinical conditions from emergency department reports. 196-208 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#ChapmanD06 2006-07-04 From concepts to clinical reality: An essay on the benchmarking of biomedical terminologies. 288-298 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Smith06 2006-07-04 Using software agents to preserve individual health data confidentiality in micro-scale geographical analyses. 160-170 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#BoulosCPR06 2006-07-04 A medical bioinformatics approach for metabolic disorders: Biomedical data prediction, modeling, and systematic analysis. 147-159 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.05.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#ChenH06 2006-07-04 Methods in biomedical ontology. 252-266 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Yu06 2006-07-04 <i>FBN1</i>gene mutations. 171-183 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#BaumgartnerMSESB06 2006-07-04 Beyond the data deluge: Data integration and bio-ontologies. 314-320 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2006.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#BlakeB06 2006-07-04 Bioinformatics and biological reality. 274-287 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Johansson06 2006-07-04 Tree disagreement: Measuring and testing incongruence in phylogenies. 86-102 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Planet06 2006-07-04 What's in a character? 6-17 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#DeSalle06 2006-07-04 Granularity, scale and collectivity: When size does and does not matter. 333-349 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.08.010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#RectorRB06 2006-07-04 A machine learning perspective on the development of clinical decision support systems utilizing mass spectra of blood samples. 227-248 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#ShinM06 2006-07-04 Radiology interpretation process modeling. 103-114 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Noumeir06 2006-07-04 Introduction: International Medical Informatics Association Working Group 6 and the 2005 Rome Conference. 249-251 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2006.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#CiminoS06 2006-07-04 Phylogenetics in the modern era. 3-5 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Sarkar06 2006-07-04 Traversing the tangle: Algorithms and applications for cophylogenetic studies. 62-71 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#CharlestonP06 2006-07-04 Interpreting procedures from descriptive guidelines. 184-195 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#PelegGSP06 2006-07-04 A control study to evaluate a computer-based microarray experiment design recommendation system for gene-regulation pathways discovery. 126-146 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.05.011 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#YooCS06 2006-07-04 Semantic enrichment for medical ontologies. 209-226 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#LeeG06 2006-07-04 Homology assessment and molecular sequence alignment. 18-33 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Phillips06 2006-07-04 <i>part-of</i>is and isn't. 350-361 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#SchulzKB06 2006-07-04 Missing data and the design of phylogenetic analyses. 34-42 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Wiens06 2006-07-04 Representation in stochastic search for phylogenetic tree reconstruction. 43-50 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#WeberOS06 2006-07-04 In defense of the Desiderata. 299-306 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Cimino06 2006-07-04 Phylogenetics by likelihood: Evolutionary modeling as a tool for understanding the genome. 51-61 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#KosiolBW06 2006-07-04 Strategies for referent tracking in electronic health records. 362-378 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#CeustersS06 2006-07-04 Desiderata for domain reference ontologies in biomedicine. 307-313 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Burgun06 2006-07-04 Towards new information resources for public health - From WordNet to MedicalWordNet. 321-332 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#FellbaumHS06 2006-07-04 A computerized cellular imaging system for high content analysis in Monastrol suppressor screens. 115-125 2006 39 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.05.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#ZhouCPW06 2006-07-04 On exemplary scientific conduct regarding submission of manuscripts to biomedical informatics journals. 1-2 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#MillerHSHMGS06 2006-07-04 Conceptualizing the world: Lessons from history. 267-273 2006 39 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2005.08.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#McCray06 2006-07-04 Support versus corroboration. 72-85 2006 39 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2005.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi39.html#Egan06 2006-07-06 Discrimination and calibration of mortality risk prediction models in interventional cardiology. 367-375 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#MathenyOR05 2006-07-05 Individualizing generic decision models using assessments as evidence. 281-297 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#ScottS05 2006-07-05 Decisions about critical events in device-related scenarios as a function of expertise. 200-212 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.012 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#LaxmisanMKJP05 2006-07-05 Designing the design phase of critical care devices: a cognitive approach. 34-50 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#MalhotraLKZP05 2006-07-05 Prospective recruitment of patients with congestive heart failure using an ad-hoc binary classifier. 145-153 2005 38 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.11.016 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#PakhomovBC05 2006-07-05 <i>Journal of Biomedical Informatics</i>papers on computerized physician order entry systems. 267-269 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#KoppelLCS05 2006-07-05 Evaluation of a pulmonary graphical display in the medical intensive care unit: An observational study. 239-243 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#WachterMRW05 2006-07-05 Identifying reasoning strategies in medical decision making: A methodological guide. 154-171 2005 38 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2005.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#ArochaWP05 2006-08-30 Predicting dire outcomes of patients with community acquired pneumonia. 347-366 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#CooperAAABCFJLM05 2006-07-05 Human-centered design of a distributed knowledge management system. 4-17 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.014 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#RinkusWJMTSZ05 2006-07-05 Telephone-linked care for physical activity: A qualitative evaluation of the use patterns of an information technology program for patients. 220-228 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#FarzanfarFMF05 2006-07-05 A user-centered framework for redesigning health care interfaces. 75-87 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#JohnsonJZ05 2006-07-05 Deterministic projection by growing cell structure networks for visualization of high-dimensionality datasets. 322-330 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#WongC05 2006-07-05 Toward a framework for understanding lay public's comprehension of disaster and bioterrorism information. 331-344 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#KeselmanSP05 2006-07-05 Primary care physician time utilization before and after implementation of an electronic health record: A time-motion study. 176-188 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#PizziferriKVHGWWLLB05 2006-07-05 The anatomy of decision support during inpatient care provider order entry (CPOE): Empirical observations from a decade of CPOE experience at Vanderbilt. 469-485 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.08.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#MillerWCR05 2006-07-05 A framework for modeling health behavior protocols and their linkage to behavioral theory. 270-280 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#LenertNMP05 2006-07-05 Evaluating user interactions with clinical information systems: A model based on human-computer interaction models. 244-255 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Despont-GrosML05 2006-07-05 Domain-specific language models and lexicons for tagging. 422-430 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#CodenPADC05 2006-07-05 Hiding in plain sight: What Koppel et al. tell us about healthcare IT. 262-263 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.05.010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#NemethC05 2006-07-05 Nomographic representation of logistic regression models: A case study using patient self-assessment data. 389-394 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#DreiseitlHBK05 2006-07-05 Prediction of vascular tissue engineering results with artificial neural networks. 417-421 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#XuGZYCZ05 2006-07-05 The use of receiver operating characteristic curves in biomedical informatics. 404-415 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#LaskoBZO05 2006-07-05 Getting to the point: developing IT for the sharp end of healthcare. 18-25 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#NemethNOKC05 2006-07-05 A systems engineering perspective on the human-centered design of health information systems. 61-74 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.013 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#SamarasH05 2006-07-05 Using qualitative studies to improve the usability of an EMR. 51-60 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#RoseSPPLM05 2006-07-05 Human factors engineering: A tool for medical device evaluation in hospital procurement decision-making. 213-219 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Ginsburg05 2006-07-05 A Bayesian network coding scheme for annotating biomedical information presented to genetic counseling clients. 130-144 2005 38 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Green05 2006-07-05 Human-centered computing in health information systems: Part 2: Evaluation. 173-175 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Zhang05a 2006-07-05 CPOE and the facilitation of medication errors. 257-258 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Shortliffe05 2006-07-05 Clinical machine learning. 345-346 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.05.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Ohno-Machado05 2006-07-05 Algorithms for rapid outbreak detection: a research synthesis. 99-113 2005 38 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#BuckeridgeBCHM05 2006-07-05 Identifying barriers to the effective use of clinical reminders: Bootstrapping multiple methods. 189-199 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.015 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#PattersonDFMAA05 2006-07-05 Extracting information on pneumonia in infants using natural language processing of radiology reports. 314-321 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#MendoncaHSLF05 2006-07-05 To err is not entirely human: Complex technology and user cognition. 264-266 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#HorskyZP05 2006-07-06 A global goodness-of-fit test for receiver operating characteristic curve analysis via the bootstrap method. 395-403 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#ZouRTGBHKJO05 2006-07-05 Feature selection in Bayesian classifiers for the prognosis of survival of cirrhotic patients treated with TIPS. 376-388 2005 38 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2005.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#BlancoIMQL05 2006-07-05 New probabilistic graphical models for genetic regulatory networks studies. 443-455 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#WangCD05 2006-07-05 Artifacts and collaborative work in healthcare: methodological, theoretical, and technological implications of the tangible. 26-33 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Xiao05 2006-07-05 Technology, work, and information flows: Lessons from the implementation of a wireless alert pager system. 229-238 2005 38 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#ReddyMPS05 2006-07-05 Computerized physician order entry and medication errors: Finding a balance. 259-261 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2005.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Bates05 2006-07-05 GMDH-based feature ranking and selection for improved classification of medical data. 456-468 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Abdel-Aal05 2006-07-05 Group-Slicer: A collaborative extension of 3D-Slicer. 431-442 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Simmross-WattenbergCPCMARWA05 2006-07-05 Human-centered computing in health information systems Part 1: Analysis and design. 1-3 2005 38 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Zhang05 2006-07-05 Modeling a description logic vocabulary for cancer research. 114-129 2005 38 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#HartelCDFG05 2006-07-05 Modelling of classification rules on metabolic patterns including machine learning and expert knowledge. 89-98 2005 38 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.08.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#BaumgartnerBB05 2006-07-05 A framework for capturing the interactions between laypersons' understanding of disease, information gathering behaviors, and actions taken during an epidemic. 298-313 2005 38 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#SlaughterKKP05 2006-07-05 Gene name identification and normalization using a model organism database. 396-410 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#MorganHCYC04 2006-07-05 A framework for a distributed, hybrid, multiple-ontology clinical-guideline library, and automated guideline-support tools. 325-344 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ShaharYSGMMH04 2006-07-05 Classification and knowledge discovery in protein databases. 224-239 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#RadivojacCDO04 2006-07-05 Bioinformatics integration and agent technology. 205-219 2004 37 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#KarasavvasBB04 2006-07-05 Multivariate image analysis in biomedicine. 380-391 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.07.010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Nattkemper04 2006-07-06 Fever detection from free-text clinical records for biosurveillance. 120-127 2004 37 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ChapmanDW04 2006-07-05 Mapping high-dimensional data onto a relative distance plane - an exact method for visualizing and characterizing high-dimensional patterns. 366-379 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#SomorjaiDDMNBP04 2006-07-05 Model-free functional MRI analysis based on unsupervised clustering. 10-18 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2003.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#WismullerMLARS04 2006-07-05 Using name-internal and contextual features to classify biological terms. 498-511 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ToriiKV04 2006-07-05 A cognitive taxonomy of medical errors. 193-204 2004 37 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ZhangPJS04 2006-07-05 Using automatically learnt verb selectional preferences for classification of biomedical terms. 483-497 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#SpasicA04 2006-07-05 Biomedical named entity recognition using two-phase model based on SVMs. 436-447 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.012 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#LeeHKR04 2006-07-05 Comparison of character-level and part of speech features for name recognition in biomedical texts. 423-435 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#CollierT04 2006-07-05 Book Review. 54-55 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Pavlidis04 2006-07-06 Design and implementation of the GLIF3 guideline execution engine. 305-318 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#WangMTBOZGPS04 2006-07-05 Induction of comprehensible models for gene expression datasets by subgroup discovery methodology. 269-284 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#GambergerLZT04 2006-07-05 Diagnostic fidelity of the Z-buffer segmentation algorithm: preliminary assessment based on intracranial aneurysm detection. 19-29 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2003.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ChapmanPSTMHKM04 2006-07-05 Introduction: named entity recognition in biomedicine. 393-395 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.011 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#AnaniadouFT04 2006-07-05 Correspondence analysis of microarray time-course data in case-control design. 358-365 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#TanBKOHBHG04 2006-07-05 Cognitive schema and naturalistic decision making in evidence-based practices. 86-98 2004 37 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Falzer04 2006-07-05 Incorporating ideas from computer-supported cooperative work. 128-137 2004 37 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#PrattRMTG04 2006-07-05 An ontology of randomized controlled trials for evidence-based practice: content specification and evaluation using the competency decomposition method. 108-119 2004 37 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#SimOC04 2006-07-05 Discovering significant and interpretable patterns from multifactorial DNA microarray data with poor replication. 260-268 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.011 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#KimJLK04 2006-07-05 Cancer classification and prediction using logistic regression with Bayesian gene selection. 249-259 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ZhouLW04 2006-07-05 Cognitive and usability engineering methods for the evaluation of clinical information systems. 56-76 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2004.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#KushnirukP04 2006-07-06 <i>Computing with Words</i>approach. 99-107 2004 37 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Aja-FernandezLMA04 2006-07-05 Term identification in the biomedical literature. 512-526 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#KrauthammerN04 2006-07-05 A greedy algorithm for supervised discretization. 285-292 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ButterworthSSO04 2006-07-06 Enhancing HMM-based biomedical named entity recognition by studying special phenomena. 411-422 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#ZhangSZST04 2006-07-05 How (not) to protect genomic data privacy in a distributed network: using trail re-identification to evaluate and design anonymity protection systems. 179-192 2004 37 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#MalinS04 2006-07-05 Identifying projected clusters from gene expression profiles. 345-357 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#YipCNC04 2006-07-05 A simple and effective algorithm for detection of arbitrary Hartmann-Shack patterns. 1-9 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2003.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Carvalho04 2006-07-05 GeneWays: a system for extracting, analyzing, visualizing, and integrating molecular pathway data. 43-53 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2003.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#RzhetskyIKKKMYDWW04 2006-07-05 Comprehensive vertical sample-based KNN/LSVM classification for gene expression analysis. 240-248 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#PanWHP04 2006-07-05 The aging of a clinical information system. 319-324 2004 37 Journal of Biomedical Informatics 5 http://dx.doi.org/10.1016/j.jbi.2004.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#RadaF04 2006-07-05 Methods for automated concept mapping between medical databases. 162-178 2004 37 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Sun04 2006-07-05 Enhancing performance of protein and gene name recognizers with filtering and integration strategies. 448-460 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#HouC04 2006-07-06 Improving the performance of dictionary-based approaches in protein name recognition. 461-470 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#TsuruokaT04 2006-07-05 Research on machine learning issues in biomedical informatics modeling. 221-223 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Ohno-Machado04 2006-07-05 Towards the development of a conceptual distance metric for the UMLS. 77-85 2004 37 Journal of Biomedical Informatics 2 http://dx.doi.org/10.1016/j.jbi.2004.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#CaviedesC04 2006-07-05 Use of morphological analysis in protein name recognition. 471-482 2004 37 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2004.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#YamamotoKKM04 2006-07-05 Using genomics to help predict drug interactions. 139-146 2004 37 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Gardner04 2006-07-19 GLIF3: a representation format for sharable computer-interpretable clinical practice guidelines. 147-161 2004 37 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2004.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#BoxwalaPTOZWPGS04 2006-07-06 Synergy between medical informatics and bioinformatics: facilitating genomic medicine for future health care. 30-42 2004 37 Journal of Biomedical Informatics 1 http://dx.doi.org/10.1016/j.jbi.2003.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#Martin-SanchezINMGLJAAB04 2006-07-05 A primer on gene expression and microarrays for machine learning researchers. 293-303 2004 37 Journal of Biomedical Informatics 4 http://dx.doi.org/10.1016/j.jbi.2004.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi37.html#KuoKTJVO04 2006-07-05 Using usability heuristics to evaluate patient safety of medical devices. 23-30 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00060-1 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#ZhangJPPK03 2006-07-05 The Nursing Terminology Summit Conferences: a case study of successful collaboration for change. 362-374 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.023 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#Ozbolt03 2006-07-05 Building nursing knowledge through informatics: from concept representation to data mining. 229-231 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#BakkenH03 2006-07-05 A shallow parser based on closed-class words to capture relations in biomedical text. 145-158 2003 36 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(03)00039-X http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#LeroyCM03 2006-07-05 A framework for analyzing the cognitive complexity of computer-assisted clinical ordering. 4-22 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00062-5 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#HorskyKOP03 2006-07-05 Evaluation of the draft international standard for a reference terminology model for nursing actions. 271-278 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#MossCM03 2006-07-05 Towards linking patients and clinical information: detecting UMLS concepts in e-mail. 334-341 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.017 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#BrennanA03 2006-07-05 Role and experience determine decision support interface requirements in a neonatal intensive care environment. 240-249 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#EwingFLHMRF03 2006-07-05 Development and evaluation of a terminology-based electronic nursing record system. 304-312 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#ChoP03 2006-07-05 Representative threats for research in public health surveillance. 177-188 2003 36 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(03)00065-0 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#WagnerDDA03 2006-07-05 Usability in the real world: assessing medical information technologies in patients' homes. 45-60 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00056-X http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#KaufmanPHMPWGSS03 2006-07-05 Determining sources for formal nursing terminology systems. 279-286 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#Hardiker03 2006-07-05 Using nurses' natural language entries to build a concept-oriented terminology for patients' chief complaints in the emergency department. 260-270 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#TraversH03 2006-07-05 Designing metaschemas for the UMLS enriched semantic network. 433-449 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#ZhangPHG03 2006-07-05 Toward national comparable nurse practitioner data: proposed data elements, rationale, and methods. 342-350 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.016 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#Jenkins03 2006-07-05 Mining complex clinical data for patient safety research: a framework for event discovery. 120-130 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/j.jbi.2003.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#HripcsakBSP03 2006-07-05 Retrospective data collection and analytical techniques for patient safety studies. 106-119 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/j.jbi.2003.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#WeingerSJO03 2006-07-05 Research on structural issues of the UMLS - past, present, and future. 409-413 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#PerlG03 2006-07-05 Experimental analysis of heart rate variability of long-recording electrocardiograms in normal subjects and patients with coronary artery disease and normal left ventricular function. 202-217 2003 36 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2003.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#NikolopoulosANM03 2006-07-05 A declarative implementation of the DICOM-3 network protocol. 159-176 2003 36 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/S1532-0464(03)00040-6 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#KaletGJA03 2006-07-05 Marginalization and health geomatics. 400-407 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.021 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#AlexanderKMP03 2006-07-05 The interaction of domain knowledge and linguistic structure in natural language processing: interpreting hypernymic propositions in biomedical text. 462-477 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#RindfleschF03 2006-07-05 Medical errors as a result of specialization. 61-69 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00057-1 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#HashemCF03 2006-07-05 Using computational modeling to transform nursing data into actionable information. 351-361 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.018 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#EffkenBPLVC03 2006-07-05 A reference ontology for biomedical informatics: the Foundational Model of Anatomy. 478-500 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#RosseM03 2006-07-05 OQAFMA Querying Agent for the Foundational Model of Anatomy: a prototype for providing flexible and efficient access to large semantic networks. 501-517 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#MorkBR03 2006-07-05 Consistency across the hierarchies of the UMLS Semantic Network and Metathesaurus. 450-461 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#CiminoMP03 2006-07-05 Adequacy of evolving national standardized terminologies for interdisciplinary coded concepts in an automated clinical pathway. 313-325 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#DykesCC03 2006-07-05 Methods in informatics: using data derived from a systematic review of health care texts to develop a concept map for use in the neonatal intensive care setting. 232-239 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#PanniersFS03 2006-07-05 A tiered approach is more cost effective than traditional pharmacist-based review for classifying computer-detected signals as adverse drug events. 92-98 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00059-5 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#HopeOSTMFGBM03 2006-07-05 Effective drug-allergy checking: methodological and operational issues. 70-79 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00063-7 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#KupermanGB03 2006-07-05 Exploring semantic groups through visual approaches. 414-432 2003 36 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2003.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#BodenreiderM03 2006-07-05 Bayesian networks for knowledge discovery in large datasets: basics for nurse researchers. 389-399 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.022 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#LeeA03 2006-07-05 Representing nursing assessments in clinical information systems using the logical observation identifiers, names, and codes database. 287-293 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#MatneyBH03 2006-07-05 Data mining issues and opportunities for building nursing knowledge. 379-388 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.020 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#GoodwinVLT03 2006-07-05 Controlled vocabularies for consumer health. 326-333 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#Zielstorff03 2006-07-05 Modeling nursing interventions in the act class of HL7 RIM Version 3. 294-303 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#DankoKHABCGHMR03 2006-07-05 Assessing explicit error reporting in the narrative electronic medical record using keyword searching. 99-105 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00058-3 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#CaoSH03 2006-07-05 A nursing perspective to design and implementation of electronic patient record systems. 375-378 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.019 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#Moen03 2006-07-05 A vocabulary development and visualization tool based on natural language processing and the mining of textual patient reports. 189-201 2003 36 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2003.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#FriedmanLS03 2006-07-05 A term extraction tool for expanding content in the domain of functioning, disability, and health: proof of concept. 250-259 2003 36 Journal of Biomedical Informatics 4-5 http://dx.doi.org/10.1016/j.jbi.2003.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#HarrisSJC03 2006-07-05 Cognition and measurement in patient safety research. 1-3 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/j.jbi.2003.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#PatelB03 2006-07-05 Institutional decision-making to select patient care devices: identifying venues to promote patient safety. 31-44 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00055-8 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#KeselmanPJZ03 2006-07-05 Design and implementation of a comprehensive outpatient Results Manager. 80-91 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/S1532-0464(03)00061-3 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#PoonWGBK03 2006-07-05 Detecting adverse events for patient safety research: a review of current methodologies. 131-143 2003 36 Journal of Biomedical Informatics 1-2 http://dx.doi.org/10.1016/j.jbi.2003.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#MurffPHB03 2006-07-05 Grounding a new information technology implementation framework in behavioral science: a systematic analysis of the literature on IT use. 218-227 2003 36 Journal of Biomedical Informatics 3 http://dx.doi.org/10.1016/j.jbi.2003.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi36.html#KukafkaJLA03 2006-07-05 Response to commentaries on Koppel et al. 2005 38 Journal of Biomedical Informatics 6 http://dx.doi.org/10.1016/j.jbi.2005.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jbi/jbi38.html#Wears05 2003-09-17 Asymptotics of the Best Constant in a Certain Markov-Type Inequality. 84-97 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3638 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#Dorfler02 2003-09-17 On best uniform restricted range approximation in complex-valued continuous function spaces. 71-84 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00012-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Li03 2003-09-17 <sub>1</sub>(R). 81-93 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3711 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Wu02 2003-10-08 Representation of Reproducing Kernels and the Lebesgue Constants on the Ball. 295-310 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3597 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Xu01 2003-09-17 The Complex Spline Approximation of Singular Integral Operators over an Open Arc. 86-109 2002 119 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3721 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#Xu02 2003-10-08 Approximation of Mappings with Values Which Are Upper Semicontinuous Functions. 245-265 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3616 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#TeranL01 2003-09-17 Examples of Landau-Kolmogorov Inequality in Integral Norms on a Finite Interval. 55-73 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3687 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#BojanovN02 2003-09-17 On polynomial interpolation of two variables. 267-282 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00023-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#BojanovX03 2003-10-08 On Certain Best Constants for Bernstein-Type Operators. 189-206 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3612 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#CalC01 2003-10-08 Entropy Numbers of Embeddings of Besov Spaces in Generalized Lipschitz Spaces. 73-92 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3594 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#CobosK01 2003-09-17 A divided difference expansion of a divided difference. 10-12 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00026-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Boor03 2003-09-17 On the Asymptotics of Fekete-Type Points for Univariate Radial Basis Interpolation. 252-270 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3731 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#BosM02 2003-09-17 On Existence Theorems for Finite-Codimensional Subspaces in C(Q). 185-188 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3692 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Vlasov02 2003-09-17 Shift-invariant spaces of tempered distributions and Lp-functions. 220-228 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00061-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Chen03 2003-09-17 Approximation in Sobolev Spaces by Kernel Expansions. 70-83 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3637 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#NarcowichSW02 2003-09-17 Stechkin-Marchaud-Type Inequalities for Baskakov Polynomials. 33-47 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3629 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#GuoTZ02 2003-09-17 Cesàro Asymptotics for Orthogonal Polynomials on the Unit Circle and Classes of Measures. 187-237 2002 115 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3655 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#GolinskiiK02 2003-11-21 Universality and chaos for tensor products of operators. 7-24 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00118-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Martinez-GimenezP03 2003-09-17 Approximation orders of formal Laurent series by Oppenheim rational functions. 269-286 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00064-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#FanW03 2003-09-17 Rates of approximation and ergodic limits of regularized operator families. 42-61 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00040-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#LizamaP03 2005-03-01 <sup>p</sup>(D), p>0, and an Inequality of Hardy and Littlewood. 238-259 2002 115 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3656 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#KryakinT02 2003-09-17 Convergence Conditions for Vector Stieltjes Continued Fractions. 100-119 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3653 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#Smirnova02 2003-10-08 Scattered Date Interpolation from Principal Shift-Invariant Spaces. 172-188 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3611 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Johnson01 2003-09-17 On minimizing sequences for k-centres. 20-35 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00010-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Lember03 2003-11-21 Multi-node higher order expansions of a function. 242-253 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Han03a 2003-09-17 On the Riesz energy of measures. 62-78 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00031-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Gotz03 2003-09-17 Bilinear semiclassical moment functionals and their integral representation. 71-99 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00044-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Bertola03 2003-09-17 Some equivalence theorems with K-functionals. 143-157 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00059-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Dai03 2003-11-21 Strong converse inequalities for Baskakov operators. 219-231 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00119-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#GuoQ03 2003-11-21 On the Divergence of the Two-Dimensional Dyadic Difference of Dyadic Integrals. 1-27 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3665 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Gat02 2003-11-21 Cesàro means of integrable functions with respect to unbounded Vilenkin systems. 25-43 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00075-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Gat03 2003-10-08 Approximation Properties and Construction of Hermite Interpolants and Biorthogonal Multiwavelets. 18-53 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3545 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#Han01 2003-11-21 Vector cascade algorithms and refinable function vectors in Sobolev spaces. 44-88 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00120-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Han03 2003-09-17 Construction of trivariate compactly supported biorthogonal box spline wavelets. 1-19 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00009-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#HeL03 2003-09-17 Perfect spline approximation. 229-243 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00062-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#HuY03 2003-11-21 Convergence and asymptotic behavior of Jackson integrals associated with irreducible reduced root systems. 154-180 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.08.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Ito03 2003-09-17 Approximation by weighted polynomials. 153-182 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00017-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Benko03 2003-10-08 Maximal Inequalities and Lebesgue's Differentiation Theorem for Best Approximant by Constant over Balls. 171-179 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3559 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#MazzoneC01 2003-09-17 <sub>1</sub>. 279-300 2002 117 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3702 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#MazzoneC02 2003-10-08 A Trigonometric Quadrature Rule for Cauchy Integrals with Jacobi Weight. 18-35 2001 108 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3513 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Kim01 2003-09-17 Derivatives of Generalized Distance Functions and Existence of Generalized Nearest Points. 44-55 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3651 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#LiN02 2003-09-17 Summability of orthogonal expansions of several variables. 267-333 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00069-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#LiX03 2003-10-08 Approximation by Dirichlet Series with Nonnegative Coefficients. 226-234 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3589 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Liu01 2003-09-17 Chebyshev's maximum principle in several variables. 276-279 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00115-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#WangH03 2003-09-17 Prediction Operators in Banach Ideal Spaces. 147-151 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3630 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#WangL02 2003-09-17 q-Bernstein polynomials and their iterates. 232-255 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00104-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Ostrovska03 2003-09-17 On a Discrete Kolmogorov Criterion. 141-146 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3532 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#Finzel02 2003-09-17 Interpolation of Cones and Shape-Preserving Approximation. 23-41 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3686 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Kozlov02 2003-10-08 <sub>m</sub>Extremal Polynomials, II. 59-80 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3561 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Shi01 2003-09-17 New Characterizations of Ratio Asymptotics for Orthogonal Polynomials. 1-8 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3649 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#Shi02 2003-09-17 On ratio asymptotics for general polynomials. 355-370 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00047-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Shi03 2003-09-17 A Chebyshev Set and its Distance Function. 181-192 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3728 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#Wu02a 2003-10-08 A Note on a Continuous Approximate Selection Theorem. 324-325 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3622 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Xu01a 2003-09-17 The Diagonalisation of the Multivariate Bernstein Operator. 103-131 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3683 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#CooperW02 2003-09-17 Markov inequality for polynomials of degree n with m distinct zeros. 241-248 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00074-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#BenkoE03 2003-10-08 Sets with Interior Extremal Points for the Markoff Inequality. 261-265 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3549 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#BenkoT01 2005-02-21 <sub>p</sub>-Generalization of a Theorem of Adamyan, Arov, and Krein. 380-396 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3677 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Prokhorov02 2003-09-17 Uniform Approximation by Nevai Operators. 28-48 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3666 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Vecchia02 2003-09-17 On Some Extremal Properties of Lagrange Interpolatory Polynomials. 188-201 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3716 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Sidorov02 2003-11-21 Approximation of the rth differential operator by means of linear shape preserving operators of finite rank. 232-241 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.09.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Sidorov03 2003-10-08 A Chebyshev Quadrature Rule for One Sided Finite Part Integrals. 196-219 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3572 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Kim01a 2003-09-17 <sub>infin</sub>convergence of interpolation and associated product integration for exponential weights. 217-241 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00020-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Jung03 2003-10-08 Orthogonal Polynomial Solutions of Spectral Type Differential Equations: Magnus' Conjecture. 189-215 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3586 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#KwonLY01 2003-09-17 Improved estimates for the approximation numbers of Hardy-type operators. 61-70 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00043-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Lang03 2003-10-08 Universal Polynomial Majorants on Convex Bodies. 220-232 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3573 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Kroo01 2003-09-17 Markov-type Inequalities for Surface Gradients of Multivariate Polynomials. 235-245 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3719 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Kroo02 2003-10-08 An Asymptotic Expansion of the Double Gamma Function. 298-314 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3578 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#FerreiraL01 2003-10-08 A Lower Estimate for Entropy Numbers. 120-124 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3554 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#Kuhn01 2005-03-01 <sub>p>2</sub><sup>p</sup>. 249-255 2001 108 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3501 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Khrushchev01a 2003-10-08 Asymptotic Error Estimates for L2 Best Rational Approximants to Markov Functions. 53-96 2001 108 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3515 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#BaratchartSW01 2003-10-08 Best Approximation and Moduli of Smoothness for Doubling Weights. 180-199 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3546 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#MastroianniT01 2003-10-08 Strong and Plancherel-Rotach Asymptotics of Non-diagonal Laguerre-Sobolev Orthogonal Polynomials. 54-73 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3530 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#MarcellanM01 2003-09-17 On the Convergence and Iterates of q-Bernstein Polynomials. 301-313 2002 117 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3703 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#OrucT02 2003-10-08 Bernstein Type Inequalities for Quasipolynomials. 28-43 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3576 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Brudnyi01 2003-09-17 The Bernstein Constant and Polynomial Interpolation at the Chebyshev Nodes. 193-213 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3729 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#Ganzburg02 2003-09-17 Strong asymptotics in Lagrange interpolation with equidistant nodes. 224-240 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00070-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Ganzburg03 2003-09-17 A best constant for bivariate Bernstein and Szász-Mirakyan operators. 117-124 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00086-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#CalCV03 2003-09-17 Stable Summation of Orthogonal Series with Noisy Coefficients. 66-80 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3710 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#MatheP02 2003-09-17 Blumenthal's Theorem for Laurent Orthogonal Polynomials. 255-278 2002 117 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3700 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#RangaA02 2003-10-08 <sup>2</sup>(T). 161-248 2001 108 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3500 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Khrushchev01 2003-09-17 Classification Theorems for General Orthogonal Polynomials on the Unit Circle. 268-342 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3674 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Khrushchev02 2003-09-17 Turán measures. 112-120 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00042-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Khrushchev03 2003-09-17 Duality for Bregman projections onto translated cones and affine subspaces. 1-12 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00040-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Bauschke03 2003-10-08 Green Equilibrium Measures and Representations of an External Field. 298-323 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3618 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#LevinL01 2003-10-08 The Distribution of Zeros and Poles of Asymptotically Extremal Rational Functions for Zolotarev's Problem. 88-108 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3551 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#LevinS01 2003-09-17 A multiplier theorem using the Schechter's method of interpolation. 283-295 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00036-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Carro03 2004-01-09 Properties of Multivariate Homogeneous Orthogonal Polynomials. 1-20 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3565 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#BenouahmaneC01 2003-09-17 Approximation by neural networks with a bounded number of nodes at each level. 260-266 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00078-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Gripenberg03 2003-10-08 Book Review: "Special Functions, A Unified Theory Based on Singularities" by Sergei Yu. Slavyanov and Wolfgang Lay. 322-323 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3605 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Debosscher01 2003-10-08 Estimates for the Discrepancy of a Signed Measure Using Its Energy Norm. 1-29 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3481 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#Huesing01 2003-09-17 Design Approximation Problems for Linear-Phase Nonrecursive Digital Filters. 240-256 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3672 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Reemtsen02 2003-11-21 Erratum to "A divided difference expansion of a divided difference" [J. Approx. Theory 122 (2003) 10-12]. 137 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00141-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Boor03a 2003-10-08 Nonnegative Quadratic Forms and Bounds on Orthogonal Polynomials. 31-49 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3570 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Krasikov01 2003-09-17 Bounds for zeros of the Laguerre polynomials. 287-291 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00029-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Krasikov03 2003-11-21 The B-spline recurrence relations of Chakalov and of Popoviciu. 115-123 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00117-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#BoorP03 2003-10-08 Erdos-Turán Type Inequality for the Sum of Successive Fundamental Polynomials of Hermite Interpolation. 81-90 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3562 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Shi01a 2003-10-08 On Normal Pointsystems of Hermite-Fejér Interpolation of Arbitrary Order. 44-60 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3590 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Shi01b 2003-09-17 <sub>m</sub>Extremal Polynomials. 167-185 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3646 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#Shi02a 2003-09-17 Convergence of Hermite-Fejér type interpolation of higher order on an arbitrary system of nodes. 173-187 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00084-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Shi03a 2003-09-17 On Polynomial Approximation of Square Integrable Functions on a Subarc of the Unit Circle. 152-163 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3631 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#Shen02 2003-09-17 Applications of Inverse Limits to Extensions of Operators and Approximation of Lipschitz Functions. 257-267 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3673 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#TaborY02 2003-09-17 On a Bivariate Interpolation Problem. 76-99 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3667 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#HakopianI02 2003-09-17 <sub>p</sub>Markov-Bernstein Inequalities on All Arcs of the Circle. 343-368 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3675 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#KobindarajahL02 2003-09-17 On the Rate of Convergence and the Voronovskaya Theorem for the Poisson Integrals for Hermite and Laguerre Expansions. 113-125 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3663 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#ToczekW02 2003-10-08 Upper Estimates in Direct Inequalities for Bernstein-Type Operators. 229-241 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3547 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#AdellS01 2003-10-08 Asymptotic Properties of Heine-Stieltjes and Van Vleck Polynomials. 131-151 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3705 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Martinez-FinkelshteinS02 2003-10-08 <sub>0</sub>(X). 279-294 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3596 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Briem01 2003-09-17 Entropy numbers of Sobolev embeddings of radial Besov spaces. 244-268 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00063-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#KuhnLSS03 2003-09-17 Characterization of a Hilbert vector lattice by the metric projection onto its positive cone. 295-299 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00087-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Nemeth03 2003-09-17 Boundedness by 3 of the Whitney Interpolation Constant. 271-290 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3732 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#GilewiczKS02 2003-09-17 Asymptotic Analysis for the Dunkl Kernel. 110-126 2002 119 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3722 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#RoslerJ02 2003-09-17 Convergence of Cascade Algorithms in Sobolev Spaces for Perturbed Refinement Masks. 133-155 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3682 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#ChenP02 2003-11-21 The K-divisibility constant for couples of Banach lattices. 124-136 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00135-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Cwikel03 2003-11-21 On the values of continued fractions: q-series. 139-153 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Matala-aho03 2003-10-08 Uniform Asymptotic Expansions for Charlier Polynomials. 93-133 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3595 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Dunster01 2003-10-08 Subdivision Schemes and Refinement Equations with Nonnegative Masks. 207-220 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3623 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Wang01 2006-04-27 <sup>infin</sup><sup>p</sup>. 246-256 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3720 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#BrujS02 2003-09-17 <sub>p</sub>- Approximation. 56-71 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3634 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#KovachevaL02 2003-09-17 A product formula for orthogonal polynomials associated with infinite distance-transitive graphs. 337-354 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00039-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Voit03 2003-10-10 On Quasi-Interpolation with Non-uniformly Distributed Centers on Domains and Manifolds. 125-145 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3556 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#MazyaS01 2003-10-08 Discrete Approximation of Unbounded Operators and Approximation of their Spectra. 229-244 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3588 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Wolff01 2003-09-17 Necessary and sufficient condition that the limit of Stieltjes transforms is a Stieltjes transform. 54-60 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00042-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#GeronimoH03 2003-10-08 On the Construction and Frequency Localization of Finite Orthogonal Quadrature Filters. 36-52 2001 108 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3514 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Nielsen01 2003-09-17 Error Bounds for Solving Pseudodifferential Equations on Spheres by Collocation with Zonal Kernels. 242-268 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3642 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#MortonN02 2003-09-17 Spectral properties of Jacobi matrices by asymptotic analysis. 309-336 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00038-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#JanasM03 2003-10-08 Interpolation by Radial Basis Functions on Sobolev Space. 1-15 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3584 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Yoon01 2003-09-17 <sup>2</sup>. 229-254 2002 117 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3694 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Kessler02 2003-09-17 Convergence of Gaussian quadrature formulas on infinite intervals. 280-294 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00090-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Zhou03 2003-09-17 An Expansion Formula for the Askey-Wilson Function. 308-342 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3647 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#Stokman02 2003-10-08 Hardy Spaces Generated by an Integrability Condition. 91-109 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3614 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Fridli01 2003-10-08 <sup>p</sup>Spaces. 50-58 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3560 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#XiaoZ01 2003-10-08 The Multiplication Operator in Sobolev Spaces with Respect to Measures. 157-197 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3543 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#Rodriguez01a 2003-10-08 Orthogonal Polynomials of Several Variables. 318-319 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3602 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#StokmanDX01 2003-10-08 Zeros of polynomials orthogonal over regular N-gons. 129-140 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00039-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#MeskulS03 2003-09-17 <sup>1</sup>-Approximation by Blending Functions of Order (2, 2). 72-99 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3652 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#DryanovP02 2003-10-08 Modes of Convergence: Interpolation Methods I. 91-127 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3564 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#MartinM01a 2003-09-17 Generalized projection and approximation of fixed points of nonself maps. 242-252 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00021-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#ChidumeKZ03 2003-09-17 <sub>infin</sub><sup>(4)</sup>. 175-187 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3714 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Martinov02 2003-10-08 Interpolating Cubic Splines. 319-321 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3603 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#OpferK01 2003-09-17 Bounds for symmetric elliptic integrals. 249-259 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00077-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Neuman03 2003-09-17 Lieb-Thirring Inequalities for Jacobi Matrices. 106-130 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3704 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#HundertmarkS02 2003-09-17 On the divergence of polynomial interpolation. 85-110 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00013-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#JorbaT03 2003-10-08 <sub>p</sub>Markov-Bernstein Inequalities on Arcs of the Circle. 1-17 2001 108 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3502 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Lubinsky01 2003-09-17 On Weighted Mean Convergence of Lagrange Interpolation for General Arrays. 153-162 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3698 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Lubinsky02 2003-09-17 Strong Approximation of Eigenvalues of Large Dimensional Wishart Matrices by Roots of Generalized Laguerre Polynomials. 290-304 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3725 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Dette02 2003-09-17 Ratio asymptotics for orthogonal rational functions on an interval. 162-172 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00116-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#DeunB03 2003-09-17 The Szego condition for Coulomb Jacobi matrices. 119-142 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00046-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Zlatos03 2003-10-08 Markov-Type Inequalities for Products of Müntz Polynomials. 171-188 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3583 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Erdelyi01 2003-10-08 Book Review: "Handbook of Splines" by Gheorghe Micula and Sanda Micula. 321-322 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3604 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Nurnberger01 2003-09-17 Direct and Inverse Approximation Theorems for Local Trigonometric Bases. 74-102 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3688 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#BittnerG02 2003-11-21 Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. 194-218 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#BregmanCRZ03 2003-10-08 Weak Asymptotics for the Generating Polynomials of the Stirling Numbers of the Second Kind. 218-228 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3534 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#Elbert01a 2005-01-20 On the solvability of the Birkhoff interpolation problem. 109-114 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00132-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#RubioDR03 2003-09-17 Zeros of orthogonal polynomials on the real line. 357-364 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00038-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#DenisovS03 2003-09-17 Sharp Integral Inequalities of the Hermite-Hadamard Type. 260-288 2002 115 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3658 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#GuessabS02 2003-10-08 Curvelets and Curvilinear Integrals. 59-90 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3624 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#CandesD01 2003-09-17 Convergence of Generalized Bernstein Polynomials. 100-112 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3657 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#IlinskiiO02 2003-09-17 Approximation of Convex Functions on the Dual of Banach Spaces. 126-140 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3664 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#ChengRT02 2003-09-17 In Memoriam William Allan Light (1950-2002). 1-12 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00080-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#CheneyL03 2004-07-14 Best approximation by linear combinations of characteristic functions of half-spaces. 151-159 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00072-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#KainenKV03 2003-09-17 On the absolute (C, alpha) convergence for functions of bounded variation. 300-304 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00102-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#KunyangD03 2003-10-08 Stable Local Bases for Multivariate Spline Spaces. 267-297 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3577 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Davydov01 2003-09-17 The uniform convergence of subsequences of the last intermediate row of the Padé table. 160-207 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00079-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Adukov03 2003-10-08 On Multivariate Quasipolynomials of the Minimal Deviation from Zero. 159-170 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3582 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Luquin01 2003-09-17 Harmonic approximation and Sarason's-type theorem. 183-190 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00018-7 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#HansenN03 2003-09-17 <sub>n</sub><sup>4</sup><sub>n+1</sub><sub>n</sub><sup>2</sup>are Erdos Measures. 42-54 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3680 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Denisov02 2004-01-16 On a Conjecture of Ditzian and Runovskii. 202-224 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3717 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#FengKC02 2003-09-17 Sharp Estimates for Jacobi Matrices and Chain Sequences. 94-105 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3699 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Szwarc02 2003-09-17 Approximating weak Chebyshev subspaces by Chebyshev subspaces. 188-213 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00082-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#DeutschSZ03 2003-09-17 Inverse Operators, q-Fractional Integrals, and q-Bernoulli Polynomials. 269-307 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3644 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#IsmailR02 2003-09-17 q-Taylor theorems, polynomial expansions, and interpolation of entire functions. 125-146 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00076-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#IsmailS03 2003-10-08 Discriminants and Functional Equations for Polynomials Orthogonal on the Unit Circle. 200-228 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3540 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#IsmailW01 2003-11-21 In Memoriam Lev Brutman (1939-2001). 1-6 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00105-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Vertesi03 2003-09-17 Mathematics and Politics in the Soviet Union from 1928 to 1953. 169-223 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3670 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Lorentz02 2003-09-17 On approximation of functions from Sobolev spaces on metric graphs. 199-219 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00033-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Solomyak03 2005-02-21 On Convergence of Interpolation to Analytic Functions. 48-56 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3633 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#JinyuanH02 2003-09-17 On the Behaviour of Zeros of Jacobi Polynomials. 224-239 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3671 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#DimitrovR02 2003-10-08 Error Bounds for Approximation with Neural Networks. 235-250 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3613 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#BurgerN01 2003-10-08 Orthogonal Expansion of Real Polynomials, Location of Zeros, and an L2 Inequality. 126-147 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3536 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#Schmeisser01 2003-09-17 On best approximation of classes by radial functions. 36-70 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00011-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Maiorov03 2003-09-17 Extension Theorems for Spaces Arising from Approximation by Translates of a Basic Function. 164-200 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3635 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#LightV02 2003-09-17 Density of Extremal Sets in Multivariate Chebyshev Approximation. 127-131 2002 119 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3701 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#Kroo02a 2003-09-17 Universal Overconvergence of Polynomial Expansions of Harmonic Functions. 225-234 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3718 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Armitage02 2003-09-17 Harmonic monsters. 110-116 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00085-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Armitage03 2003-10-08 On the Rates of Approximation of Bernstein Type Operators. 242-256 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3538 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#ZengC01 2003-10-08 Strong Asymptotic Behavior and Weak Convergence of Polynomials Orthogonal on an Arc of the Unit Circle. 233-255 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3574 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#HernandezD01 2003-09-17 Convergence Rates of Regularized Approximation Processes. 21-43 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3650 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#ShawL02 2003-09-17 Derivatives of Faber Polynomials and Markov Inequalities. 163-174 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3713 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Pritsker02 2003-09-17 On the Approximation Properties of Cesàro Means of Negative Order of Walsh-Fourier Series. 9-20 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3632 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#Goginava02 2003-11-21 Uniform convergence of Cesàro means of negative order of double Walsh-Fourier series. 96-108 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00134-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Goginava03 2003-09-17 Matrix-valued continued fractions. 136-152 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00016-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#ZhaoZ03 2003-09-17 Sur les fonctions q-Bessel de Jackson. 208-223 2003 122 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00073-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Zhang03 2005-04-08 Asymptotic Behaviour of Best lp-Approximations from Affine Subspaces. 275-289 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3724 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#QuesadaMN02 2003-10-08 Book Review: "Wavelets Made Easy" by Yves Nievergelt. 323-324 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3606 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Assche01 2003-10-08 Some Remarks on Equivalence of Modui of Smoothness. 165-171 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3585 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#ZhouZ01 2003-09-17 A generalised beta integral and the limit of the Bernstein-Durrmeyer operator with Jacobi weights. 141-150 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00041-8 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Waldron03 2003-09-17 Best Approximation by the Inverse of a Monotone Polynomial and the Location Problem. 98-114 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3639 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#Wulbert02 2003-10-08 On Exact Values of n-Widths in a Hilbert Space. 97-117 2001 108 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3497 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Magaril-IlyaevOT01 2003-09-17 Approximation with brushlet systems. 25-51 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00083-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#BorupN03 2003-11-21 Normal indices in Nikishin systems. 254-262 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.09.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#BranquinhoBML03 2003-10-08 A Unified Calculus Using the Generalized Bernoulli Polynomials. 279-313 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3550 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#Frappier01 2003-10-08 Blossoming beyond Extended Chebyshev Spaces. 48-81 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3529 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#GoodmanM01 2003-09-17 <sub>p</sub>-Norms and Information Entropies of Charlier Polynomials. 152-178 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3691 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Larsson-Cohn02 2003-10-08 An Extension of E. Bishop's Localization Theorem. 148-156 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3539 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#DanielyanS01 2003-09-17 p-Adic interpolation and approximation of a continuous function by linear combinations of shifts of p-adic valuations. 124-135 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00015-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#KhrennikovR03 2003-09-17 Antiproximinal Norms in Banach Spaces. 57-69 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3636 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#BorweinJM02 2003-10-08 Inequalities for Cyclic Functions. 216-225 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3610 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#AlzerRS01 2003-10-08 Asymptotic Zero Distribution of Orthogonal Polynomials with Discontinuously Varying Recurrence Coefficients. 142-155 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3617 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#KuijlaarsC01 2003-10-08 A Sharp Inequality of Markov Type for Polynomials Associated with Laguerre Weight. 221-228 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3615 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#CarleyLM01 2003-10-08 The Approximation Functional and Interpolation with Perturbed Continuity. 236-260 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3553 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#SagherS01 2003-09-17 Rearrangement-Function Inequalities and Interpolation Theory. 214-251 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3730 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#SagherS02 2003-10-08 Deformation of Minimal Polynomials and Approximation of Several Intervals by an Inverse Polynomial Mapping. 180-195 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3571 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Peherstorfer01 2003-10-08 Kolmogorov and Linear Widths of Weighted Sobolev-Type Classes on a Finite Interval, II. 266-297 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3626 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#KonovalovL01 2003-09-17 <sub>alpha</sub>Bessel Function. 144-166 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3645 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#FitouhiHB02 2003-09-17 Zeros of Sobolev Orthogonal Polynomials of Gegenbauer Type. 115-140 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3643 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#Groenevelt02 2003-10-08 Metric Entropy of Subsets of Absolutely Convergent Fourier Series. 229-235 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3567 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#Belinsky01 2003-09-17 Entropy Numbers of Vector-Valued Diagonal Operators. 132-139 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3690 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Belinsky02 2003-10-08 Book Review: "A Course in Approximation Theory" by Ward Cheney and Will Light. 318 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3601 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Kuijlaars01 2003-10-08 Asymptotic Properties of Zeros of Hypergeometric Polynomials. 329-343 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3580 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#DurenG01 2003-09-17 <sup>2</sup>. 49-75 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3662 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#BownikS02 2003-09-17 Dykstra's Algorithm and a Representation of the Moore-Penrose Inverse. 179-184 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3685 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Groetsch02 2003-10-08 An Extremal Relation of the Theory of Approximation of Functions by Algebraic Polynomials. 146-170 2001 110 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3558 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#Rafalson01 2003-09-17 Minimal projections in spaces of functions of N variables. 214-231 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00089-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Skrzypek03 2003-09-17 Finite sections method for Hessenberg matrices. 68-88 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00067-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#RobertS03 2003-09-17 A Vector Generalisation of de Montessus' Theorem for the Case of Polar Singularities on the Boundary. 141-168 2002 116 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3668 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Roberts02 2003-09-17 Laguerre-Sobolev orthogonal polynomials: asymptotics for coherent pairs of type II. 79-96 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00034-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#AlfaroMR03 2003-11-21 Convergence of the weak dual greedy algorithm in Lp-spaces. 89-95 2003 124 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00133-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#GanichevK03 2003-10-08 Orthogonal Representation of Weber's Function Using Hermite Polynomials. 156-163 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3620 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Daniel01 2003-09-17 On Carleman and Knopp's Inequalities. 140-151 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3684 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#KaijserPO02 2003-09-17 Lebesgue constant for the Strömberg wavelet. 13-23 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00030-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Bechler03 2003-09-17 The retraction constant in some Banach spaces. 296-308 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00037-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#BarontiCF03 2003-10-08 Characterization of the Zygmund Space by Shifted B-Splines. 256-266 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3575 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Wingren01 2003-11-21 Sequence spaces of spline functions on subsets and l[infin]-spaces. 181-193 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#Wingren03 2003-09-17 Restricted T-Universal Functions. 201-213 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3640 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#LuhMM02 2003-09-17 A Note on a Remez-Type Inequality for Trigonometric Polynomials. 416-424 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3678 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#Andrievskii02 2003-09-17 The maximal range problem for a quasidisk. 52-67 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00071-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Andrievskii03 2003-09-17 Boundedness properties for Sobolev inner products. 97-111 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00037-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#SmirnovaG03 2003-10-08 On the Semi-norm of Radial Basis Function Interpolants. 315-328 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3579 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Gutmann01 2003-09-17 <sup><sub>n</sub></sup><sup>2</sup>. 1-19 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3693 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#BoivinZ02 2003-09-17 Shape Preserving Interpolatory Subdivision Schemes for Nonuniform Data. 1-32 2002 114 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3628 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#KuijtD02 2003-09-17 <sub>infin</sub><sub>p</sub><sub>infin</sub>on a finite interval. 147-161 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00081-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Naidenov03 2003-10-08 Strong Asymptotics of the Generating Polynomials of the Stirling Numbers of the Second Kind. 198-217 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3533 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#Elbert01 2003-10-08 Ridge Functions and Orthonormal Ridgelets. 143-179 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3568 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Donoho01 2003-09-17 Some Expansions in Basic Fourier Series and Related Topics. 289-353 2002 115 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3659 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#Suslov02 2003-09-17 Asymptotics of zeros of basic sine and cosine functions. 292-335 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00027-3 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Suslov03 2003-09-17 Lagrange Interpolation for the Disk Algebra: The Worst Case. 354-358 2002 115 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3660 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#Herzog02 2003-10-08 Rate of Convergence of the Linear Discrete Polya Algorithm. 109-119 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3552 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#QuesadaN01 2003-10-08 Erratum: "Basic Analog of Fourier Series on a q-Linear Grid", Volume 112, Number 1 (2001), pages 134-157. 326 2001 113 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3648 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#BustozC01a 2003-09-17 Some properties of the Bézier-Kantorovich type operators. 256-269 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00106-0 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Pych-Taberska03 2003-09-17 Weighted Sobolev Spaces on Curves. 41-85 2002 119 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3709 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#AlvarezPRR02 2003-10-08 Zeros of the Hypergeometric Polynomials F(-n, b; -2n; z). 74-87 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3548 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#DriverM01 2003-09-17 Properties of locally linearly independent refinable function vectors. 24-41 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00036-4 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#PlonkaZ03 2003-10-08 Fekete Potentials and Polynomials for Continua. 110-125 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3535 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#KorevaarM01 2003-09-17 <sup>1</sup>-approximations. 89-109 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00066-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Sommer03 2003-09-17 Mass Points of Measures and Orthogonal Polynomials on the Unit Circle. 257-274 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3723 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Golinskii02 2003-10-08 Relative Asymptotics for Orthogonal Matrix Polynomials with Convergent Recurrence Coefficients. 1-30 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3557 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#YakhlefMP01 2005-04-08 Rate of Convergence of the Linear Discrete Pólya 1-Algorithm. 316-329 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3727 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#QuesadaMNF02 2003-10-08 On the Delone Triangulation Numbers. 139-142 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3563 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#MankiewiczS01 2003-09-17 Uniform Convergence of Fourier-Jacobi Series. 207-228 2002 117 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3697 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#Kvernadze02 2003-10-08 Some Orthogonal Polynomials Related to Elliptic Functions. 251-278 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3593 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#IsmailVY01 2003-10-08 Weierstrass' Theorem in Weighted Sobolev Spaces. 119-160 2001 108 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3490 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat108.html#Rodriguez01 2003-09-17 Approximation by polynomials and smooth functions in Sobolev spaces with respect to measures. 185-216 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00019-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#Rodriguez03 2003-09-17 Error formulas for divided difference expansions and numerical differentiation. 1-9 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00025-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#Floater03 2003-09-17 On Fourier Series of a Discrete Jacobi-Sobolev Inner Product. 1-22 2002 117 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3681 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#MarcellanOR02 2003-10-08 A Counter-Example to the General Convergence of Partially Greedy Algorithms. 128-138 2001 111 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3566 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Gribonval01 2003-11-21 Determining radii of meromorphy via orthogonal polynomials on the unit circle. 263-281 2003 124 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat124.html#BarriosLS03 2003-10-08 Box Spline Prewavelets of Small Support. 16-27 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3587 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#BuhmannDG01 2003-10-08 A Class of Nonsymmetric Orthogonal Polynomials on the Unit Circle. 30-47 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3542 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#CanteroMM01 2003-09-17 On the zeros of the Scorer functions. 253-266 2003 120 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(02)00022-9 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#GilST03 2003-09-17 A generating function for Laguerre-Sobolev orthogonal polynomials. 111-123 2003 120 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00014-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat120.html#MeijerP03 2003-09-17 Relative asymptotics and Fourier series of orthogonal polynomials with a discrete Sobolev inner product. 336-356 2003 121 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00035-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#RochaMS03 2003-10-08 Convergence of Hermite and Hermite-Fejér Interpolation of Higher Order for Freud Weights. 21-58 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3619 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#DamelinJK01 2003-09-17 Dense Linear Manifolds of Monsters. 156-180 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3712 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#Bernal-GonzalezC02 2003-09-17 Approximation Numbers of Identity Operators between Symmetric Sequence Spaces. 305-315 2002 118 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3726 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#Hinrichs02 2003-10-08 Convergence of Multipoint Padé-type Approximants. 257-278 2001 109 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2000.3537 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#YsernL01 2003-10-08 Basic Analog of Fourier Series on a q-Linear Grid. 134-157 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3599 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#BustozC01 2003-10-08 Book Review: "Constructive Approximation on the Sphere, with Application to Geomathematics" by W. Freeden, T. Gervens and M. Schreiner. 324-325 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3607 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Assche01a 2003-10-08 Rational Approximation to the Exponential Function with Complex Conjugate Interpolation Points. 344-368 2001 111 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3581 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat111.html#Wielonsky01 2003-09-17 <sub>1</sub>Systems in Banach Spaces. 214-241 2002 114 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3641 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat114.html#DilworthKW02 2003-10-08 Non-linear Approximation and Interpolation Spaces. 110-126 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3625 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#Kyriazis01 2003-09-17 Coconvex Approximation. 20-65 2002 118 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3695 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat118.html#LeviatanS02 2003-09-17 Coconvex polynomial approximation. 100-118 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00045-X http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#LeviatanS03 2003-09-17 <sub>p</sub>(I, E). 369-379 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3676 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#SaidiHK02 2003-09-17 Approximation of eigenfunctions of elliptic differential operators. 13-24 2003 123 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00068-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#ColzaniM03 2003-09-17 On Strong Approximations of USC Nonconvex-Valued Mappings. 1-17 2002 119 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3707 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#RepovsS02 2003-09-17 Strong Subdifferentiability of Convex Functionals and Proximinality. 397-415 2002 116 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3679 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat116.html#GodefroyIL02 2003-09-17 Approximation of *Weak-to-Norm Continuous Mappings. 18-40 2002 119 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2002.3708 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#DAmbrosio02 2003-09-17 Counterexamples in parameter identification problem of the fractal interpolation functions. 121-128 2003 122 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00028-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat122.html#RuanSS03 2003-10-08 Reverse Hölder Inequalities and Approximation Spaces. 82-109 2001 109 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3531 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat109.html#MartinM01 2003-09-17 Lower Semicontinuity Concepts, Continuous Selections, and Set Valued Metric Projections. 120-143 2002 115 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3654 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat115.html#BrownDIK02 2003-10-08 Rational and Polynomial Interpolation of Analytic Functions with Restricted Growth. 61-72 2001 112 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3592 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Gustafsson01 2003-09-17 Orthonormal polynomials with generalized Freud-type weights. 13-53 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00041-2 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#KasugaS03 2003-09-17 Multivariate n-term rational and piecewise polynomial approximation. 158-197 2003 121 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(02)00060-6 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat121.html#Petrushev03 2003-10-08 <sup>inx</sup>; x[isin]R}. 311-317 2001 112 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2001.3591 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat112.html#Arimoto01 2003-09-17 Oblique Projections and Abstract Splines. 189-206 2002 117 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3696 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat117.html#CorachMS02 2003-10-08 Ratio Asymptotics for Orthogonal Matrix Polynomials with Unbounded Recurrence Coefficients. 1-17 2001 110 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2000.3544 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat110.html#GuardenoD01 2003-10-08 Zero Location for Nonstandard Orthogonal Polynomials. 127-141 2001 113 Journal of Approximation Theory 1 http://dx.doi.org/10.1006/jath.2001.3598 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat113.html#GuardenoS01 2003-09-17 <sub>X</sub>(T). 291-299 2002 119 Journal of Approximation Theory 2 http://dx.doi.org/10.1006/jath.2002.3733 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat119.html#Timofte02 2003-09-17 <sub>X</sub><sub>Y</sub>(S). 270-275 2003 123 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/S0021-9045(03)00103-5 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat123.html#Timofte03 2004-01-16 Quadratic Hermite-Padé polynomials associated with the exponential function. 238-294 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Stahl03 2004-01-16 Strong asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight. 198-237 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Vanlessen03 2004-01-16 On the holes of a class of bidimensional nonseparable wavelets. 151-168 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Li03a 2004-01-16 On asymptotic properties of Freud-Sobolev orthogonal polynomials. 26-41 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#CachafeiroMM03 2004-01-16 A continuous function space with a Faber basis. 303-312 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Obermaier03 2004-01-16 Extremal problems for matrix-valued polynomials on the unit circle and applications to multivariate stationary sequences. 42-62 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#KlotzL03 2004-01-16 Lower bounds for the merit factors of trigonometric polynomials from Littlewood classes. 190-197 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#BorweinE03 2004-01-16 <i>ax</i><sup>2</sup><sup>-1</sup>and its transforms. 106-115 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Lubinsky03 2004-01-16 On strengthened Hardy and Pólya-Knopp's inequalities. 74-84 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#CizmesijaPP03 2004-01-16 Strong asymptotic behavior for extremal polynomials with respect to varying measures on the unit circle. 131-144 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#HernandezC03 2004-01-16 Porosity of mutually nearest and mutually furthest points in Banach spaces. 10-25 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#LiX03a 2004-01-16 Sharp estimates for Jacobi matrices and chain sequences, II. 295-302 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Szwarc03 2004-01-16 The Christoffel function for the Hermite weight is bell-shaped. 145-150 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Nikolov03 2004-01-16 Uniform convergence of the Bieberbach polynomials in closed smooth domains of bounded boundary rotation. 116-130 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Israfilov03 2004-01-16 Multivariate approximating averages. 85-105 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#BelinskyDD03 2004-01-16 Incompleteness and closure of a linear span of exponential system in a weighted Banach space. 1-9 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Deng03 2004-01-16 On a class of Sobolev scalar products in the polynomials. 169-189 2003 125 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#RobertS03a 2004-01-16 Eigenfunctions of Durrmeyer-type modifications of Meyer-König and Zeller operators. 63-73 2003 125 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat125.html#Heilmann03 2005-02-21 Sequences with equi-distributed extreme points in uniform polynomial approximation. 157-170 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.01.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#BlattGK04 2005-02-21 On a problem of H. Shapiro. 218-232 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#OstrovskiiU04 2005-02-21 Uniqueness of best -approximation from the set of splines with infinitely many simple knots. 60-113 2004 126 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#DamasM04 2005-02-21 Ratio asymptotics and weak asymptotic measures for orthogonal polynomials on the real line. 198-217 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2003.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#Simon04 2005-02-21 The approximation property for spaces of holomorphic functions on infinite-dimensional spaces I. 141-156 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.01.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#DineenM04 2005-02-21 Asymptotic approximation by de la Valle'e Poussin means and their derivatives. 115-125 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.01.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#Abel04 2005-02-21 Hermite-Pade' approximation and simultaneous quadrature formulas. 171-197 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.01.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#PrietoIL04 2005-02-21 <i>n</i>-widths. 40-51 2004 126 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#BaratchartPS04 2005-02-21 Direct and converse results for the weighted rational approximation of functions with inner singularities. 16-35 2004 126 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#Vecchia04 2005-02-21 Kolmogorov widths between the anisotropic space and the space of functions with mixed smoothness. 52-59 2004 126 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.11.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#WangS04 2005-02-21 Discrete Fourier-Neumann series. 126-140 2004 126 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.01.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#Ciaurri04 2005-11-08 A tribute to Géza Freud. 1-15 2004 126 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/S0021-9045(03)00088-1 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#Mhaskar04 2005-02-21 Short proofs of some theorems in approximation theory. 36-39 2004 126 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat126.html#Mellander04 2005-02-21 Weighted approximation of functions on the real line by Bernstein polynomials. 223-239 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#VecchiaMS04 2005-02-21 On the divided differences of the remainder in polynomial interpolation. 193-197 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#WangLY04 2005-02-21 Function-valued Korovkin systems without quasiconcavity and set-valued Korovkin systems without convexity. 74-82 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#Teran04 2005-02-21 Where do homogeneous polynomials on l1n attain their norm? 124-133 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#Perez-GarciaV04 2005-02-21 Weierstrass' theorem with weights. 83-107 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.01.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#PortillaQRT04 2005-02-21 Estimates for the first and second derivatives of the Stieltjes polynomials. 155-177 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#Jung04 2005-02-21 On constants in some inequalities for intermediate derivatives on a finite interval. 207-222 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#Rafalson04 2005-02-21 Kergin interpolation in Banach spaces. 108-123 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.01.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#Filipsson04 2005-02-21 Radial basis functions under tension. 135-154 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#BouhamidiM04 2005-02-21 (C, alpha) summability of Walsh-Kaczmarz-Fourier series. 39-60 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#Simon04a 2005-02-21 Erratum to "Multivariate approximating averages". 134- 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#BelinskyDD04 2005-02-21 Denisov's theorem on recurrence coefficients. 240-245 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#NevaiT04 2005-02-21 Multivariate tight affine frames with a small number of generators. 61-73 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.01.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#SalvatoriS04 2005-02-21 Orthonormal polynomials for generalized Freud-type weights and higher-order Hermite-Feje'r interpolation polynomials. 1-38 2004 127 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.01.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#KasugaS04 2005-02-21 Codimension-one minimal projections onto Haar subspaces. 198-206 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#LewickiP04 2005-02-21 Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. 178-192 2004 127 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat127.html#BauschkeCL04 2005-02-21 Spaces of functions of mixed smoothness and approximation from hyperbolic crosses. 115-150 2004 128 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#SchmeisserS04 2005-02-22 Bernstein polynomials and learning theory. 187-206 2004 128 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#BraessS04 2005-02-21 A note on the error bound for the remainder of an asymptotic expansion of the double gamma function. 100-101 2004 128 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.02.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#Ferreira04 2005-02-21 On the pointwise convergence of Cesa`ro means of two-variable functions with respect to unbounded Vilenkin systems. 69-99 2004 128 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#Gat04 2005-02-21 Inequalities of Rafalson type for algebraic polynomials. 175-186 2004 128 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#KwonL04 2005-02-21 Estimates for the first and second Bohr radii of Reinhardt domains. 53-68 2004 128 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#DefantGM04 2005-02-21 Jacobi approximations in non-uniformly Jacobi-weighted Sobolev spaces. 1-41 2004 128 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.03.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#GuoW04 2005-02-21 Entropy of convex hulls--some Lorentz norm results. 42-52 2004 128 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#Steinwart04 2005-02-21 Convergence rate of Fourier-Laplace series of L2-functions. 103-114 2004 128 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#LinW04 2005-02-21 Continuity envelopes of spaces of generalised smoothness, entropy and approximation numbers. 151-174 2004 128 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#HaroskeM04 2005-02-21 Kolmogorov numbers of Riemann-Liouville operators over small sets and applications to Gaussian processes. 207-233 2004 128 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat128.html#Linde04 2005-02-21 Convergence of Hermite-Feje'r type interpolation of higher order on an arbitrary system of nodes. 102-117 2004 129 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2003.04.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#Shi04 2005-02-21 A Duchon framework for the sphere. 28-57 2004 129 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#HubbertM04 2005-02-21 ₀. 217-229 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.04.013 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#Alimov04 2005-02-21 Scalar and matrix Riemann-Hilbert approach to the strong asymptotics of Padé approximants and complex orthogonal polynomials with varying weight. 129-166 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#AptekarevA04 2005-02-21 Tight frame approximation for multi-frames and super-frames. 78-93 2004 129 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.04.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#Han04 2005-02-21 Interpolation of several multiparametric approximation spaces. 182-206 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#AsekritovaB04 2005-02-21 Approximation numbers in function spaces and the distribution of eigenvalues of some fractal elliptic operators. 1-27 2004 129 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.05.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#Triebel04 2005-02-21 _p-error estimates for radial basis function interpolation on the sphere. 58-77 2004 129 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#HubbertM04a 2005-02-21 Commutators for Fourier multipliers on Besov Spaces. 119-128 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.03.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#CerdaM04 2005-02-21 The generalized decomposition theorem in Banach spaces and its applications. 167-181 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#SongC04 2005-02-21 Approximation by ridge function fields over compact sets. 230-239 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#Pelletier04 2005-02-21 Maximal cluster sets along arbitrary curves. 207-216 2004 129 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#Bernal-GonzalezCP04 2005-02-21 A Hilbert transform representation of the error in Lagrange interpolation. 94-100 2004 129 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.05.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat129.html#KubayiL04 2005-02-21 A new approach to vector-valued rational interpolation. 179-189 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#Sidi04 2005-02-21 An abstract formulation of variational refinement. 150-163 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.07.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#Kersey04 2005-02-21 Galerkin approximation for elliptic PDEs on spheres. 125-149 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#Gia04 2005-02-21 On the convergence of certain sequences of rational approximants to meromorphic functions in several variables. 99-112 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#Garcia04 2005-02-21 A Christoffel-Darboux formula for multiple orthogonal polynomials. 190-202 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#DaemsK04 2005-02-21 On theorems of Gelfond and Selberg concerning integral-valued entire functions. 164-178 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.07.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#BundschuhZ04 2005-02-21 Markov-type inequalities on certain irrational arcs and domains. 113-124 2004 130 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#ErdelyiK04 2005-02-21 Best constant approximants in Lorentz spaces. 196-207 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.10.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#LevisC04 2005-02-21 Dimension of C1-splines on type-6 tetrahedral partitions. 157-184 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#HangelbroekNRSZ04 2005-11-08 Polynomial operators and local smoothness classes on the unit interval. 243-267 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.10.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Mhaskar04a 2005-02-21 On the least values of Lp-norms for the Kontorovich-Lebedev transform and its convolution. 231-242 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.10.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Yakubovich04 2005-02-21 The uniform closure of non-dense rational spaces on the unit interval. 149-156 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.06.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Erdelyi04 2005-02-21 Blossoms of generalized derivatives in Chebyshev spaces. 47-58 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Mazure04 2005-02-21 Approximation with scaled shift-invariant spaces by means of quasi-projection operators. 30-46 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Jia04 2005-02-21 New polynomial preserving operators on simplices: direct results. 59-73 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#BerdyshevaJS04 2005-02-21 On the degree of convergence of lemniscates in finite connected domains. 185-195 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Laiyi04 2005-02-21 Approximation of unbounded functions via compactification. 284-305 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.08.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Gingold04 2005-02-21 Generalization of Hermite functions by fractal interpolation. 19-29 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#NavascuesS04 2005-02-21 New inequalities from classical Sturm theorems. 208-230 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.09.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#DeanoGS04 2005-02-21 Ambikeshwar Sharma (1920-2003). 1-18 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.09.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#X04 2005-02-21 Riemann-Hilbert analysis and uniform convergence of rational interpolants to the exponential function. 100-148 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.07.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#Wielonsky04 2005-02-21 On trigonometric and paratrigonometric Hermite interpolation. 74-99 2004 131 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.09.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#DuHJ04 2005-02-21 Combinations of multivariate averages. 268-283 2004 131 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat131.html#DaiD04 2005-02-21 A short proof of Ramanujan's famous 1V1 summation formula. 149-153 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.11.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Chan05 2005-02-21 Zeros of polynomials orthogonal on two arcs of the unit circle. 42-71 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#LukashovP05 2005-02-21 UPC condition in polynomially bounded o-minimal structures. 25-33 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Pierzchala05 2005-02-21 Almost strict total positivity and a class of Hurwitz polynomials. 212-223 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.10.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#DimitrovP05 2005-02-21 A local version of the Pawlucki-Plesniak extension operator. 34-41 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.013 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#AltunG05 2005-02-21 On the distribution of poles of Padé approximants to the Z-transform of complex Gaussian white noise. 224-240 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.10.014 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Barone05 2005-02-21 Identical approximative sequence for various notions of universality. 15-24 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#CostakisV05 2005-02-21 ^s₂^d). 97-148 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#HoltzR05 2005-02-21 Multiple Wilson and Jacobi-Piñeiro polynomial. 155-181 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#BeckermannCA05 2005-02-21 <i>m</i><i>m</i>-linear forms. 204-211 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Vestfrid05 2005-02-21 Derivatives of multidimensional Bernstein operators and smoothness. 241-257 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Cao05 2005-02-21 Korovkin-type theorem and application. 258-264 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Heping05 2005-02-21 Direct approximation theorems for Dirichlet series in the norm of uniform convergence. 1-14 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Forster05 2005-02-21 On interpolation of function spaces by methods defined by means of polygons. 182-203 2005 132 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#CobosM05 2005-02-21 Linear widths of a multivariate function space equipped with a Gaussian measure. 77-96 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#GuangguiG05 2005-02-21 Smooth planar r-splines of degree 2r. 72-76 2005 132 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat132.html#Tohaneanu05 2005-02-21 Monomial orthogonal polynomials of several variables. 1-37 2005 133 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.12.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#Xu05 2005-02-21 New analysis of the sphere covering problems and optimal polytope approximation of convex bodies. 134-145 2005 133 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.12.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#Chen05 2005-02-21 Ul'yanov and Nikol'skii-type inequalities. 100-133 2005 133 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.12.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#DitzianT05 2005-02-21 Extrapolation theory: new results and applications. 38-99 2005 133 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#KaradzhovM05 2005-02-21 Subcouples of codimension one and interpolation of operators that almost agree. 78-98 2004 130 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.06.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#Sunehag04 2006-06-28 One-complemented subspaces of Musielak-Orlicz sequence spaces. 1-37 2004 130 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.07.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#JamisonKL04 2005-02-21 A note on the equivalences between the averages and the K-functionals related to the Laplacian. 38-45 2004 130 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.01.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#DaiW04 2005-02-21 Finite-order weights imply tractability of linear multivariate problems. 57-77 2004 130 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.06.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#WasilkowskiW04 2005-02-21 On the best conditioned bases of quadratic polynomials. 46-56 2004 130 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.07.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat130.html#Foucart04 2006-04-27 Characterization of compactly supported refinable splines whose shifts form a Riesz basis. 245-250 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.015 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#GuanLT05 2006-04-27 On best rational approximation of analytic functions. 284-296 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#Prokhorov05 2006-04-27 Approximation in rough native spaces by shifts of smooth kernels on spheres. 269-283 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#LevesleyS05 2006-04-27 The finite section method and problems in frame theory. 221-237 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.01.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#ChristensenS05 2006-04-27 Marcinkiewicz multiplier theorem and the Sunouchi operator for Ciesielski-Fourier series. 195-220 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.017 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#Weisz05 2006-04-27 Polynomial approximation of analytic functions on a finite number of continua in the complex plane. 238-244 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.016 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#Andrievskii05 2006-04-27 Kernels and best approximations related to the system of ultraspherical polynomials. 173-194 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.013 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#KolyadaM05 2006-04-27 Interpolation of functions from generalized Paley-Wiener spaces. 251-268 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.12.014 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#LyubarskiiM05 2006-04-27 On 3-monotone approximation by piecewise polynomials. 147-172 2005 133 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2004.01.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat133.html#LeviatanP05 2006-04-27 A strong convergence theorem for relatively nonexpansive mappings in a Banach space. 257-266 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#MatsushitaT05 2006-04-27 Three term recurrence relation modulo ideal and orthogonality of polynomials of several variables. 11-64 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.12.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#CichonSS05 2006-04-27 Orthogonal matrix polynomials, scalar-type Rodrigues' formulas and Pearson equations. 267-280 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#GuardenoG05 2006-04-27 On a conjecture of Clark and Ismail. 102-113 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#AlzerBK05 2006-04-27 Book reviews Walter Van Assche and Carl de Boor, Book Review Editors. 281-290 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#Dimitrov05 2006-04-27 Holomorphic Jackson's theorems in polydiscs. 175-198 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#RenW05 2006-04-27 Riemann-Hilbert analysis for Jacobi polynomials orthogonal on a single contour. 137-170 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#Martinez-FinkelshteinO05 2006-04-27 Universal Taylor series on doubly connected domains with respect to every center. 1-10 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#Costakis05 2006-04-27 <i>x</i>^<i>rho</i><i>e</i>^{<i>Q</i><i>x</i>)}<i>d</i>). 199-256 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#LevinL05 2006-04-27 On the convergence of derivatives of Bernstein approximation. 130-135 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.02.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#Floater05 2006-04-27 Higher-order Szego theorems with two singular points. 114-129 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.02.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#SimonZ05 2006-04-27 An asymptotic expansion for the error in a linear map that reproduces polynomials of a certain order. 171-174 2005 134 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.02.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#Boor05 2006-04-27 Radial basis functions and corresponding zonal series expansions on the sphere. 65-79 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.12.018 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#CastellF05 2006-04-27 A comparative study of various notions of approximation of sets. 80-101 2005 134 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2004.10.015 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat134.html#AgadiP05 2006-07-19 <i>epsilon</i>-subgradient characterizations of constrained best approximation. 145-159 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#JeyakumarM05 2006-04-27 On the poisedness of Bojanov-Xu interpolation. 176-202 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#HakopianK05 2006-04-27 Asymptotic formulae of Mehler-Heine-type for certain classical polyorthogonal polynomials. 160-175 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Takata05 2006-04-27 Interlacing property for B-splines. 1-21 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Foucart05 2006-04-27 Mourre's theory for some unbounded Jacobi matrices. 233-244 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Sahbani05 2006-04-27 Some asymptotic properties for orthogonal polynomials with respect to varying measures. 22-34 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#AlfaroHMV05 2006-04-27 Fine structure of the zeros of orthogonal polynomials, II. OPUC with competing exponential decay. 125-139 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.04.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Simon05 2006-04-27 Simultaneously maximal radial cluster sets. 114-124 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.04.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Bernal-GonzalezCP05 2006-04-27 The Polya algorithm in sequence spaces. 245-257 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.05.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#QuesadaFMB05 2006-04-27 Rate of convergence of the Pólya algorithm from polyhedral sets. 105-113 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#HuotariMNQ05 2006-04-27 Polynomial splines and eigenvalue approximations on quantum graphs. 203-220 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Pesenson05 2006-04-28 Polynomial projectors preserving homogeneous partial differential equations. 221-232 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Dinh-DungCT05 2006-04-27 <i>RS</i>-set in a Banach space. 35-53 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Li05 2006-04-27 On monotone rational approximation. 54-69 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Bondarenko05 2006-04-27 Note on the region of convergence of a polynomial series. 140-144 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#Gotz05 2006-04-27 Simple and double eigenvalues of the Hill operator with a two-term potential. 70-104 2005 135 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.03.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#DjakovM05 2006-04-27 On a class of exponential-type operators and their limit semigroups. 258-275 2005 135 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.05.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat135.html#AltomareR05 2006-04-27 The distance to the functions with range in a given set in Banach spaces of vector-valued continuous functions. 22-41 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.07.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Burlando05 2006-04-27 Clifford algebra-valued orthogonal polynomials in Euclidean space. 108-122 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.08.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#BrackxSS05 2006-04-27 Error estimates for matrix-valued radial basis function interpolation. 238-249 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Lowitzsch05 2006-04-27 Harmonic number identities and Hermite-Padé approximations to the logarithm function. 42-56 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.07.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Chu05 2006-04-27 <i>^P</i>(R) and the uniform norm. 250-263 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.07.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#ButzerHS05 2006-04-27 Asymptotic of extremal polynomials in the complex plane. 226-237 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#LagomasinoIC05 2006-04-27 ^<i>d</i>. 277-280 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.014 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#CastellFS05 2006-04-27 Nonexpansive selections of metric projections in spaces of continuous functions. 187-200 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#BenyaminiEL05 2006-04-27 The zeros of linear combinations of orthogonal polynomials. 179-186 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#BeardonD05 2006-04-27 Discrete orthogonal projections on multiple knot periodic splines. 201-225 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#GrigorieffS05 2006-04-27 Embeddings of Beppo-Levi spaces in Hölder-Zygmund spaces, and a new method for radial basis function interpolation error estimates. 166-178 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.07.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#BeatsonBL05 2006-04-27 Cardinal interpolation with polysplines on annuli. 89-107 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.08.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#KounchevR05 2006-04-27 Pointwise simultaneous approximation by combinations of Bernstein operators. 1-21 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.05.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Xie05 2006-04-27 Greedy algorithm for functions with low mixed smoothness. 264-276 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.09.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Wang05 2006-04-27 <i>m</i>-orthogonal polynomials. 57-88 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.07.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Shi05 2006-04-27 <i>L</i>_<i>p</i>. 123-142 2005 137 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.07.010 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#Li05a 2006-04-27 Uniform estimates for polynomial approximation in domains with corners. 143-165 2005 137 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.04.012 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat137.html#AbdullayevS05 2006-04-27 Construction of biorthogonal wavelets from pseudo-splines. 211-231 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.008 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#DongS06 2006-04-27 Characterization of 1-greedy bases. 65-86 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.09.017 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#AlbiacW06 2006-04-27 A family of Sobolev orthogonal polynomials on the unit ball. 232-241 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#Xu06 2006-04-27 Simultaneous approximation on two subsets of an open Riemann surface. 151-167 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#BoivinGS06 2006-04-27 Hypercyclic sequences of PDE-preserving operators. 168-183 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#Petersson06 2006-04-27 On approximation properties of a family of linear operators at critical value of parameter. 242-253 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.011 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#AlievGA06 2006-04-27 <i>q</i>-Bernstein operator. 37-53 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.09.015 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#Ostrovska06 2006-04-27 Direct and inverse results in Hölder norms. 112-123 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.10.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#BustamanteR06 2006-04-27 Otto Blumenthal (1876-1944) in retrospect. 1-36 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.09.013 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#ButzerV06 2006-04-27 Convolution operators on the weighted Herz-type Hardy spaces. 197-210 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.007 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#Lee06 2006-04-27 A characterization and equations for minimal shape-preserving projections. 184-196 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.11.006 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#ChalmersMP06 2006-04-27 Dual generalized Bernstein basis. 129-150 2006 138 Journal of Approximation Theory 2 http://dx.doi.org/10.1016/j.jat.2005.10.005 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#LewanowiczW06 2006-04-27 An equivalence for the Riemann Hypothesis in terms of orthogonal polynomials. 54-64 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.09.016 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#CardonR06 2006-04-27 Exact Markov inequalities for the Hermite and Laguerre weights. 87-96 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.09.018 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#MilevN06 2006-04-27 <i>L</i>^<i>p</i>. 97-111 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.10.003 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#Aubry06 2006-04-27 Corrigendum to and two open questions arising from the article "Approximation in rough native spaces by shifts of smooth kernels on spheres": [J. Approx. Theory 133 (2005) 269-283]. 124-127 2006 138 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.11.002 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat138.html#LevesleyS06 2006-04-27 Stone-Weierstrass theorems revisited. 45-59 2005 136 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.05.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat136.html#Timofte05 2006-04-27 The generalized Bernstein problem on weighted Lacunary polynomial approximation. 108-114 2005 136 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.05.009 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat136.html#GaoD05 2006-04-27 On variations of characteristic values of entire matrix pencils. 115-128 2005 136 Journal of Approximation Theory 1 http://dx.doi.org/10.1016/j.jat.2005.06.004 http://www.informatik.uni-trier.de/~ley/db/journals/jat/jat136.html#Gil05