Selected Papers

The papers here are formatted as compressed PostScript and the files have the suffix .ps.gz. They are compressed to spare your bandwidth, and are in PostScript because that's what we were able to collect. To read them you need a version of GNU gunzip and a PostScript printer or a screen-display utility for PostScript. On Unix-style systems these are relatively common. They won't read directly into many of today's Windows or Mac browsers. A nearby article on Netlib compression suggests how to proceed if your Netscape or Internet Explorer are clueless about compressed PostScript.

If you're looking for a particular paper, you might also try searching Netlib, or in the bibliographies or home pages of individual Bell Labs authors.

An index of those papers having to do with numerical mathematics, supplemented with brief abstracts, is available here.

• Rob Pike, Graphics in Overlapping Bitmap Layers, 83/1-a.ps.gz
• Rob Pike, The Blit: A Multiplexed Graphics Terminal, 83/mpx.ps.gz
• N. L. Schryer, POST - A Package for Solving Partial Differential Equations in One Space Variable, 84/4-1.ps.gz
• R. Pike and B.W. Kernighan, Program Design in the UNIX Environment (Derived from the talk by Rob Pike, ``Cat -v considered harmful'') 84/kp.ps.gz
• Rob Pike and P.J. Weinberger, The hideous name, 85/1-05.ps.gz
• Rob Pike and Dave Presotto, Face the Nation, 85/face.ps.gz
• Eric Grosse, Colors for Level Plots, 85/4-01.ps.gz
• Eric Grosse, Colors for Level Plots, 85/4-01hue.ps.gz
• Baker, Grosse, Rafferty, Non-Obtuse Triangulation of Polygons, 85/nonobtuse.pdf
• John D. Hobby, Smoothing Digitized Contours, 86/2-20.ps.gz [cf. in Theoretical Foundations of Computer Graphics and CAD, Springer Verlag, 1988]
• Rob Pike, Bart Locanthi, and John Reiser, Hardware/Software Tradeoffs for Bitmap Graphics on the Blit, 83/archtr.ps.gz
• Rob Pike, The text editor sam, 87/1-05.ps.gz
• John D. Hobby, Rasterizing Curves of Constant Width, 87/2-04.ps.gz [cf. JACM 36(2), 209-229, 1989]
• Rob Pike, Structural Regular Expressions 87/3-se.ps.gz
• Rob Pike, Newsqueak: A language for communicating with mice, 88/1-05.ps.gz
• Rob Pike, Window Systems Should Be Transparent, 88/1-07.ps.gz
• Rob Pike, The implementation of Newsqueak, 88/1-a.ps.gz
• John D. Hobby, Numerically Stable Implicitization of Cubic Curves, 88/2-11.ps.gz [cf. ACM Trans. on Graph., 10(3), 255-296, 1991]
• John D. Hobby, Rasterization of Nonparametric Curves, 88/2-a.ps.gz [cf. ACM Trans. on Graph., 9(3), 262-277, 1990]
• Rob Pike, A Concurrent Window System, 89/1-a.ps.gz
• John D. Hobby, A METAFONT-like System with PostScript Output, 89/2-15.ps.gz [cf. TUGboat 10(4), 505-512, 1989]
• John D. Hobby, Generating Automatically Tuned Bitmaps from Outlines, 89/2-17.ps.gz [cf. JACM 40(1), 48-94, 1993]
• David M. Gay, Correctly Rounded Binary-Decimal and Decimal-Binary Conversions, 90/4-10.ps.gz
• David M. Gay and Linda Kaufman, Tradeoffs in Algorithms for Separable Nonlinear Least Squares, 90/4-11.ps.gz
• S. Keshav, Implementing Stop-and-Go using Hierarchical Round Robin Service, 91/2-15.ps.gz
• Cleveland and Grosse, Computational Methods for Local Regression, 91/4-04.ps.gz [cf. Statistics and Computing, 1991, 1:1, 47-62]
• David M. Gay, "Automatic Differentiation of Nonlinear AMPL Models", 22 Aug. 1991., 91/4-05.ps.gz
• Robert Fourer and David M. Gay, "Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming", 30 May 1991., 91/4-06.ps.gz
• Coughran and Grosse, Seeing and Hearing Dynamic Loess Surfaces, 91/4-07.ps.gz [cf. Interface'91 Proceedings, 1991, Springer]
• version of 91-07 which includes figure, , 91/4-07long.ps.gz
• Grosse, How Shall We Connect Our Software Tools, 91/4-08.ps.gz [cf. Visualization'91 Proceedings, IEEE Computer Society Press, 1991]
• Coughran and Grosse, Display of Functions of Three Space Variables and Time Using Shaded Polygons and Sound, 91/4-09.ps.gz [cf. IFIP, Prog Envir for High-Level Sci Problem Solving, Karlsruhe, 1991]
• Wright, Margaret H., Interior Methods for Constrained Optimization,, 91/4-10.ps.gz [cf. in Acta Numerica 1992 (A. Iserles, ed.), Cambridge University Press, New York, 341-407.]
• Feigenbaum, Grosse, Reeds, Cryptographic Protection of Membership Lists, 91/4-12.ps.gz [cf. IACR Newsletter, 1992, 9:1, 16-20]
• Rob Pike, Dave Presotto, Ken Thompson, Howard Trickey, Phil Winterbottom, The Use of Name Spaces in Plan 9, 92/1-07.ps.gz
• D. M. Ritchie, Development of the C Language, 92/1-13.ps.gz [cf. HOPL-II]
• A. Banerjea and S. Keshav, Queueing Delays in Rate-Controlled Networks, 92/2-02.ps.gz [cf. Proc. Infocom'93]
• S. Keshav, Flow Control in High-Speed Networks with Long Delays, 92/2-04.ps.gz [cf. Proceedings of INET '92]
• S. Keshav, Report on `Workshop on Quality of Service Issues in High Speed Networks', 92/2-23.ps.gz [cf. ACM SIGCOMM Computer Communication Review. Oct 1992]
• John D. Hobby, Introduction to MetaPost, 92/2-21.ps.gz [cf. EuroTeX '92 Proceedings]
• Jon Bentley, Mary Fernandez, Brian Kernighan, Norm Schryer, Template Driven Interfaces for Numerical Subroutines, 92/2-26.ps.gz [cf. TOMS 19,265-287]
• John D. Hobby, Polygonal Approximations that Minimize the Number of Inflections, 92/2-28.ps.gz [cf. Proc. of the 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993]
• H. Kanakia, S. Keshav and P. Mishra, A Benchmark Suite for Comparing Congestion Control Schemes, 92/3-12.ps.gz [cf. unpublished]
• T.E. Jeremiassen and S.J. Eggers, Computing Per-Process Summary Side-Effect Information, 92/3-tor1.ps.gz [cf. Fifth Workshop on Languages and Compilers for Parallelism, 1992]
• Murray, Walter and Wright, Margaret H., Line Search Procedures for the Logarithmic Barrier Function,, 92/4-01.ps.gz [cf. SIAM Journal on Optimization]
• Wright, Margaret H., Determining subspace information from the Hessian of a barrier function, 92/4-02.ps.gz
• Freund, R. W. and Nachtigal, N. M., An Implementation of the {QMR} Method Based on Coupled Two-Term Recurrences, 92/4-06.ps.gz
• Freund, R. W., Transpose-Free Quasi-Minimal Residual Methods for Non-{H}ermitian Linear Systems, 92/4-07.ps.gz
• Freund, Roland W. and Zha, Hongyuan, Formally Biorthogonal Polynomials and a Look-Ahead {L}evinson Algorithm for General {T}oeplitz Systems, 92/4-08.ps.gz
• Freund, R. W. and Nachtigal, N. M., Implementation Details of the Coupled {QMR} Algorithm, 92/4-12.ps.gz
• Freund, R. W., Solution of Shifted Linear Systems by Quasi-Minimal Residual Iterations, 92/4-13.ps.gz
• J.J. Ordille and B.P. Miller, Lost i a Labyrinth of Workstations, 92/4-15.ps.gz
• Brenda S. Baker, A Program for Identifying Duplicated Code, 92/2-bsb-1.ps.gz [cf. Interface'92 proceedings]
• Roland W. Freund, The Look-ahead Lanczos Process for Large Nonsymmetric Matrices and Related Algorithms, 92/4-14.ps.gz
• Eric Grosse and Bill Coughran, Pine, a C preprocessor for Arrays, 92/pine-cover.ps.gz, 92/pine.ps.gz
• Rob Pike, Acme: A User Interface for Programmers, 93/1-03.ps.gz
• Brenda S. Baker, On Finding Duplication in Strings and Software, 93/2-bsb-1.ps.gz
• Brenda S. Baker, A Theory of Parameterized Pattern Matching: Algorithms and Applications (Extended Abstract), 93/2-bsb-2.ps.gz [cf. Proc. 25th ACM Symposium on Theory of Computing, 1993]
• John D. Hobby, Practical Segment Intersection with Finite Precision Output, 93/2-27.ps.gz
• Wright, Margaret H., Some Linear Algebra Issues in Large-Scale Optimization, 93/4-01.ps.gz
• Wright, Margaret H., Why a pure primal {N}ewton barrier step may be infeasible, 93/4-02.ps.gz
• Freund, R. W. and Jarre, F., An Interior-Point Method for Convex Fractional Programming, 93/4-03.ps.gz
• Eric Grosse, Repository Mirroring, 93/4-04.ps.gz [cf. TOMS, 1994, accepted]
• E. H. Grosse, Approximation in VLSI Simulation, 93/4-05.ps.gz [cf. Numerical Algorithms, 1993, 5:591-601]
• Fourer, Robert and Gay, David M., Experience with a Primal Presolve Algorithm, 93/4-06.ps.gz
• Freund, R. W. and Jarre, F., An Interior-Point Method for Multi-Fractional Programs with Convex Constraints, 93/4-07.ps.gz
• Freund, R. W. and Jarre, F., A Polynomial-Time Algorithm for Fractional Programs with Convex Constraints, 93/4-08.ps.gz
• Freund, R. W., A Look-Ahead Schur-Type Algorithm for Solving General Toeplitz Systems, 93/4-09.ps.gz
• Gay, David M., Hooking Your Solver to AMPL, 93/4-10.ps.gz
• Freund, R. W., A Look-Ahead Bareiss Algorithm for General Toeplitz Matrices, 93/4-11.ps.gz
• Pommerell, Claude and Ruehl, Roland, Compiler Assisted Distributed Memory Parallelization of an Iterative Solver for Irregular Sparse Linear Systems, 93/4-12.ps.gz
• Eric Grosse and John D. Hobby, Improved Rounding for Spline Coefficients and Knots, revised Jul 93, 93/4-13.ps.gz
• J.J. Ordille and B.P. Miller, Distributed Active Catalogs and Meta-Data Caching in Descriptive Name Services, 93/5-01.ps.gz
• J.J. Ordille and B.P. Miller, Database Challenges in Global Information Systems, 93/5-02.ps.gz
• Holzmann, G.J., Data Communications: The First 2500 Years, 94/1-02.ps.gz [cf. Proc. IFIP World Congress, Hamburg, Germany, 1994]
• Holzmann, G.J., The Theory and Practice of a Formal Method: NewCoRe, 94/1-03.ps.gz [cf. Proc. IFIP World Congress, Hamburg, Germany, 1994]
• S. Keshav, Experience with Large Videoconferences in Xunet 2, 94/2-05.ps.gz [cf. Proc. INET 94]
• R. Sharma and S. Keshav, Signaling and Operating System Support for Native-Mode ATM Applications, 94/2-06.ps.gz [cf. Proc. SIGCOMM 94]
• (H. Saran`,' S. Keshav and C.R. Kalmanek , A Scheduling Discipline and Admission Control Policy for Xunet 2, 94/2-07.ps.gz [cf. Proc. NOSSDAV '93]
• S. Keshav and H. Saran, Semantics and Implementation of a Native-Mode ATM Protocol Stack, 94/2-14.ps.gz
• Hobby, J. D., A Natural Lattice Basis Problem with Applications, 94/2-15.ps.gz
• S. Keshav `,' C. Lund`,' S. Phillips`,' N. Reingold and H. Saran, An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-over - ATM Networks, 94/2-16.ps.gz [cf. IEEE Journal on Selected Areas in Communication]
• S. Keshav , Packet-Pair Flow Control, 94/2-17.ps.gz [cf. Submitted to IEEE/ACM Trans. on Networking]
• J. D. Hobby, Space-Efficient Outlines from Image Data via Vertex Minimization and Grid Constraints, 94/2-30.ps.gz
• Brenda S. Baker, Parameterized Pattern Matching: Algorithms and Applications, 94/2-bsb-1.ps.gz [cf. to appear in J. Comput. Syst. Sci.]
• T.E. Jeremiassen and S.J. Eggers, Static Analysis of Barrier Synchronization in Explicitly Parallel Programs, 94/4-tor2.ps.gz [cf. International Conference on Parallel Architectures and Compilation Techniques]
• Feldmann, P. and Freund, R. W., Efficient Linear Circuit Analysis by Pade approximation via the Lanczos process, 94/4-01.ps.gz [cf. Proceedings of EURO-DAC '94 with EURO-VHDL '94, 1994]
• Bjorstad, Coughran, Grosse, Parallel Domain Decomposition Applied to Coupled Transport Equations, 94/4-03.ps.gz [cf. 7th Int. Conf. on Domain Decomposition Methods in Scientific and Engineering Computing (American Mathematical Society)]
• Fischer, B. and Freund, R. W., An Inner Product-Free Conjugate Gradient-Like Algorithm for Hermitian Positive Definite Systems, 94/4-04.ps.gz [cf. Proceedings of the Lanczos Centenary Conference]
• Freund, R. W., Lanczos-Type Algorithms for Structured Non-Hermitian Eigenvalue Problems, 94/4-05.ps.gz [cf. Proceedings of the Lanczos Centenary Conference]
• Freund, R. W., The Look-Ahead Lanczos Process for Nonsymmetric Matrices and its Applications, 94/4-06.ps.gz [cf. Proceedings of the Lanczos Centenary Conference]
• Freund, R. W. and Nachtigal, N. M., A New Krylov-Subspace Method for Symmetric Indefinite Linear Systems, 94/4-07.ps.gz [cf. Proceedings of the 14th IMACS World Congress]
• Freund, R. W. and Nachtigal, N. M., QMRPACK and Applications, 94/4-08.ps.gz [cf. Proceedings of the 14th IMACS World Congress]
• Freund, R. W. and Feldmann, P., Efficient Small-Signal Circuit Analysis and Sensitivity Computations with the PVL Algorithm, 94/4-09.ps.gz [cf. Technical Digest of the 1994 IEEE/ACM International Conference on Computer-Aided Design]
• Baldwin, C., Freund, R. W., and Gallopoulos, E., A Parallel Iterative Method for Exponential Propagation, 94/4-10.ps.gz [cf. Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing]
• Feldmann, P. and Freund, R. W., Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm, 94/4-11.ps.gz [cf. Proceedings of the 32nd Design Automation Conference, 1995]
• Linda Kaufman, Solving Some Structured Linear Least-Squares Problems, 94/4-12.ps.gz [cf. Proceedings of the SIAM Conference on Applied Linear Algebra, Snowbird, Utah 1994]
• Linda Kaufman and Arnold Neumaier, Image Reconstruction Through Regularization by Envelope Guided Conjugate Gradients, 94/4-14.ps.gz
• Shirley Browne, Jack Dongarra, Eric Grosse, Stan Green, Keith Moore, Tom Rowan, and Reed Wade, Netlib Services and Resources, 94/4-15.ps.gz
• Freund, R. W. and Nachtigal, N. M., QMRPACK: a Package of QMR Algorithms, 94/4-16.ps.gz [cf. To appear in ACM Transactions on Mathematical Software]
• Freund, R. W., Jarre, F., and Schaible, S., On Interior-Point Methods for Fractional Programs and Their Convex Reformulation, 94/4-17.ps.gz [cf. A short version of this paper will appear in Math. Programming]
• Freund, R. W. and Jarre, F., A QMR-Based Interior-Point Algorithm for Solving Linear Programs, 94/4-19.ps.gz [cf. To appear in Math. Programming, Ser. B]
• Joann Ordille, Nomenclator: Descriptive Directory Services for Large, Heterogeneous Networks [slide show], 94/ids_slides.ps.gz
• M. Grossglauser and S. Keshav, On CBR Service, 95/2-02.ps.gz
• M. Grossglauser, S. Keshav and D. Tse, RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic, 95/2-03.ps.gz [cf. Proc. Sigcomm 95]
• Brenda S. Baker, Parameterized Pattern Matching by Boyer-Moore Type Algorithms, 95/2-bsb-1.ps.gz [cf. Proc. Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995]
• Brenda S. Baker and Edward G. Coffman, Jr., Mutual Exclusion Scheduling, 95/2-bsb-2.ps.gz
• Brenda S. Baker, On Finding Duplication and Near-Duplication in Large Software Systems, 95/2-bsb-3.ps.gz [cf. Proc. 2nd IEEE Working Conference on Reverse Engineering, July, 1995]
• Brenda S. Baker, Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance, 95/2-bsb-4.ps.gz
• Brenda S. Baker and Eric Grosse, Local Control over Filtered WWW Access, 95/2-bsb-5.ps.gz [cf. Proc. Fourth International WWW Conference, December 1995]
• J.J. Ordille, Information Gathering and Distribution in Nomenclator, 95/3-01.ps.gz
• T.E. Jeremiassen, Using Compile-Time Analysis and Transformation to Reduce False Sharing on Shared-Memory Multiprocessors, 95/3-tor3.ps.gz [cf. Ph.D. dissertation, University of Washington]
• T.E. Jeremiassen and S.J. Eggers, Reducing False Sharing on Shared Memory Multiprocessors through Compile Time Data Transformations, 95/3-tor4.ps.gz [cf. 7th ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming]
• R. W. Freund and N. M. Nachtigal, Software for Simplified Lanczos and QMR Algorithms, 95/4-02.ps.gz [cf. Applied Numerical Mathematics, Vol. 19, 1995, pp. 319-341]
• R. W. Freund, Computation of Matrix Pade Approximations of Transfer Functions Via a Lanczos-Type Process, 95/4-03.ps.gz [cf. Approximation Theory VIII, Vol.1: Approximation and Interpolation, (C. K. Chui and L. L. Schumaker, eds.), World Scientific Publishing Co., 1995]
• R. W. Freund and Peter Feldmann, Small-Signal Circuit Analysis and Sensitivity Computations with the PVL Algorithm, 95/4-04.ps.gz [cf. To appear in IEEE Transactions on Circuits and and Systems-II: Analog and Digital Signal Processing]
• Alon Y. Levy and Joann J. Ordille, An Experiment in Integrating Internet Information Sources, 95/11-01.ps.gz [cf. 1995 AAAI Fall Symposium on AI Applications in Knowledge Navigation and Retrieval]
• J. D. Hobby and H. S. Baird, Degraded Character Image Restoration, 96/4-04.ps.gz
• M. Malhotra, R. W. Freund, and P. M. Pinsky, Iterative solution of multiple radiation and scattering problems in structural acoustics using a block quasi-minimal residual algorithm, 96/4-11.ps.gz
• J. D. Hobby, Space-Efficient Outlines from Image Data via Vertex Minimization and Grid Constraints, 96/4-12.ps.gz
• R. W. Freund and P. Feldmann, Reduced-Order Modeling of Large Passive Linear Circuits by Means of the SyPVL Algorithm, 96/4-13.ps.gz
• J. J. Ordille, When agents roam, who can you trust?, 96/5-09.ps.gz
• A. Y. Levy, A. Rajaraman and J. J. Ordille, Query Answering Algorithms for Information Agents, 96/8-06.ps.gz
• A. Y. Levy, A. Rajaraman and J. J. Ordille, Querying Heterogeneous Information Sources Using Source Descriptions, 96/9-03.ps.gz
• J. J. Ordille, Internet Nomenclator Project, 96/9-24.txt
• L. O'Gorman and J. D. Hobby, Adaptive and Outline-Based Subsampling of Images Containing Text and Binay Graphics, 96/4-14.ps.gz
• R. W. Freund, F. Jarre, and S. Mizuno, Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs, 96/4-16.ps.gz
• J. I. Aliaga, D. L. Boley, R. W. Freund, and V. Hernandez, A Lanczos-Type Method for Multiple Starting Vectors, 96/4-18.ps.gz
• R. W. Freund, Circuit Simulation Techniques Based on Lanczos-Type Algorithms, 96/4-19.ps.gz
• A. Benvenuti, W. M. Coughran, Jr., and M. R. Pinto, A Thermal-Fully Hydrodynamic Model for Semiconductor Devices and Applications to III-V HBT Simulation, 96/0-1.ps.gz
• John D. Hobby, Matching Document Images with Ground Truth, 96/4-22.ps.gz