bibliography jlb
-
R. A. Finkel and J. L. Bentley,
Quad Trees: A Data Structure for Retrieval by Composite Key,
Acta Informatica,
Vol. 4,
1,
pp. 1--9,
1974.
-
J. L. Bentley,
Multidimensional Binary Search Trees Used for Associative Searching,
Communications of the ACM,
Vol. 18,
9,
pp. 509--517,
September 1975.
-
J. L. Bentley,
A Survey of Techniques for Fixed Radius Near Neighbor Searching,
STAN-CS-75-513,
1975,
Stanford Computer Science Report.
-
J. L. Bentley and D. F. Stanat,
Analysis of Range Searches in Quad Trees,
Information Processing Letters,
Vol. 3,
6,
pp. 170--173,
1975.
-
J. L. Bentley and M. I. Shamos,
Divide and Conquer in Multidimensional Space,
Proc. 8th ACM Symp. on the Theory of Computing,
pp. 220--230,
May 1976.
-
J. L. Bentley and W. A. Burkhard,
Heuristics for Partial-match Retrieval Data Base Design,
Information Processing Letters,
Vol. 4,
5,
pp. 132--135,
1976.
-
J. L. Bentley,
Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Spaces,
TR-76-103,
Chapel Hill N. C.,
1976,
(Ph.D thesis Univ. of North Carolina.) ,
UNC Technical Report.
-
J. L. Bentley and A. C. Yao,
An Almost Optimal Algorithm for Unbounded Searching,
Information Processing Letters,
Vol. 5,
3,
pp. 82--87,
1976.
-
J. L. Bentley and H. T. Kung and M. Schkolnick and C. D. Thompson,
On the Average Number of Maxima in a Set of Vectors and Applications,
Proc. 15th Annual Allerton Conf. on Communication Control and Computing,
pp. 398--405,
September 1977.
-
J. L. Bentley and M. I. Shamos,
A Problem in Multivariate Statistics: Algorithm Data Structure and Applications,
Proc. 15th Annual Allerton Conf. on Communications Control and Computing,
pp. 193--201,
September 1977.
-
J. H. Friedman and J. L. Bentley and R. A. Finkel,
An Algorithm for Finding Best Matches in Logarithmic Expected Time,
ACM Trans. on Mathematical Software,
Vol. 3,
3,
pp. 209--226,
September 1977.
-
J. L. Bentley and M. I. Shamos,
Optimal Algorithms for Structuring Geographic Data,
Proc. International Advanced Study Symp. on Topological Data Structures for Geographic Information Systems,
Vol. 6,
Harvard University,
October 1977.
-
J. L. Bentley and D. F. Stanat and Williams Jr. E. H.,
The Complexity of Finding Fixed-Radius Near Neighbors,
Information Processing Letters,
Vol. 6,
6,
pp. 209--212,
1977.
-
J. L. Bentley and J. H. Friedman,
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces,
IEEE Transactions on Computers,
Vol. C-27,
2,
pp. 97--105,
February 1978.
-
J. L. Bentley and M. I. Shamos,
Divide and Conquer for Linear Expected Time,
Information Processing Letters,
Vol. 7,
2,
pp. 87--91,
February 1978.
-
J. L. Bentley and J. H. Friedman,
Algorithms and Data Structures for Range Searching,
Proc. of Computer Science and Statistics: 11th Annual Symposium on the Interface,
pp. 297--307,
March 1978.
-
J. L. Bentley,
The Whys and Wherefores of Algorithm Design,
Proc. of Computer Science and Statistics: 11th Annual Symposium on the Interface,
pp. 286--296,
March 1978.
-
J. L. Bentley and D. Detig and L. Guibas and J. B. Saxe,
An Optimal Data Structure for Dynamic Member Searching,
Unpublished notes,
pp. 1--10,
Spring 1978.
-
J. L. Bentley and H. T. Kung and M. Schkolnick and C. D. Thompson,
On the Average Number of Maxima in a Set of Vectors and Applications,
Journal of the ACM,
Vol. 25,
4,
pp. 536--543,
October 1978.
-
J. L. Bentley,
Multidimensional Divide-and-Conquer,
Research Review,
pp. 6--24,
1978,
(Carnegie-Mellon University Computer Science.) .
-
J. L. Bentley,
Algorithms for Multivariate Nonparametrics,
American Statistical Association 1978 Proc. of the Statistical Computing Section,
pp. 40--49,
October 1978.
-
J. L. Bentley and B. W. Weide and A. C. Yao,
Optimal Expected-Time Algorithms for Closest-Point Problems,
Proc. 16th Annual Allerton Conf. on Communication Control and Computing,
pp. 843--851,
October 1978.
-
J. L. Bentley,
Decomposable Searching Problems,
Proc. 16th Allerton Conf. on Communication Control and Computing,
pp. 40--49,
October 1978.
-
J. L. Bentley,
An Introduction to Algorithm Design,
IEEE Computer Magazine,
Vol. 12,
2,
pp. 66--78,
February 1979.
-
J. L. Bentley,
An Introduction to Algorithm Design,
rm Reprinted in: it Tutorial: Design of Microprocessor Systems ed. J. H. Carson,
pp. 222--234,
IEEE,
1979.
-
J. L. Bentley,
An Introduction to Algorithm Design,
rm Reprinted in: Dr. Dobb s Journal of Computer Calisthenics and Orthodontia,
Vol. 5,
4,
pp. 5--15,
April 1980.
-
J. L. Bentley,
An Introduction to Algorithm Design,
rm Reprinted in: it Selected Reprints on Software ed. M. Zelkowitz,
pp. 117--129,
IEEE,
1980.
-
J. L. Bentley,
An Introduction to Algorithm Design,
rm Reprinted in: it Selected Reprints on Software Second Edition ed. M. Zelkowitz,
IEEE,
1982.
-
J. L. Bentley and H. A. Maurer,
A Note on Euclidean Near Neighbor Searching in the Plane,
Information Processing Letters,
Vol. 8,
3,
pp. 133--136,
March 1979.
-
J. L. Bentley and M. Shaw,
An Alphard Specification of a Correct and Efficient Transformation on Data Structures,
Specifications of Reliable Software Proceedings,
pp. 222--237,
IEEE,
April 1979.
-
J. L. Bentley,
Decomposable Searching Problems,
Information Processing Letters,
Vol. 8,
5,
pp. 244--251,
June 1979.
-
J. L. Bentley,
Multidimensional Binary Search Trees in Database Applications,
IEEE Transactions on Software Engineering,
Vol. SE-5,
4,
pp. 333--340,
July 1979.
-
J. L. Bentley and H. T. Kung,
A Tree Machine for Searching Problems,
Proc. of the 1979 Int. Conf. on Parallel Processing,
pp. 257--266,
IEEE,
August 1979.
-
J. L. Bentley and T. Ottmann,
Algorithms for Reporting and Counting Geometric Intersections,
IEEE Trans. on Computers,
Vol. C-28,
9,
pp. 643--647,
September 1979.
-
J. L. Bentley,
A Parallel Algorithm for Constructing Minimum Spanning Trees,
Proc. 17th Annual Allerton Conf. on Communication Control and Computing,
pp. 11--20,
October 1979.
-
J. B. Saxe and J. L. Bentley,
Transforming Static Data Structures to Dynamic Structures,
Proc. 20th Annual Symp. on the Foundations of Computing Science,
pp. 148--168,
October 1979.
-
J. L. Bentley and M. Shaw,
Abstraction and Efficiency: The Interaction of Languages and Analysis,
Research Review,
pp. 53--72,
Carnegie-Mellon University Computer Science,
1979.
-
J. L. Bentley and J. B. Saxe,
Algorithms on Vector Sets,
SIGACT News,
Vol. 11,
9,
pp. 36--39,
Fall 1979.
-
J. L. Bentley,
Priority Queues with Range Restrictions,
Bulletin of the European Assoc. for Theoretical Computer Science,
9,
pp. 7--8,
October 1979.
-
J. L. Bentley and J. H. Friedman,
Data Structures for Range Searching,
Computing Surveys,
Vol. 11,
4,
pp. 397--409,
December 1979.
-
J. L. Bentley,
Notes on a Taxonomy of Planar Convex Hull Algorithms,
Unpublished notes,
pp. 1--6,
January 1980.
-
J. L. Bentley and D. Haken and R. W. Hon,
Statistics on VLSI Designs,
CMU-CS-80-111,
Carnegie-Mellon Computer Science Technical Report.
-
J. L. Bentley and H. A. Maurer,
Efficient Worst-Case Data Structures for Range Searching,
Acta Informatica,
Vol. 13,
2,
pp. 155--168,
1980.
-
J. L. Bentley,
A Parallel Algorithm for Constructing Minimum Spanning Trees,
Journal of Algorithms,
Vol. 1,
1,
pp. 51--59,
March 1980.
-
J. L. Bentley and D. Haken and R. W. Hon,
Fast Geometric Algorithms for VLSI Tasks,
COMPCON,
pp. 88--92,
IEEE,
Spring 1980.
-
J. L. Bentley and M. G. Faust and F. P. Preparata,
Approximation Algorithms for Convex Hulls,
Proc. 1980 Conf. on Information Sciences and Systems,
pp. 565--570,
Princeton University,
March 1980.
-
J. L. Bentley and C. E. Leiserson,
Space-Efficient Graph Layouts for VLSI,
Workshop on Interconnection Networks for Parallel and Distributed Processing,
pp. 29--30,
IEEE,
April 1980.
-
J. L. Bentley,
Multidimensional Divide-and-Conquer,
Communications of the ACM,
Vol. 23,
4,
pp. 214--229,
April 1980.
-
J. L. Bentley and T. Ottmann,
The Power of a One-Dimensional Vector of Processors,
Graph Theoretic Concepts in Computer Science: Proc. of the International Workshop WG80,
pp. 80--89,
Springer-Verlag,
June 1980.
-
J. L. Bentley and D. Wood,
An Optimal Worst-Case Algorithm for Reporting Intersections of Rectangles,
IEEE Trans. on Computers,
Vol. C-29,
7,
pp. 571--577,
July 1980.
-
C. H. Papadimitriou and J. L. Bentley,
A Worst-Case Analysis of Nearest-Neighbor Searching by Projection,
7th Int. Conf. on Automata Languages and Programming,
pp. 470--482,
Springer-Verlag,
August 1980.
-
J. L. Bentley and J. B. Saxe,
Generating Sorted Lists of Random Numbers,
ACM Trans. on Mathematical Software,
Vol. 6,
pp. 359--364,
September 1980.
-
J. L. Bentley and W. A. Carruthers,
Algorithms for Testing the Inclusion of Points in Polygons,
18th Annual Allerton Conf. on Communication Control and Computing,
pp. 11--19,
October 1980.
-
J. L. Bentley and J. B. Saxe,
An Analysis of Two Heuristics for the Euclidean Travelling Salesman Problem,
18th Annual Allerton Conf. on Communication Control and Computing,
pp. 41--49,
October 1980.
-
J. L. Bentley and D. J. Brown,
A General Class of Resource Tradeoffs,
Proc. 21st Ann. Symp. on the Foundations of Computer Science,
pp. 217--228,
IEEE,
October 1980.
-
J. L. Bentley,
Probabilistic Analysis of Algorithms,
Applied Probability Computer Science The Interface,
Vol. 1,
pp. 137--158,
1980.
-
J. L. Bentley and D. Haken and J. B. Saxe,
A General Method for Solving Divide-and-Conquer Recurrences,
SIGACT News,
Vol. 12,
3,
pp. 36--44,
Fall 1980.
-
J. L. Bentley and M. Shaw,
An Alphard Description of a Correct and Efficient Transformation on Data Structures,
IEEE Trans. on Software Engineering,
Vol. SE-6,
6,
pp. 572--584,
November 1980.
-
J. L. Bentley and M. Shaw,
An Alphard Description of a Correct and Efficient Transformation on Data Structures,
Alphard: Form and Content,
Ed. M. Shaw,
Springer-Verlag,
pp 1981.
-
J. L. Bentley and J. B. Saxe,
Decomposable Searching Problems I Static-to-Dynamic Transformations,
Journal of Algorithms,
Vol. 1,
4,
pp. 301--358,
December 1980.
-
J. L. Bentley and B. W. Weide and A. C. Yao,
Optimal Expected-Time Algorithms for Closest-Point Problems,
ACM Trans. on Math. Software,
Vol. 6,
4,
pp. 563--580,
December 1980.
-
J. L. Bentley,
Applications of Statistics to Applied Algorithm Design,
Computer Science and Statistics: Proc. 13th Symp. on the Interface,
pp. 59--67,
April 1981.
-
J. L. Bentley and T. Ottmann,
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles,
10th Int. Symp. on the Math. Foundations of Computer Science,
pp. 1--15,
August 1981.
-
J. L. Bentley,
Squeezing Constant Factors of Geometric Algorithms,
19th Annual Allerton Conf. on Communication Control and Computing,
pp. 11--20,
October 1981.
-
J. L. Bentley and D. F. Stanat and J. M. Steele,
Analysis of a Randomized Data Structure for Representing Ordered Sets,
19th Annual Allerton Conf. on Communication Control and Computing,
pp. 364--372,
October 1981.
-
J. L. Bentley,
Solutions to Klee s Rectangles Problems,
Unpublished notes,
pp. 1--15,
September 1977,
(Several of the results in these notes are described by J. van Leeuwen and D. Wood in their paper The Measure Problem for Rectangular Ranges in d-Space it Journal of Algorithms bf 2 3 September 1981.) .
-
J. L. Bentley and M. G. Faust and F. P. Preparata,
Approximation Algorithms for Convex Hulls,
Communications of the ACM,
Vol. 25,
1,
pp. 64--68,
January 1982.
-
J. L. Bentley,
Writing Efficient Programs,
Prentice-Hall,
Englewood Cliffs N. J.,
1982.
-
J. L. Bentley,
The Interaction of VLSI Theory and Practice: A Case Study,
Proc. Conf. on Advanced Research in VLSI,
pp. 1--2,
January 1982.
-
J. L. Bentley and C. A. Cole,
Worst-Case Analyses of Self-Organizing Sequential Search Heuristics,
20th Annual Allerton Conf. on Communication Control and Computing,
pp. 452--461,
1982.
-
J. L. Bentley and D. J. Brown,
A General Class of Resource Tradeoffs,
Journal of Computer and System Sciences,
Vol. 25,
2,
October 1982.
-
C. J. Van Wyk and J. L. Bentley and P. J. Weinberger,
Efficiency Considerations for C Programs on a VAX 11 780,
82-134,
1982,
Carnegie-Mellon University Report.
-
J. L. Bentley and H. T. Kung,
An Introduction to Systolic Algorithms and Architectures,
Naval Research Reviews,
Vol. 35,
2,
pp. 3--16,
1983.
-
J. L. Bentley and T. Ottmann and P. Widmayer,
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles,
Advances in Computing Research,
Ed. F. P. Preparata,
Vol. 1,
pp. 127--158,
JAI Press,
1983.
-
J. L. Bentley,
Programming Pearls: Cracking the Oyster,
Communications of the ACM,
Vol. 26,
8,
pp. 549--552,
August 1983.
-
J. L. Bentley,
Programming Pearls: Aha Algorithms,
Communications of the ACM,
Vol. 26,
9,
pp. 623--628,
September 1983.
-
J. L. Bentley,
Aha Algorithms,
rm Reprinted in: Algorithm: Recreational Programming,
Vol. 2,
4,
pp. 19--21,
October 1991.
-
J. L. Bentley,
Programming Pearls: Data Structures Programs,
Communications of the ACM,
Vol. 26,
10,
pp. 726--730,
October 1983.
-
J. L. Bentley and D. S. Johnson and T. Leighton and C. C. McGeoch,
An Experimental Study of Bin Packing,
Proc. of 21st Annual Allerton Conf. on Communication Control and Computing,
pp. 51--60,
October 1983.
-
J. L. Bentley,
Programming Pearls: Writing Correct Programs,
Communications of the ACM,
Vol. 26,
12,
pp. 1040--1045,
December 1983.
-
J. L. Bentley,
Programming Pearls: About the Column,
Communications of the ACM,
Vol. 27,
1,
pp. 12--13,
January 1984.
-
J. L. Bentley,
Programming Pearls: Code Tuning,
Communications of the ACM,
Vol. 27,
2,
pp. 91--96,
February 1984.
-
J. L. Bentley,
A Case Study in Applied Algorithm Design,
Computer,
Vol. 17,
2,
pp. 75--88,
February 1984.
-
J. L. Bentley,
Programming Pearls: The Back of the Envelope,
Communications of the ACM,
Vol. 27,
3,
pp. 180--184,
March 1984.
-
J. L. Bentley,
Programming Pearls: How to Sort,
Communications of the ACM,
Vol. 27,
4,
pp. 287--291,
April 1984.
-
H. N. Gabow and J. L. Bentley and R. E. Tarjan,
Scaling and Related Techniques for Geometry Problems,
Proc. of the 16th Ann. ACM Symp. on Theory of Computing,
pp. 135--143,
April 1984.
-
J. L. Bentley and D. S. Johnson and F. T. Leighton and C. C. McGeoch and L. A. McGeoch,
Some Unexpected Expected Behavior Results for Bin Packing,
Proc. of the 16th Ann. ACM Symp. on Theory of Computing,
pp. 279--288,
April 1984.
-
J. L. Bentley,
Programming Pearls: Squeezing Space,
Communications of the ACM,
Vol. 27,
5,
pp. 416--421,
May 1984.
-
J. L. Bentley,
Programming Pearls: Graphic Output,
Communications of the ACM,
Vol. 27,
6,
pp. 529--536,
June 1984.
-
J. L. Bentley,
Programming Pearls: Updates,
Communications of the ACM,
Vol. 27,
7,
pp. 630--636,
July 1984.
-
J. L. Bentley,
Programming Pearls: Algorithm Design Techniques,
Communications of the ACM,
Vol. 27,
9,
pp. 865--871,
September 1984.
-
J. L. Bentley and D. D. Sleator and R. E. Tarjan and V. K. Wei,
Data Compression Using the Move-to-Front Heuristic,
Proc. of the 22nd Annual Allerton Conf. on Communication Control and Computing,
October 1984.
-
J. L. Bentley,
Programming Pearls: Perspective on Performance,
Communications of the ACM,
Vol. 27,
11,
pp. 1087--1092,
November 1984.
-
J. L. Bentley,
Programming Pearls: A Little Program A Lot of Fun,
Communications of the ACM,
Vol. 27,
12,
pp. 1179--1182,
December 1984.
-
J. L. Bentley,
Programming Pearls: Tricks of the Trade,
Communications of the ACM,
Vol. 28,
2,
pp. 138--141,
February 1985.
-
J. L. Bentley,
Programming Pearls: Thanks Heaps,
Communications of the ACM,
Vol. 28,
3,
pp. 245--250,
March 1985.
-
J. L. Bentley and C. C. McGeoch,
Amortized Analyses of Self-Organizing Sequential Search Heuristics,
Communications of the ACM,
Vol. 28,
4,
pp. 404--411,
April 1985.
-
J. L. Bentley,
Programming Pearls: A Spelling Checker,
Communications of the ACM,
Vol. 28,
5,
pp. 456--462,
May 1985.
-
J. L. Bentley,
Programming Pearls: Associative Arrays,
Communications of the ACM,
Vol. 28,
6,
pp. 570--576,
June 1985.
-
J. L. Bentley,
Programming Pearls: Confessions of a Coder,
Communications of the ACM,
Vol. 28,
7,
pp. 671--679,
July 1985.
-
J. L. Bentley,
Programming Pearls: Bumper-Sticker Computer Science,
Communications of the ACM,
Vol. 28,
9,
pp. 896--901,
September 1985.
-
J. L. Bentley,
Programming Pearls: Selection,
Communications of the ACM,
Vol. 28,
11,
pp. 1121--1127,
November 1985.
-
J. L. Bentley,
Programming Pearls,
Addison-Wesley,
Reading Mass.,
1986.
-
J. L. Bentley,
Programming Pearls: Cutting the Gordian Knot,
Communications of the ACM,
Vol. 29,
2,
pp. 92--96,
February 1986.
-
J. L. Bentley and J. A. Dallen,
Exercises in Software Engineering,
Proc. CMU Workshop Software Engineer. Inst.,
February 1986.
-
J. L. Bentley,
Programming Pearls: The Envelope is Back,
Communications of the ACM,
Vol. 29,
3,
pp. 176--182,
March 1986.
-
J. L. Bentley and B. W. Kernighan,
GRAP A Language for Statistical Displays,
Proc. 18th Symp. on the Interface,
pp. 63--68,
March 1986.
-
J. L. Bentley and D. D. Sleator and R. E. Tarjan and V. K. Wei,
A Locally Adaptive Data Compression Scheme,
Communications of the ACM,
Vol. 29,
4,
pp. 320--330,
April 1986.
-
J. L. Bentley and D. E. Knuth,
Programming Pearls: Literate Programming,
Communications of the ACM,
Vol. 29,
5,
pp. 364--369,
May 1986.
-
J. L. Bentley and D. E. Knuth,
Programming Pearls: Literate Programming,
rm Reprinted in: Literate Programming,
pp. 137--149,
1992.
-
J. L. Bentley and M. D. McIlroy and D. E. Knuth,
Programming Pearls: A Literate Program,
Communications of the ACM,
Vol. 29,
6,
pp. 471--483,
June 1986.
-
J. L. Bentley and M. D. McIlroy and D. E. Knuth,
Programming Pearls: A Literate Program,
rm Reprinted in: Literate Programming,
pp. 151--177,
1992.
-
J. L. Bentley,
Programming Pearls: Little Languages,
Communications of the ACM,
Vol. 29,
8,
pp. 711--721,
August 1986.
-
J. L. Bentley and B. W. Kernighan,
GRAP A Language for Typesetting Graphs,
Communications of the ACM,
Vol. 29,
8,
pp. 782--792,
August 1986.
-
J. L. Bentley,
Programming Pearls: Document Design,
Communications of the ACM,
Vol. 29,
9,
pp. 832--839,
September 1986.
-
J. L. Bentley,
Programming Pearls: Birth of a Cruncher,
Communications of the ACM,
Vol. 29,
12,
pp. 1155--1161,
December 1986.
-
J. L. Bentley and L. W. Jelinski and B. W. Kernighan,
CHEM A Program for Phototypesetting Chemical Structure Diagrams,
Computers and Chemistry,
Vol. 11,
4,
pp. 281--297,
1987.
-
J. L. Bentley and R. W. Floyd,
Programming Pearls: A Sample of Brilliance,
Communications of ACM,
Vol. 30,
9,
pp. 754--757,
September 1987.
-
J. L. Bentley,
Programming Pearls: Self-Describing Data,
Communications of ACM,
Vol. 30,
6,
pp. 479--483,
June 1987.
-
J. L. Bentley and D. Gries,
Programming Pearls: Abstract Data Types,
Communications of the ACM,
Vol. 30,
4,
pp. 284--290,
April 1987.
-
J. L. Bentley,
Programming Pearls: Profilers,
Communications of ACM,
Vol. 30,
7,
pp. 587--592,
July 1987.
-
J. L. Bentley,
Programming Pearls: The Furbelow Memorandum,
Communications of the ACM,
Vol. 30,
12,
pp. 998--999,
December 1987.
-
J. L. Bentley and B. W. Kernighan,
A System for Algorithm Animation,
USENIX Proceedings of the 4th Computer Grahics Workshop,
pp. 13--23,
October 1987.
-
J. L. Bentley and J. A. Dallen,
Exercises in Software Design,
IEEE Transactions on Software Engineering,
Vol. SE-13,
11,
pp. 1164--1169,
November 1987.
-
J. L. Bentley,
More Programming Pearls: Confessions of a Coder,
Addison-Wesley,
Reading Mass.,
1988.
-
J. L. Bentley,
dformat A Language for Typesetting Data Formats,
142,
AT&T Bell Laboratories,
Murray Hill New Jersey,
April 1988,
(142) ,
Comp. Sci. Tech. Rep. No..
-
J. L. Bentley and B. W. Kernighan,
Tools for Printing Indexes,
Electronic Publishing,
Vol. I,
1,
pp. 3--17,
April 1988.
-
J. L. Bentley,
Teaching the Tricks of the Trade,
SEI Conference on Software Engineering Education,
pp. 1--8,
April 1988.
-
J. L. Bentley,
Three Prescriptions for Productivity,
Computer Language,
Vol. 5,
6,
pp. 36--41,
June 1988.
-
J. L. Bentley and F. T. Leighton and M. Lepley and D. F. Stanat and J. M. Steele,
Probabilistic Analysis of a Randomized Data Structure for Ordered Sets,
Advances in Computing Research,
Ed. S. Micali,
Vol. 5,
pp. 413--428,
JAI Press,
1989.
-
J. L. Bentley and D. D. K. Sleator and R. E. Tarjan,
Data Compaction,
US Patent 4 796 003,
January 1989.
-
J. L. Bentley,
Little Languages for Pictures in Awk,
AT&T Technical Journal,
Vol. 68,
1,
pp. 21--32,
August 1989.
-
J. L. Bentley,
Experiments on Traveling Salesman Heuristics,
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 91--99,
January 1990.
-
J. L. Bentley and K. L. Clarkson and D. B. Levine,
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls,
Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 179--187,
January 1990.
-
J. L. Bentley,
m1: A Mini Macro Processor,
Computer Language,
Vol. 7,
6,
pp. 47--61,
June 1990.
-
J. L. Bentley,
K-d Trees for Semidynamic Point Sets,
Proceedings of the 6th Annual Symposium on Computational Geometry,
pp. 187--197,
June 1990.
-
J. L. Bentley and B. W. Kernighan,
A System for Algorithm Animation. Tutorial and User Manual,
Unix Research System Papers,
Vol. II,
pp. 451--475,
1990.
-
J. L. Bentley and B. W. Kernighan,
GRAP A Language for Typesetting Graphs. Tutorial and User Manual,
Unix Research System Papers,
Vol. II,
pp. 109--146,
1990.
-
J. L. Bentley,
Pictures of Programs,
UKUUG Summer 1990 Conference Proceedings,
pp. 127--132,
July 1990.
-
J. L. Bentley and B. W. Kernighan and C. J. Van Wyk,
An Elementary C Cost Model,
Unix Review,
Vol. 9,
2,
pp. 38--48,
February 1991.
-
J. L. Bentley and B. W. Kernighan,
A System for Algorithm Animation.,
Computing Systems,
Vol. 4,
1,
pp. 5--30,
Winter 1991.
-
J. L. Bentley,
Tools for Analysis of Algorithms,
CMU Computer Science: A 25th Anniversary Commemorative,
Ed. R. Rashid,
pp. 99--123,
ACM Press,
1991.
-
J. L. Bentley,
Software Exploratorium: The Big Squeeze,
UNIX Review,
Vol. 9,
6,
pp. 77--82,
June 1991.
-
J. L. Bentley,
Software Exploratorium: Writing Efficient C Programs,
UNIX Review,
Vol. 9,
8,
pp. 62--73,
August 1991.
-
J. L. Bentley,
Software Exploratorium: Graphs Without Grunge,
UNIX Review,
Vol. 9,
10,
pp. 89--95,
October 1991.
-
J. Bentley and B. Ewbank and R. Greer and D. Ladd and X. Qian and C. Ramming and E. Sumner and Howard Trickey,
Lessons from PRL5.0,
Proceedings of the 1991 AT&T Software Symposium,
pp. 84--95,
October 1991.
-
J. Bentley and B. Ewbank and R. Greer and C. Ramming and E. Sumner and Howard Trickey,
Consistent and Complete Software Documentation,
Proceedings of the Fourth Annual AT&T Customer Documentation Symposium,
pp. 125--130,
October 1991.
-
J. L. Bentley,
Software Exploratorium: A Little Language for Quizzes,
UNIX Review,
Vol. 9,
12,
pp. 89--95,
December 1991.
-
J. L. Bentley,
Software Exploratorium: The Trouble With Qsort,
UNIX Review,
Vol. 10,
2,
pp. 85--93,
February 1992.
-
J. L. Bentley,
Software Exploratorium: Some Random Thoughts,
UNIX Review,
Vol. 10,
6,
pp. 71--77,
June 1992.
-
J. L. Bentley,
Software Exploratorium: History Of A Heapsort,
UNIX Review,
Vol. 10,
8,
pp. 71--77,
August 1992.
-
J. L. Bentley,
Fast Algorithms for Geometric Traveling Salesman Problems,
ORSA Journal on Computing,
Vol. 4,
4,
pp. 387--411,
Fall 1992.
-
J. L. Bentley,
Software Exploratorium: A Pride of Profilers,
UNIX Review,
Vol. 10,
10,
pp. 89--98,
October 1992.
-
J. L. Bentley,
Software Exploratorium: A Pipeline Profiler,
UNIX Review,
Vol. 10,
12,
pp. 67--71,
December 1992.
-
J. L. Bentley,
Software Explorations: With Malloc Aforethought,
UNIX Review,
Vol. 11,
2,
pp. 79--83,
February 1993.
-
J. L. Bentley and K. L. Clarkson and D. B. Levine,
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls,
Algorithmica,
Vol. 9,
1,
pp. 168--183,
1993.
-
J. L. Bentley,
Software Explorations: So What s the Difference?,
UNIX Review,
Vol. 11,
4,
pp. 79--82,
April 1993.
-
J. L. Bentley,
Software Explorations: Elegance,
UNIX Review,
Vol. 11,
6,
pp. 99--103,
June 1993.
-
J. L. Bentley,
Software Explorations: Birth of a Calculator,
UNIX Review,
Vol. 11,
9,
pp. 79--90,
September 1993.
-
J. L. Bentley,
Software Explorations: Do-It-Yourself Caching,
UNIX Review,
Vol. 11,
10,
pp. 95--104,
October 1993.
-
J. L. Bentley and Maria F. Fernandez and B. W. Kernighan and N. L. Schryer,
Template-driven interfaces for numerical subroutines,
ACM TOMS,
Vol. 19,
3,
pp. 265--287,
1993.
-
J. L. Bentley,
Software Explorations: Automated Babbling,
UNIX Review,
Vol. 11,
12,
pp. 79--88,
December 1993.
-
J. L. Bentley and M. D. McIlroy,
Engineering a sort function,
Software--Practice and Experience,
Vol. 23,
1,
pp. 1249--1265,
1993.
-
J. L. Bentley,
Software Explorations: A Code-Tuning Frenzy,
UNIX Review,
Vol. 12,
3,
pp. 77--85,
March 1994.
-
J. L. Bentley,
Software Explorations: Template-Driven Programming,
UNIX Review,
Vol. 12,
4,
pp. 79--88,
April 1994.
-
J. L. Bentley,
Software Explorations: An Unknown Factor,
UNIX Review,
Vol. 12,
6,
pp. 79--86,
June 1994.
-
J. L. Bentley,
Software Explorations: A Spin Around The Block,
UNIX Review,
Vol. 12,
8,
pp. 67--74,
August 1994.
-
J. L. Bentley,
Software Explorations: Big Numbers,
UNIX Review,
Vol. 12,
11,
pp. 77--85,
November 1994.
-
J. L. Bentley,
Software Explorations: The Littlest Keyboard,
UNIX Review,
Vol. 12,
12,
pp. 65--69,
December 1994.
-
J. L. Bentley,
Software Explorations: Squeezing Engl Txt,
UNIX Review,
Vol. 13,
2,
pp. 61--71,
February 1995.
-
J. L. Bentley,
Software Explorations: A Megabyte Here A Megabyte There,
UNIX Review,
Vol. 13,
4,
pp. 85--91,
April 1995.
-
J. L. Bentley,
Software Explorations: GUI Lessons From Languages,
UNIX Review,
Vol. 13,
6,
pp. 63--66,
June 1995.
-
J. L. Bentley,
Software Explorations: Wrapping Files,
UNIX Review,
Vol. 13,
8,
pp. 75--79,
August 1995.
-
J. L. Bentley,
Software Explorations: A Little Security Problem,
UNIX Review,
Vol. 13,
10,
pp. 111--117,
October 1995.
-
J. L. Bentley,
Software Explorations: Recursion and Its Antidotes,
UNIX Review,
Vol. 13,
12,
pp. 91--96,
December 1995.
-
J. L. Bentley,
Software Explorations: Searching Text,
UNIX Review,
Vol. 14,
4,
pp. 83--90,
April 1996.
-
J. L. Bentley,
Software Explorations: Counting Caching and C,
UNIX Review,
Vol. 14,
6,
pp. 63--67,
June 1996.
-
J. L. Bentley,
Software Explorations: A Network-Design Algorithm,
UNIX Review,
Vol. 14,
10,
pp. 89--95,
October 1996.
-
J. L. Bentley,
Software Explorations: The Impossible Takes a Little Longer,
UNIX Review,
Vol. 14,
12,
pp. 75--79,
December 1996.
-
Jon L. Bentley and Robert Sedgewick,
Fast Algorithms for Sorting and Searching Strings,
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 360--369,
January 1997.
-
J. L. Bentley,
Software Explorations: Cost Models for Sorting,
UNIX Review,
Vol. 15,
4,
pp. 65--72,
April 1997.
-
J. L. Bentley and S. B. Goldman and M. J. Foladare and N. L. Schryer and D. P. Silverman and R. P. Weber,
System and method for controlling and monitoring communication between customers and customer service representatives,
European Patent 97106179.1-2209,
June 1997.
-
J. L. Bentley,
Software Explorations: Faster and Faster and Faster Yet,
UNIX Review,
Vol. 15,
6,
pp. 59--67,
June 1997.
-
J. L. Bentley,
Software Explorations: Working With The System,
UNIX Review,
Vol. 15,
10,
pp. 71--78,
Ocotber 1997.
-
J. L. Bentley,
Software Explorations: Common Strings,
UNIX Review,
Vol. 15,
12,
pp. XXX--XXX,
December 1997.
Go to the Computing Sciences
Research Center home page.
Modified: October 17, 1997.
Copyright © 1997
Lucent Technologies. All rights reserved.