[comp.theory] Call For Papers

jsbm@CS.CORNELL.EDU ("Joseph S.B. Mitchell") (01/04/91)

                    CALL FOR PAPERS

               ORSA Journal on Computing

         Special Issue on Computational Geometry


The ORSA Journal on Computing is dedicating a special issue to
the subject of computational geometry. The rapidly growing field of
computational geometry has addressed many problems of interest in
operations research and has provided new algorithmic techniques for
tackling a variety of optimization problems. Conversely, many
well-established methods of operations research have contributed to
the progress in geometric algorithms. This special issue is designed
to stimulate the interplay between computational geometry and
operations research and to enhance the application of techniques from
computational geometry to problems arising in operations research. The
special issue will provide the advantage of grouping together
high-quality papers in the area, as well as the benefit of speedy
review and minimal publication delays.

Manuscripts are solicited over a wide range of topics within computational
geometry and its applications, including but not limited to:

     Optimization
     Manufacturing
     Robotics and Vision
     Facility Location
     Shortest Paths
     Networks
     Mathematical Programming
     Statistics

All manuscripts will be promptly and carefully refereed. High-quality
manuscripts not accepted in the special issue due to space limitations will
be considered, with the authors' permission, for inclusion in a regular
issue of the journal.

Authors should submit four copies of their manuscript to either of the
editors:

Joseph S. B. Mitchell
School of Operations Research
  and Industrial Engineering
Engineering Theory Center
Cornell University
Ithaca, NY 14853
USA
(607) 255-9148
jsbm@cs.cornell.edu

Jan Karel Lenstra
Department of Mathematics
 and Computing Science
Eindhoven University of Technology
P.O. Box 513
5600 MB Eindhoven
The Netherlands
31-49-474770
jkl@win.tue.nl

by no later than June 1, 1991. To expedite handling, authors should
prepare their manuscripts consistent with the Instructions for Authors
that appeared in Volume 2, Number 1 of the ORSA Journal on
Computing; a copy is available from the Editors.

okafuji@ics.osaka-u.ac.jp (Okafuji Kouki) (02/21/91)

  I want to get latest papers which say on
  triangularization of general and Toeplitz matrices.

  |---------------------|---------|---------|---------|---------|
  | number of processor |    1    |    n    |   n*n   |  n*n*n  |
  |---------------------|---------|---------|---------|---------|
  |   general matrix    |  n*n*n  |         |    n?   |logn*logn|
  |                     | (n*n*n) |  (n*n)  |   (n)   |   (1)   |
  |---------------------|---------|---------|---------|---------|
  |  Toeplitz matrix    |   n*n   |    n    |  logn   |         |
  |                     |  (n*n)  |   (n)   |   (1)   |         |
  |---------------------|---------|---------|---------|---------|

  Above table is correct ?
  Notes : matrix is n*n
	  ( ) is lowerbound
	  append order to number

  I already have "Systolic Triangularization over Finite Fields"
		 Michel Cosnard, Jean Duprat, and Yves Robert
		 1990

		 "Linearly Connected Array for Toeplitz Least-Squares
		  Problems"
		 A.W.Bojanczyk, R.P.Brent, and F.R.de Hoog
		 1990

		 "Fast Parallel Polynomial Division via Reduction to
		  Triangular Toeplitz Matrix Inversion and to
		  Polynomial Inversion Modulo a power"
		 Dario Bini, and Victor Ya.Pan
		 1985

		 "Efficient Systolic Arrays for the Solution of
		  Toeplitz Systems"
		 Jean-Marc Delosme, Ilse C.F.Ipsen
		 1985

		 "Parallel Solution of Certain Toeplitz Linear
		  Systems"
		 Dario Bini
		 1984


  Please Help Me!

okafuji@ics.osaka-u.ac.JP (Okafuji Kouki) (02/22/91)

  triangularization of general and Toeplitz matrices.

  |---------------------|---------|---------|---------|---------|
  | number of processor |    1    |    n    |   n*n   |  n*n*n  |
  |---------------------|---------|---------|---------|---------|
  |   general matrix    |  n*n*n  |         |    n?   |logn*logn|
  |                     | (n*n*n) |  (n*n)  |   (n)   |   (1)   |
  |---------------------|---------|---------|---------|---------|
  |  Toeplitz matrix    |   n*n   |    n    |  logn   |         |
  |                     |  (n*n)  |   (n)   |   (1)   |         |
  |---------------------|---------|---------|---------|---------|

  Above table is correct ?
  Notes : matrix is n*n
	  ( ) is lowerbound
	  append order to number

  I already have "Systolic Triangularization over Finite Fields"
		 Michel Cosnard, Jean Duprat, and Yves Robert
		 1990

		 "Linearly Connected Array for Toeplitz Least-Squares
		  Problems"
		 A.W.Bojanczyk, R.P.Brent, and F.R.de Hoog
		 1990

		 "Fast Parallel Polynomial Division via Reduction to
		  Triangular Toeplitz Matrix Inversion and to
		  Polynomial Inversion Modulo a power"
		 Dario Bini, and Victor Ya.Pan
		 1985

		 "Efficient Systolic Arrays for the Solution of
		  Toeplitz Systems"
		 Jean-Marc Delosme, Ilse C.F.Ipsen
		 1985

		 "Parallel Solution of Certain Toeplitz Linear
		  Systems"
		 Dario Bini
		 1984


  Please Help Me!

yxt3@po.CWRU.Edu (Yoshiyasu Takefuji) (04/27/91)

                      CALL FOR PAPERS
Journal Analog Integrated Circuits and Signal Processing (AICSP)
                       Special Issue 
                            on
                 Analog VLSI Neural Networks

Papers are solicited for a special issue of the Journal Analog Integrated 
Circuits and Signal Processing (AICSP) covering the growing area of 
artificial neural networks to be published in September 1992. 
The special  issue will cover all aspects of analog VLSI neural networks. 
Topics of interest include, but are not limited to, the following:
*VLSI analog/digital systems
*Tradeoffs of analog/digital systems
*Novel applications in signal processing, optimization, and others
*Wafer scale integrated systems
*Artificial neuron/synaptic models and implementations
*On-line learning hardware.

Six copies of complete manuscripts should be sent to Yoshiyasu Takefuji by 
December 15, 1991.

Guest Editor: Prof. Yoshiyasu Takefuji
        Dept. of Electrical Engineering
        Case Western Reserve University
        Cleveland, OH 44106, USA
        Phone: 216-368-6430
        Fax: 216-368-2668
        Internet: takefuji@axon.eeap.cwru.edu   

Instructions for authors can be obtained from the guest editor or by
contacting Kluwer at the following address.

Karen S. Cullen
Kluwer Academic Publishers
101 Philip Drive
Norwell, MA 02061, USA
Tel. (617) 871-6300 fax (617) 871-6528
Email Karen@world.std.com

seshad@danablu.cs.wisc.edu (S Seshadri) (05/02/91)

       CALL FOR PAPERS FOR A SPECIAL ISSUE OF
   (JOURNAL OF) COMPUTER SCIENCE AND INFORMATICS 


It is proposed that a special issue of 'Computer Science
and Informatics' (a journal published by the Computer
Society of India) dedicated to high quality papers in
the area of "Algorithmics" be brought out.


------------------TOPICS OF INTEREST--------------------------------
Topics of interest include, but are not limited to, the following:

1) Graph algorithms
2) Computational Geometry
3) Stringology
4) Combinatorial Algorithms
5) Parallel non-numerical algorithms
6) Data Structures
7) Analysis of algorithms

-----------------------SUBMISSIONS-----------------------------------

Three copies of the paper should be submitted to the guest editor:

Prof C.Pandu Rangan,
Department Of Computer Science And Engineering
Indian Institute Of Technology
Madras 600 036
INDIA.

E-mail Address: rangan%shiva@shakti.ernet.in
		uunet!shakti!shiva!rangan

------------------------DEADLINES-------------------------------------
Deadline for submission: October 31, 1991.
Publication schedule:    June 1992.

----------------------------------------------------------------------

Please contact Prof C.Pandu Rangan for further details.