WorldCat Identities

Bentley, Jon Louis

Overview
Works: 83 works in 220 publications in 5 languages and 2,968 library holdings
Genres: Case studies 
Classifications: QA76.6, 005.1
Publication Timeline
Key
Publications about  Jon Louis Bentley Publications about Jon Louis Bentley
Publications by  Jon Louis Bentley Publications by Jon Louis Bentley
Most widely held works by Jon Louis Bentley
Programming pearls by Jon Louis Bentley ( Book )
57 editions published between 1985 and 2011 in 3 languages and held by 1,408 WorldCat member libraries worldwide
"Just as natural pearls grow from grains of sand that irritate oysters, programming pearls have grown from real problems that have irritated real programmers. With origins beyond solid engineering, in the realm of insight and creativity, Bentley's pearls offer unique and clever solutions to those nagging problems. Illustrated by programs designed as much for fun as for instruction, the book is filled with lucid and witty descriptions of practical programming techniques and fundamental design principles. It is not at all surprising that Programming Pearls has been so highly valued by programmers at every level of experience."--BOOK JACKET
More programming pearls : confessions of a coder by Jon Louis Bentley ( Book )
18 editions published between 1988 and 1993 in English and held by 699 WorldCat member libraries worldwide
Software -- Software Engineering
Writing efficient programs by Jon Louis Bentley ( Book )
12 editions published in 1982 in English and held by 579 WorldCat member libraries worldwide
Perlen der Programmierkunst = Programming pearls by Jon Louis Bentley ( Book )
1 edition published in 2000 in German and held by 39 WorldCat member libraries worldwide
Programming Pearls : Second Edition zhong wen ban by Peng Te Li ( Book )
1 edition published in 2001 in Chinese and held by 14 WorldCat member libraries worldwide
Divide and conquer algorithms for closest point problems in multidimensional space by Jon Louis Bentley ( Book )
8 editions published between 1976 and 1982 in English and held by 11 WorldCat member libraries worldwide
Algorithms for reporting and counting geometric intersections by Jon Louis Bentley ( Book )
3 editions published in 1978 in English and German and held by 10 WorldCat member libraries worldwide
An interesting class of Geometric Intersection Problems calls for dealing with the pairwise intersections among a set of N objects in the plane. These problems arise in many applications such as printed circuit design, architectural data bases, and computer graphics. Shamos and Hoey have described a number of algorithms for detecting if any two objects in a planar set intersect. This paper extends this work by giving algorithms which count the number of such intersections and algorithms which report all such intersections
An introduction to algorithm design by Jon Louis Bentley ( Book )
2 editions published between 1978 and 1979 in English and held by 8 WorldCat member libraries worldwide
Worst-Case Analyses of Self-Organizing Sequential Search Heuristics by Jon Louis Bentley ( Book )
3 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilitically. In this paper we show that the heuristics can also be analyzed in the worst-case sense, and that the relative merit of the heuristics under this analysis is different than in the probabilistic analyses. Simulations show that the relative merit of the heuristics on real data is closer to that of the new worst-case analyses rather than that of the previous probabilistic analyses. (Author)
Writing efficient code by Jon Louis Bentley ( Book )
3 editions published in 1981 in English and Undetermined and held by 6 WorldCat member libraries worldwide
An Alphard specification of a correct and efficient transformation on data structures by Jon Louis Bentley ( Book )
4 editions published between 1978 and 1979 in English and Undetermined and held by 6 WorldCat member libraries worldwide
In this paper we study standard program components applicable to a wide variety of design tasks; we choose for this study the specific problem domain of data structures for general search problems. Within this domain transformations for converting solutions of simple searching problems to solutions of more complex problems have been developed. We discuss one of those transformations, specify precisely the transformation and its conditions of applicability, and prove its correctness; we accomplish this by casting it in terms of abstract data types -- specifically by using the Alphard form mechanism. We also demonstrate that the costs of the structures derived by this transformation are only slightly greater than the costs of the original solutions. The transformation we describe has already been used to develop a number of new algorithms, and it represents a new level of generality in software engineering tools
A case study in writing efficient programs by Jon Louis Bentley ( Book )
3 editions published between 1982 and 1983 in English and held by 6 WorldCat member libraries worldwide
Efficiency considerations for C programs on a VAX 11/780 by Christopher J Van Wyk ( Book )
1 edition published in 1982 in English and held by 6 WorldCat member libraries worldwide
The complexity of manipulating hierarchically defined sets of rectangles by Jon Louis Bentley ( Book )
2 editions published in 1981 in English and held by 6 WorldCat member libraries worldwide
Algorithms that manipulate sets of rectangles are of great practical importance in VLSI design systems and other applications. Although much theoretical work has appeared recently on the complexity of rectangle problems, it has assumed that the inputs are given as a list of rectangles. In this paper we study the complexity of rectangle problems when the inputs are given in a hierarchical language that allows the designer to build large designs by replicating small designs. We will see that while most of the problems are NP-hard in the general case, there are O(N lg N) algorithms that process inputs obeying certain restrictions. (Author)
Perełki oprogramowania by Jon Louis Bentley ( Book )
3 editions published between 1992 and 2008 in Polish and held by 6 WorldCat member libraries worldwide
A general method for solving divide-and-conquer recurrences by Jon Louis Bentley ( Book )
3 editions published in 1978 in English and Undetermined and held by 6 WorldCat member libraries worldwide
The complexity of divide-and-conqure algorithms is often described by recurrence relations of the form T(n) = kT(n/c) + f(n). The only method currently available for solving such recurrences consists of solution tables for fixed functions f and varying k and c. In this note we describe a unifying method for solving these recurrences that is both general in applicability and easy to apply without the use of large tables
Transforming static data structures to dynamic structures by James B Saxe ( Book )
2 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches). We will exhibit three classes of such transformations, each based on a different counting scheme for representing the integers, and then use a combinatorial model to show the optimality of many of the transformations. Issues such as online data structures and deletion of elements are also examined. To demonstrate the applicability of these tools, we will study six new data structures that have been developed by applying the transformations. (Author)
Statistics on VLSI designs by Jon Louis Bentley ( Book )
2 editions published in 1980 in English and held by 5 WorldCat member libraries worldwide
This paper presents a statistical study of the components on VLSI chips. We examine the size and shape of components, and their placement over the chip area. The data is useful for building efficient VLSI design tools: the form of the distribution shows that some simple strategies can lead to efficient algorithms, and the parameters of the distribution aid in choosing program parameters. To illustrate the application of the statistics to VLSI design tasks, we present an algorithm for solving the 'rectangle intersection' problem that arises in design rule checkers. (Author)
Two papers on a tree-structured parallel computer by Jon Louis Bentley ( Book )
2 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide
This report consists of two papers describing various aspects of a new tree-structured parallel computer. The first paper, 'A tree machine for searching problems' by J.L. Bentley and H.T. Kung, describes the basic architecture of the machine. A set of N elements can be maintained on an N-processor version of the machine such that insertions, deletions, queries and updates can all be processed in 2 lg N time units. The queries can be very complex, including problems arising in ordered set manipulation, data bases, and statistics. The machine is pipelined so that M successive operations can be performed in M-1 + 2 lg N time units. The paper studies both the basic machine structure and a VLSI implementation of the machine. The second paper, 'A parallel algorithm for constructing minimum spanning trees' by J.L. Bentley, shows how an (N/lg N)-processor version of the machine can solve the problem of constructing minimum spanning trees in time proportional to N lg N. This algorithm is an improvement over existing algorithms in several ways. (Author)
On the average number of maxima in a set of vectors and applications ( Book )
2 editions published in 1977 in English and held by 5 WorldCat member libraries worldwide
A maximal vector of a set is one which is not less than any other vector in all components. A recurrence relation is derived for computing the average number of maximal vectors in a set of n vectors in d-space under the assumption that all n factorial to the dth power relative orderings are equally probable. Solving recurrence shows that the average number of maxima is 0((1n n) to the (d-1)th power). This result is used to construct an algorithm for finding all the maxima that has expected running time linear in n (for sets of vectors drawn under our assumptions). For a given set of random points, the result is also used to derive an upper bound on the expected number of points from the set which are on the boundary on the convex hull of the set. (Author)
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.56 (from 0.35 for Perlen der ... to 0.97 for On the ave ...)
Alternative Names
Bentley, J. L.
Bentley, J. L. (Jon Louis)
Bentley, Jon.
Bentley, Jon (John Louis)
Bentley, Jon L. (Jon Louis)
Бентли, Джон
ベントリー, J. L
ベントリー, ジョン
Languages
English (118)
Polish (3)
German (2)
Chinese (1)
Slovak (1)
Covers