4. IFIP Congress 1968, Volume 1: Edinburgh, UK

A. J. H. Morrell (Ed.): Information Processing 68, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1 - Mathematics, Software.

Part 1 - Mathematics

Invited Papers

Ivo Babuska: Numerical stability in mathematical analysis. 11-23
Max E. Engeli: Achievements and problems in formula manipulation. 24-32
D. K. Faddeev, V. N. Faddeeva: Stability in linear algebra problems. 33-39
T. E. Hull: The numerical integration of ordinary differential equations. 40-53
Karl Nickel: Error-bounds and computer arithmetic. 54-62
John Alan Robinson: New directions in mechanical theorem proving. 63-69
J. Barkley Rosser, J. M. Yohe, Lowell Schoenfeld: Rigorous computation and the zeros of the Riemann zeta-function. 70-76
A. A. Samarskiy: The constructive theory of stability of difference schemes. 77-79
S. V. Yablonski: A survey of some results in the field of discrete mathematics. 80-85

Approximation

C. Carasso, P. J. Laurent: On the numerical construction and the practical use of interpolating spline-functions. 86-89
Gregory G. Menshikov: Problems of binary representation of functions. 90-94
M. J. D. Powell: A comparison of spline approximations with classical interpolation methods. 95-98
Eugene L. Wachspress: Solution of the generalized ADI minimax problem. 99-105
H. K. E. Werner: Starting procedures for the iterative calculation of rational Tschebyscheff approximations. 106-110

Linear Algebra

Alan J. Hoffman: Bounds for the rank and eigenvalues of a matrix. 111-113
Beresford N. Parlett, William Kahan: On the convergence of a practical QR algorithm. 114-118
Victor Pereyra: Stabilizing linear least squares problems. 119-121
M. J. D. Powell, J. K. Reid: On applying Householder transformations to linear least squares problems. 122-126
A. van der Sluis: Equilibration and pivoting in linear algebraic systems. 127-129
James Hardy Wilkinson: Global convergence of QR algorithm. 130-133

Numerical Analysis

Yasuhiko Ikebe, M. Stuart Lynn, William P. Timlake: The numerical solution of the integral equation formulation of the Neumann problem. 134-137
Jozef Miklosko: Numerical integration with highly oscillating weight functions. 138-144
David M. Young, Alvis E. McDonald: On the surveillance and control of number range and accuracy in numerical computation. 145-152

Partial Differential Equations

Paul Concus: Numerical solution of the minimal surface equation by block nonlinear successive overrelaxation. 153-158
J. F. Croce-Spinelli: A method for identification problems in partial differential equations. 159-163
J. C. Mason: Chebyshev methods for separable partial differential equations. 164-169
Robert Vichnevetsky: Application of hybrid computers to the integration of partial differential equations of the first and second order. 170-178
M. Zlámal: On mildly nonlinear elliptic boundary value problems. 179-182

Ordinary Differential Equations

Germund Dahlquist: A numerical method for some ordinary differential equations with large Lipschitz constants. 183-186
C. William Gear: The automatic integration of stiff ordinary differential equations. 187-193
Fred T. Krogh: A variable-step, variable-order multistep method for the numerical solution of ordinary differential equations. 194-199
Michael R. Osborne: A new method for the integration of stiff systems of ordinary differential equations. 200-204

Discrete Mathematics

E. F. Assmus Jr., H. F. Mattson Jr.: Some (3 p, p) codes. 205-209
A. Roger Meetham: Partial isomorphisms in graphs and structural similarities in tree-like organic molecules. 210-213
E. Pichat: Algorithms for finding the maximal elements of a finite universal algebra. 214-218
Norman J. Pullman, John W. Moon: Tournaments and handicaps. 219-223
Miguel Sánchez-Mazas: Preliminary ideas concerning an automatic computation of "qualities". 224-230

Mathematical Programming

P. Cazottes, M. Oden: Engines and trains: a sophisticated assignment problem. 231-237
Monique Guignard, Kurt Spielberg: Search techniques with adaptive features for certain integer and mixed integer programming problems. 238-244
P. Kalfon, G. Ribiere, J. C. Sogno: A method of feasible directions using projection operators. 245-248
Pavel Kovanic: Optimum digital operators. 249-255

Theory of Computation

Harvey L. Garner: The classification of finite number systems. 256-259
Sheila A. Greibach, John E. Hopcroft: Scattered context grammars. 260-264
Jozef Gruska: Unambiguity and ambiguity of context-free grammars and languages. 265-268
Bruce Kallick: A decision procedure based on the resolution method. 269-275
Shmuel Winograd: The number of multiplications involved in computing certain functions. 276-279

Automata Theory

A. M. Bogomolov, V. A. Tverdokhlebov: Conditions for the existence of diagnostic tests for complex systems. 280-282
Wayne A. Davis: Linear realizations for permutation machines. 283-289
Giuseppe Fantauzzi: A semigroup theory for the Maitra cascade. 290-299
Lawrence H. Landweber: Synthesis algorithms for sequential machines. 300-304
Fernand R. Lapscher: Decomposition of Boolean functions. Properties relative to the intermediate function. 305-307
Bernd Reusch: Linear and partial-linear realization of automata. 308-311

Part 2 - Software

Invited Papers

Fernando J. Corbató, Jerome H. Saltzer: Some considerations of supervisor program design for multiplexed computer systems. 315-321
C. A. R. Hoare: Data structures in two-level store. 322-329
S. Michaelson: How to succeed in software. 330-333
W. L. van der Poel: The software crisis, some thoughts and outlooks. 334-339

Special Topics in Compilers

Jean-Loup Baer, Daniel P. Bovet: Compilation of arithmetic expressions for parallel computations. 340-346
Jan V. Garwick: The GPL compiler. 347-350
Vadim E. Kotov, A. S. Narinyani: On transformation of sequential programs into asynchronous parallel programs. 351-357

Compiler Techniques

Gary Y. Breitbard, Gio Wiederhold: The ACME compiler. 358-365
Eric Foxley, P. R. King: A meta-semantic language for use with a top-down syntax analyser. 366-372
T. R. McKinnon Wood: A multi-access implementation of an interpretive text processing language. 373-377
R. B. E. Napper: The need to revise the Compiler Compiler. 378-383
M. Peccoud, M. Griffiths, M. Peltier: Incremental interactive compilation. 384-387
Gordon Whitney: The generation and recognition properties of table languages. 388-394

Techniques in Commercial Programming

P. S. T. Buckerfield: A technique for the construction and use of a generalized information table. 395-403
R. Erskine: Exception programming - the model concept. 404-409
M. E. E. Warren: Program generation by questionnaire. 410-413
A. H. Wright: The management of applications programming. 414-419

Formal Languages and Definitions

D. L. Childs: Feasibility of a set-theoretic data structure. A general structure based on a reconstituted definition of relation. 420-430
G. Del Nero: An approach to the formal description of the LAMBDA system. 431-436
Timothy V. Griffiths, Stanley R. Petrick: Top-down versus bottom-up analysis. 437-443
Reino Kurki-Suonio: Formal description of input data. 444-447
William C. Lynch, H. L. Pierson: A finite state transducer model for compiler lexical scanners. 448-455
John C. Reynolds: Automatic computation of data set definitions. 456-461

Application Languages

Carl Engelmann: MATHLAB 68. 462-467
William P. Harris, Peter B. Hill: The Reckoner and the Mediator: a consumer-oriented on-line system. 468-473
Anne Hohler: The MOBULA feature. 474-478
C. Hucl: LOGOL and its application to computer development. 479-483

Designs of Software

Jack B. Dennis: Programming generality, parallelism and computer architecture. 484-492
Ted A. Dolotta, C. A. Irvine: Proposal for a time sharing Command Structure. 493-498
Jack L. Rosenfeld, Graham C. Driscoll: Solution of the Dirichlet problem on a simulated parallel processing system. 499-507
G. G. Scarrott, J. K. Iliffe: The Basic Languge Project. 508-513
Michael E. Senko, Vincent Y. Lum, Philip J. Owens: A file organization evaluation model (FOREM). 514-519

Operating System Implementation

Robert W. Bemer, A. L. Ellison: Software instrumentation systems for optimum performance. 520-524
P. D. Jones: Operating system structures. 525-530
Peter C. Poole: Some aspects of the EGDON 3 operating system for the KDF9. 531-535
J. Standeven, K. F. Bowden, David B. G. Edwards: An operating system for a small computer providing time-shard data collection, computing and control functions. 536-541
David F. Stevens: System evaluation on the Control Data 6600. 542-547
Brian A. Wichmann: A modular operating system. 548-556

Data Structure Manipulation Languages

David Evans, Andries van Dam: Data Structure Programming System. 557-564
J. M. Noble: The control of exceptional conditions in PL/1 object programs. 565-571
T. William Olle: UL/1: a non-procedural language for retrieving information from data bases. 572-578
Paul Rovner, Jerome A. Feldman: The LEAP language and data structure. 579-585

Picture Processing

M. I. Bernstein, T. G. Williams: A two-dimensional programming system. 586-592
John J. Donovan, M. M. Jones, J. W. Alsop: A graphical facility for an interactive simulation system. 593-596
Leslie Mezei: SPARTA, a procedure oriented programming language for the manipulation of arbitrary line drawings. 597-604
J. Nolan, Lynn Yarbrough: An on-line computer drawing and animation system. 605-610

Last update Fri May 25 08:22:07 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page