URL for the World Wide Web:
From: Hans Schneider <email@example.com>
Date: Sun, 11 May 1997 13:02:17 -0500 (CDT)
Subject: Special Issue of LAA Honoring Ludwig Elsner
Special issue of Linear Algebra and its Applications honoring Ludwig Elsner
In view of his major contributions to linear algebra and to this journal,
`Linear Algebra and its Application' will publish a special issue in honor
of Ludwig Elsner to mark the occasion of his 60th birthday on January 17,
The purpose of this announcement is to solicit contributions for this
issue. The deadline for submission is December 31, 1997 and the issue is
expected to appear in the first part of 1999.
Papers are invited covering any aspect of linear algebra and its
applications. All contributions will be subject to the normal reviewing
Submissions should be sent to one of the special editors for this issue:
Indian Statistical Institute
7, S.J.S Sansanwal Marg
New Dehli, 110016 India
Fachbereich Mathematik und Informatik
D-28334 Bremen, Germany
Fakult. f. Mathematik,
D-09107 Chemnitz, Germany
(until Aug. 31 1997, Dept. of Comp. Science,
Univ. of Victoria, Victoria BC, Canada V8W 3P6)
Dept. of Comp. Science,
Univ. of Victoria,
Victoria BC, Canada V8W 3P6
From: Dave Fournier <firstname.lastname@example.org>
Date: Mon, 12 May 1997 06:54:19 -0700
Subject: AD Model Builder
Otter research Ltd would like to announce the release of version 2.0
of AD Model Builder, a package for building nonlinear statistical
models. AD Model Builder employs a template-like approach for model
specification which produces C++ code. To date AD Model Builder has
been employued mostly for nonlinear statistical model in natural
resource management, but we feel it should also be of great use in any
area where nonlinear statistical modelling is employed.
Version 2.0 incorporates additional tools for interpreting the results
of Bayesian analysis especially Markov chain simulation for obtaning
estimates of the posterior distribution of parameters of interst.
Information about AD Model Builder with examples and documentation can
be found at our web site, island.net/~otter.
David A. Fournier
Otter Research Ltd.
PO Box 265, Station A
Nanaimo, B.C. V9R 5K9
voice/fax (250) 756-0956
From: Nick Trefethen <lnt@CS.Cornell.EDU>
Date: Sun, 11 May 1997 10:43:22 -0400 (EDT)
Subject: New Book on Numerical Linear Algebra
We are happy to announce that our textbook "Numerical Linear Algebra"
is now available from SIAM. The book is organized into forty
seven-page lectures and includes an 80-page introduction to Krylov
subspace matrix iterations as well as a number of unusual features.
The price is $34.50, or $27.60 for SIAM members.
Nick Trefethen, Cornell U. (http://www.cs.cornell.edu/home/lnt)
David Bau, Microsoft Corp. (email@example.com)
SIAM: 3600 University City Science Center, Philadelphia, PA 19104-2688
tel 215-382-9800, fax 215-386-7999, firstname.lastname@example.org, http://www.siam.org
From: Jean-Michel Muller <Jean-Michel.Muller@ens-lyon.fr>
Date: Mon, 12 May 1997 08:39:59 +0200 (MET DST)
Subject: New Book on Elementary Functions
This is to announce the imminent outcome of my book, "Elementary functions,
algorithms and Implementation", published by Birkhauser Boston.
Birkhauser's web page for the book is:
it includes a description of the book, ordering information,
and will include additional resources and selected code.
My own web page for the book is:
Jean-Michel Muller, CNRS, Lab. LIP, Ecole Normale Superieure de Lyon
46 Allee d'Italie, 69364 Lyon Cedex 07, FRANCE.
Tel. +33 4 72 72 82 29 Fax. +33 4 72 72 80 80 from abroad
04 72 72 82 29 04 72 72 80 80 from France
http://www.ens-lyon.fr/~jmmuller email: email@example.com
From: Eugene E. Tyrtyshnikov <firstname.lastname@example.org>
Date: Thu, 15 May 1997 19:17:52 +0400 (????)
Subject: A Brief Intro to Numerical Analysis
I have written a new book that might be interesting
for the numerical analysis people:
Eugene E. Tyrtyshnikov.
A Brief Introduction to Numerical Analysis.
Birkhauser, Boston, 1997.
I feel myself that it is a bit more than one could expect
from a brief introduction of 200 pages.
To better understand my motives,
I want to give you just a few words from the preface:
"Without any doubt, there are many quite good and
excellent books on the subject. But I know definitely
that I did not realize this when I was a student.
In this book, my first desire was to present those lectures
that I wished I would have heard when I was a student."
The book is for advanced students who study mathematics,
certainly for those who teach them, and it contains also
a lot of recent results and may be useful for specialists.
It is now available from Birkhauser.
Institute of Numerical Mathematics
Russian Academy of Sciences
Ul. Gubkina 8, Moscow 117333, Russia
FAX: +7 (095) 938-1821
From: Geert Uytterhoeven <Geert.Uytterhoeven@cs.kuleuven.ac.be>
Date: Fri, 16 May 1997 11:02:11 +0200 (MET DST)
Subject: Wavelet Transform Software Library Available
This announces the availability of a Wavelet Transform Library written in C++.
WAILI -- Wavelets with Integer Lifting
WAILI is a wavelet transform library. It includes some basic image
processing operations based on the use of wavelets and forms the
backbone of more complex image processing operations.
* Uses integer wavelet transforms based on the Lifting Scheme
* Provides various wavelet transforms of the
Cohen-Daubechies-Feauveau family of biorthogonal wavelets
* Provides crop and merge operations on wavelet-transformed images
* Provides noise reduction based on wavelet thresholding using
Generalized Cross Validation
* Provides scaling of images
* Provides edge enhancement of images
* Provides also some simple image operations (addition and
subtraction of images)
* Allows different image representations (RGB, YUV, Lab, ...)
The software library is written in C++ and extensively uses features
of the ANSI C++ 95 Draft Standard to allow for a cleaner design. The
development was done using GNU C++ 2.7.2.x.
WAILI is available in source form for research purposes only and may
not be further distributed. Enquiries about the license conditions
should be directed to email@example.com. Alternatively you
can use the online form at
* Geert Uytterhoeven (Geert.Uytterhoeven@cs.kuleuven.ac.be)
* Filip Van Wulpen (Filip.VanWulpen@cs.kuleuven.ac.be)
* Maarten Jansen (Maarten.Jansen@cs.kuleuven.ac.be)
This library is developed within a project on Wavelet Based
Interactive Video Communication and Image Database Consulting, funded
by the Flemish Information Technology Action Program (Vlaams
Actieprogramma Informatietechnologie), project number ITA/950244.
G. Uytterhoeven, D. Roose, and A. Bultheel. Wavelet transforms
using the Lifting Scheme. ITA-Wavelets Report WP 1.1,
Department of Computer Science, Katholieke Universiteit Leuven,
Belgium, November 1996.
And remember, it's written WAILI, but pronounced WILY, except in
Dutch, where it's pronounced PIEFPAK.
Geert Uytterhoeven Geert.Uytterhoeven@cs.kuleuven.ac.be
Wavelets, Linux/m68k on Amiga http://www.cs.kuleuven.ac.be/~geert/
Department of Computer Science -- Katholieke Universiteit Leuven -- Belgium
From: Ron Boisvert <firstname.lastname@example.org>
Date: Fri, 16 May 97 13:17:08 EDT
Subject: Matrix Market Version 3 Released
Matrix Market (Version 3.0)
We are pleased to announce a new release of the Matrix Market, NIST's
visual database of matrices for use in comparative studies of
algorithms in numerical linear algebra. Version 3.0 inaugurates new
matrix generation services and new matrix visualizations:
* the Matrix Market Deli, a collection of 15 Java applets which
generate matrices in your Web browser
* form-based execution of the LAPACK random test matrix generator
* matrix cityplots, new 3D visualizations of matrix structure
* interactive VRML models of 69 matrix cityplots
For more details, see the "What's New" link under the Matrix Market
The Market contains 482 individual matrices and 25 matrix generators,
including the Harwell-Boeing Collection, Saad's SPARSKIT collection,
and the nonsymmetric eigenvalue problem collection of Bai, Day,
Demmel and Dongarra. Using the Matrix Market search interface, one
can request matrices or generators with particular attributes, such
as "symmetric eigenvalue problems larger than 500x500" or "matrices
from structural engineering applications". Once a particular matrix
is found, one can view its sparsity pattern in various ways, and
review other pertinent data before downloading.
From: Joseph Traub <email@example.com>
Date: Mon, 12 May 97 8:59:37 EDT
Subject: Journal of Complexity Best Paper Award
Selection Committee for 1997 BEST PAPER AWARD
JOURNAL OF COMPLEXITY
The selection committee has been chosen for the second annual
BEST PAPER AWARD, to be chosen from papers published in the Journal of
Complexity in 1997. The award consists of a $3,000 prize and a
The selection committee for the 1997 award is as follows:
Professor Wolfgang Dahmen
Institute for Geometry and Applied Mathematics
Professor Jean-Pierre Dedieu
Department of Mathematics
LAO, Universite Paul Sabatier
From: Adhemar Bultheel <Adhemar.Bultheel@cs.kuleuven.ac.be>
Date: Mon, 12 May 1997 09:35:48 +0200 (MET DST)
Subject: Numerical Analysis and Applied Mathematics at K. U. Leuven
The division Numerical Analysis and Applied Mathematics of the
Department of Computer Science at the K.U.Leuven (Belgium)
is working on topics like
- Approximation and modeling
- Linear algebra
- Large-scale dynamical systems and bifurcation problems
- Iterative methods for partial differential equations
- Waveform relaxation
- Numerical integration (quadrature & cubature)
- Nonlinear system solving
More detailed information is available at
There you can also find
- a list of members of the group
- a list of publications by the group
- a list of reports which are made available in zipped postscript format
- an interactive search possibility in the publication database.
From: Jorge More' <firstname.lastname@example.org>
Date: Wed, 14 May 1997 11:01:03 -0500
Subject: NEOS Server for Optimization Problems
The NEOS Server introduces a novel approach to the solution of
optimization problems. Users submit problems via email, a Web browser,
or the newly developed NEOS submission tool. The NEOS Server
links with the appropriate solver and returns the solution.
Users only need to submit a specification of the problem.
The NEOS Server provides all other information; in particular,
nonlinear problems have derivatives and sparsity patterns
computed with automatic differentiation tools.
Version 2.0 of the NEOS Server at URL
incorporates a new look, new interfaces, and new solvers.
Of particular interest among the solvers:
LANCELOT - nonlinearly constrained optimization problems
PATH - mixed nonlinear complementarity problems
PCx - linear programming
L-BFGS-B - large-scale bound-constrained optimization problems
We are encouraging users to test the NEOS Server.
We have an extensive list of sample problems that can be submitted,
but we are mainly interested in solving new problems.
Users should also note the NEOS Guide at URL
which has extensive information on optimization (algorithms, software,
FAQ, case studies,...).
NEOS is a project of the Optimization Technology Center
(Argonne National Laboratory and Northwestern University).
Many have contributed to the development of the NEOS Server.
Collaborators are listed in the URL for the NEOS Server.
From: Christoph Pospiech <email@example.com>
Date: Wed, 14 May 1997 18:45:22 +0200
Subject: Discrete Maximum Principles
Is there a discrete analogon to the classic maximum principle for
elliptic PDE ? Any comments welcome. Thanks.
IBM High Performance Support Center
From: Kristen Kirchner <firstname.lastname@example.org>
Date: Thu, 15 May 97 11:00:06 EST
Subject: SIAM Looking for Copy of Bellman Book
SIAM will be publishing Introduction to Matrix Analysis, Second
Edition by Richard Bellman in our Classics series. We are looking for
a copy of the book. We would have to take the book apart and would
not be able to return the copy, but would be happy to replace it with
a new copy of the Classics edition when it publishes.
Please contact me at email@example.com if you are able to help.
Kristen Kirchner, Acquisitions Coordinator
Society for Industrial and Applied Mathematics (SIAM)
3600 University City Science Center, Philadelphia, PA 19104-2688
phone: 215-382-9800 fax: 215-386-7999 e-mail: firstname.lastname@example.org
From: Trini Flores <email@example.com>
Date: Thu, 15 May 97 08:36:57 EST
Subject: SIAM 45th Anniversary & Annual Meeting
SIAM 45th Anniversary and Annual Meeting
Stanford University, July 14-18, 1997
Please make note of the following deadlines for hotels and dormitory
June 11, 1997 - Stanford Terrace Inn
June 11, 1997 - Holiday Inn Palo Alto
June 15, 1997 - Hyatt Rickeys
June 30, 1997 - Stanford University Governor's Complex (Dorms)
Contact SIAM, Telephone: 215-382-9800
June 30, 1997 - Deadline for Advance Registrations
Contact SIAM, Telephone: 215-382-9800
For more information about the meeting, dormitory, hotels,
transportation, and registration, and to obtain the fill-in forms to
make a reservation or registration, visit the World Wide Web at:
See you in Stanford!
The Meeting Organizers
From: Jack Dongarra <firstname.lastname@example.org>
Date: Fri, 16 May 1997 19:31:59 -0400
Subject: Availability of ScaLAPACK and SLUG
Availability of ScaLAPACK software update (version 1.5) and Users' Guide
ScaLAPACK is a collection of software for performing dense and band linear
algebra computations on distributed-memory parallel computers. ScaLAPACK,
version 1.5, includes routines for the solution of:
* Dense, band, triangular, and tridiagonal linear systems of equations,
* Condition estimation and iterative refinement for LU and Cholesky
* Matrix inversion,
* Full-rank linear least squares problems,
* Orthogonal and generalized orthogonal factorizations,
* Orthogonal transformation routines,
* Reductions to upper Hessenberg, bidiagonal and tridiagonal form,
* Reduction of a symmetric-definite/Hermitian-definite generalized
eigenproblem to standard form,
* Symmetric/Hermitian eigenproblem,
* Generalized symmetric/Hermitian eigenproblem,
* Nonsymmetric eigenproblem, and
* Singular value decomposition.
Most routines are available in four data types: single precision real,
double precision real, single precision complex, and double precision complex.
In addition, we have provided prototype software to handle the following areas:
* Out-of-core linear solvers for LU, Cholesky, and QR,
* HPF wrappers for a subset of ScaLAPACK routines,
* The matrix sign function for eigenproblems, and
* Sparse direct solver for general problems (this is a sequential
implementation at this time, based on the SuperLU work).
Our software has been written to be portable across a wide range of
distributed-memory environments such as the Cray T3, IBM SP, Intel series,
TM CM-5, clusters of workstations, and any system for which PVM or MPI
is available. A comprehensive Installation Guide is provided, as well
as test suites for the collection.
The ScaLAPACK software is or will be part of the following vendor's
provided numerical software libraries: IBM, SGI/Cray, NAG, Visual
Numerics(IMSL), Fujitsu, Hewlett-Packard/Convex, Hitachi, and NEC.
For more information on the availability of each of these packages and
their documentation, consult the scalapack index on netlib. The URL is:
In addition, we have just completed an updated of the ScaLAPACK Users'
Guide (SLUG). The SLUG is available on the web in html form and will
be available in printed form from SIAM in July, 1997.
The url for the SLUG is:
The Users' Guide gives a detailed description of the philosophy behind
ScaLAPACK as well as an explanation of its usage. The printed SLUG
will be available at the SIAM National Meeting in July 1997 at Stanford and
will include a CD-ROM containing the HTML version of the ScaLAPACK Users'
Guide, the source code for the package, testing and timing programs,
prebuilt versions of the library for a number of computers, example
programs, and a full set of LAPACK Working Notes.
See the url http://www.siam.org for addition details. The
ISBN number is 0-89871-397-8, and SIAM order code is SE04. The list
price for SIAM members is $39.60; the cost for nonmembers is $49.50.
Funding for this effort comes in part from DARPA, DOE, NSF, and CRPC.
Comments/suggestions may be sent to email@example.com.
From: Do Y. Kwak <firstname.lastname@example.org>
Date: Mon, 12 May 97 16:49:45 +0900
Subject: Workshop on Finite Element Method at KAIST
Announcement of Workshop on Finite Element Method
July 8 - 11, 1997
Organizer: Do Y. Kwak and U. J Choi
Scope: Finite element method, finite volume method for P.D.E,
Iterative method, Multigrid Method, Domain decomposition
method, Inverse Problems and related topics.
Location: Department of Mathematics,
Korea Advanced Institute of Science and Tech.
Taejon, Korea 305-701
Professor Max Gunzburger, Iowa State Univ.
Professor Thomas F. Russell, University of Colorado, Denver
Professor Janet Peterson, Iowa State Univ.
Professor S. H. Chou, Bowling Green State Univ.
For further informations, email or fax to:
Do Y. Kwak
From: Victor Pereyra <email@example.com>
Date: Mon, 12 May 1997 09:43:51 -0700
Subject: Panamerican Workshop in Applied and Computational Mathematics
The organization of the II Panamerican Workshop in Applied and Computational
Mathematics to be held in Gramado, Brazil, September 8-12, is proceeding as
planned. Up to date information, preliminary program, abstracts and registration
form can be found on the Web pages ably maintained by Stanly Steinberg at the
University of New Mexico:
From: Luis Nunes Vicente <firstname.lastname@example.org>
Date: Wed, 14 May 1997 19:07:15 +0100 (WEST)
Subject: Optimization Conference in Portugal
OPTIMIZATION 98 (First Announcement)
July 20-22, 1998
Optimization 98 is the third international conference on optimization
to be held in Portugal since 1991. We are proud to announce that seven
world-renowned scientists have accepted invitations to give plenary
lectures. We hope to provide a friendly atmosphere and a lively social
The meeting will be held in the conference center of the University of
Attending Optimization 98 is a good opportunity to visit EXPO 98 in Lisbon,
the next World Exposition.
J. R. Birge, Univ. of Michigan, USA
K. De Jong, George Mason Univ., USA
B. Gavish, Vanderbilt Univ., USA
Optimization Models in Telecommunications Systems
C. Gonzaga, Federal Univ. of Rio de Janeiro, Brazil
Interior-Point Methods for Linear Programming
J. J. More, Argonne National Laboratory, USA
Numerical Optimization Software
W. Pulleyblank, IBM T. J. Watson R. Center, USA
Applied Discrete Optimization
Ph. L. Toint, Facultes Univ. ND de la Paix, Belgium
Derivative Free Optimization
You are invited to submit a paper, which you may present in lecture or
poster format. The conference language is english. For more information
you can contact:
Prof. L. N. Vicente Phone : + 351 39 7003199
Departamento de Matematica Fax : + 351 39 32568
Universidade de Coimbra E-mail: email@example.com
3000 Coimbra WWW : http://opti.it.uc.pt/~opti98
March 30, 1998: Deadline for submission of contributed abstracts.
May 1, 1998 : Notification of acceptance of submitted abstracts.
May 15, 1998 : Deadline for registration.
From: Laurent Breach <firstname.lastname@example.org>
Date: Tue, 13 May 1997 15:07:55 +0000
Subject: Postdoctoral Position at Columbia University
Announcement for a University/Industry
NATIONAL SCIENCE FOUNDATION
POST-DOCTORAL RESEARCH FELLOWSHIP
in the Mathematical Sciences
Department of Mathematics, Columbia University, New York, NY
Morgan-Stanley and Co. Inc., New York, NY
Applications are invited for a two-year National Science Foundation (NSF)
Post-Doctoral Research Fellowship on the Mathematical and Computational
aspects of Finance, jointly, between the Fixed Income Research Group at
Morgan-Stanley & Co. Inc. and the Department of Mathematics, Columbia
University, New York, to commence in September 1997. The faculty mentor
will be Professor Ioannis Karatzas (Departments of Mathematics and
Statistics, Columbia University, Mailcode 4438, Mathematics Building,
2990 Broadway, New York, NY 10027), and the industrial sponsor will be
Dr. Joseph Langsam (Principal, Fixed Income Research, Morgan Stanley & Co.
Inc., 1585 Broadway, New York, NY 10036).
The Fellow will be expected to develop a mathematical framework for the
valuation of American-style derivative securities on interest-sensitive
(fixed-income) instruments, as well as accurate and fast numerical techniques
in this context. The problem is of considerable practical importance and
requires advanced mathematical tools, such as stochastic differential equations,
martingales and optimal stopping, partial differential equations, and
The Fellow must be a US citizen or permanent resident, must have received the
Ph.D. degree since 1/1/90, must not hold a tenured position at any academic
institution, and must not have previously held any NSF Post-Doctoral Fellowship.
Other considerations include:
(1) The mathematical background and ability of the candidate.
(2) The relevance of the candidate's interests, training and experience to the
goals of the research program, as specified above.
(3) The ability of the candidate to communicate effectively, and to work in a
(4) The goal of the National Science Foundation is to increase participation by
members of groups underrepresented in the Mathematical Sciences.
Application materials should include a curriculum vitae and three letters of
reference, and should be sent to each of the two sponsors at the above
Application Deadline: June 30, 1997
From: Iain Duff <email@example.com>
Date: Fri, 16 May 1997 18:56:01 +0100
Subject: Studentship at Oxford and Rutherford
EPSRC CASE studentship:
`Iterative methods for linear systems with constraints'
Andy Wathen, (Oxford University), Iain Duff and Nick Gould (Rutherford
Appleton Lab) have just received guaranteed funding for a 3 year collaborative
DPhil (PhD) studentship in Numerical Linear Algebra. The project concerns the
iterative solution of systems of linear (matrix) equations of the type which
arise in constrained optimisation.
The project will start in October 1997 and the student will be based primarily
in the Computing Lab at Oxford University with occasional placements at the
nearby Rutherford Lab. The studentship will cover fees and subsistence for a
UK student or fees only for any other European Union citizen.
Anyone possibly interested is encouraged to approach
Andy Wathen (firstname.lastname@example.org or (01865) 273887) in the first instance.
From: John Lowengrub <email@example.com>
Date: Tue, 13 May 1997 16:57:54 -0500
Subject: Position at University of Minnesota
The School of Mathematics at the University of Minnesota
seeks to fill a position for a full-time computing laboratory
supervisor. Candidates are sought with some experience in
scientific computing. A BS degree in Mathematics or related
field is required, an advanced degree (MS) is desirable.
The successful applicant will be appointed for an initial
3-year period and is expected to provide support for
applications software (MATLAB, Maple, Mathematica, gnuplot,
tekplot, Netlib and other public domain packages), develop
templates and modules for graphical interfaces, archiving
and documentation. Programming experience in Fortran and C
is required, familiarity with C++, TCL/TK, Java, and Web-related
languages is desirable.
Salary and benefits will be commensurate with qualifications,
and will range from $35000 to $38000.
Applicants are requested to contact Tina Carr(firstname.lastname@example.org)
for further information. A formal job description is
(SP USER SERV SPEC 832992 SCHOOL OF MATHEMATICS)
A hard copy of the job description can be obtained from
the University of Minnesota's Human Resource at 612-625-2000.
School of Math
tel: 612-625-0753, email@example.com
From: H. G. Bock <SciCom@IWR.Uni-Heidelberg.De>
Date: Wed, 14 May 1997 16:30:40 +0100
Subject: Positions at IWR Heidelberg
Positions at IWR Heidelberg
The simulation and optimization group at IWR (Interdisciplinary Center
for Scientific Computing at the University of Heidelberg) has several
postdoctoral or doctoral positions available. Wanted are scientists
who are willing to work in interdiciplinary teams of mathematicians,
computer scientists, natural scientists and engineers in order to perform
investigations in one of the following ongoing research projects at IWR.
* optimization of reactive flow
Required expertise: discretization methods for instationary PDE (finite
element methods, multigrid methods), methods for large scale constrained
optimization (SQP variants, IPM), applications in chemistry and chemical
* optimal motion of mechanical systems
Required expertise: modelling of mechatronical systems (complex structured
ODE or DAE), simulation and optimization (numerical methods for initial
and boundary value problems in DAE, state constrained discontinuous optimal
control problems), applications in robotics and mechanical engineering
(optimal motion of robots, design of walking mechanisms, vehicle and motor
The ideal candidates are both highly motivated and highly qualified. They
are expected to have excellent knowledge and practical experience in the
development and implementation of methods and algorithms in at least one of
the mentioned areas of expertise. Applications should contain the usual
documents, a summary of the actual research activities and a statement
about the candidate's personal career goals.
The age limit is 35 years for the postdoctoral positions, and 28 years for
the doctoral positions . All positions can be filled immediately for a 1.5
year appointment. Depending on successful work, there is a possibility for
prolongation. The salary is regulated according to the German BAT contract.
IWR encourages applications from women.
Applications should be sent till June 10, 1997, to
Prof.Dr. H.G. Bock
IWR der Universitaet Heidelberg
Im Neuenheimer Feld 368
From: Lisa Dougherty <firstname.lastname@example.org>
Date: Mon, 12 May 97 09:49:11 EST
Subject: Contents, SIAM Journal on Computing
SIAM Journal on Computing
Volume 26, Number 3, JUNE 1997
Boolean Circuits, Tensor Ranks, and Communication Complexity
Pavel Pudlak, Vojtech Rodl, and Jiri Sgall
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
Lane A. Hemaspaandra and Jorg Rothe
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
Shai Mohaban and Micha Sharir
On the Complexity of Finding a Minimum Cycle Cover of a Graph
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
Akiyoshi Shioura, Akihisa Tamura, and Takeaki Uno
Size-Depth Tradeoffs for Threshold Circuits
Russell Impagliazzo, Ramamohan Paturi, and Michael E. Saks
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets
On the Amount of Nondeterminism and the Power of Verifying
Liming Cai and Jianer Chen
Bounds on the Number of Examples Needed for Learning Functions
Hans Ulrich Simon
A Pumping Condition for Regular Sets
Leader Election in Complete Networks
The Cost of Derandomization: Computability or Competitiveness
Xiaotie Deng and Sanjeev Mahajan
Tighter Upper Bounds on the Exact Complexity of String Matching
Richard Cole and Ramesh Hariharan
The k-Steiner Ratio in Graphs
Al Borchers and Ding-Zhu Du
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than
Graham's List Scheduling"
R. Chandrasekaran, Bo Chen, Gabor Galambos, P.R. Narayanan, Andre van Vliet, and
Gerhard J. Woeginger
From: Carlos Moura <email@example.com>
Date: Mon, 12 May 1997 17:02:08 -0300
Subject: Contents, Computational and Applied Mathematics
Computational and Applied Mathematics
(Matematica Aplicada e Computacional)
Jointly published by Birkhauser-Boston
and SBMAC - Brazilian Soc. for Computational
and Applied Mathematics
Vol.16, Issue 1, 1997
Special Issue on Stochastic Analysis I
MD Fragoso and OLV Costa (Guest Editors)
The Unfolding of Dynamics in Stochastic Analysis
The Feynman-Kac Formula and Decomposition of Brownian Paths
M Jeanblanc, J Pitman and M Yor
Feller Semigroups and Markov Processes
End of NA Digest