000			03958nam a22005655i 4500
001			978-3-540-48435-6
003			DE-He213
005			20160624102034.0
007			cr nn 008mamaa
008			121227s1994 gw | s |||| 0|eng d
020			_a9783540484356 _9978-3-540-48435-6
024	7		_a10.1007/3-540-58078-6 _2doi
050		4	_aQA76.76.O63
072		7	_aUL _2bicssc
072		7	_aCOM046000 _2bisacsh
082	0	4	_a005.43 _223
245	1	0	_aParallel and Distributed Computing Theory and Practice _h[electronic resource] : _bFirst Canada-France Conference Montréal, Canada, May 19–21, 1994 Proceedings / _cedited by Michel Cosnard, Afonso Ferreira, Joseph Peters.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1994.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1994.
300			_aXI, 285 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v805
505	0		_aJuggling networks -- Optimal parallel verification of minimum spanning trees in logarithmic time -- The parallel complexity of algorithms for pattern formation models -- On the parallel complexity of iterated multiplication in rings of algebraic integers -- NC 2 Algorithms regarding Hamiltonian paths and circuits in interval graphs -- Concurrency in an O (log log N) priority queue -- Embedding k-D meshes into optimum hypercubes with dilation 2k-1 extended abstract -- Embedding 3-dimensional grids into optimal hypercubes -- Distributed cyclic reference counting -- Efficient reconstruction of the causal relationship in distributed systems -- Scalable parallel computational geometry -- Sorting and selection on arrays with diagonal connections -- Work-Optimal thinning algorithm on SIMD machines -- An efficient implementation of parallel A* -- Constant-time convexity problems on reconfigurable meshes -- Deepness analysis: Bringing optimal fronts to triangular finite element method -- Communications in bus networks -- Fault-tolerant linear broadcasting -- The minimum broadcast time problem -- The complexity of systolic dissemination of information in interconnection networks -- Representations of gossip schemes -- On the multiply-twisted hypercube.
520			_aThis volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors. This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aOperating systems (Computers).
650		0	_aComputer graphics.
650		0	_aNumerical analysis.
650	1	4	_aComputer Science.
650	2	4	_aOperating Systems.
650	2	4	_aComputer Communication Networks.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aNumerical Analysis.
650	2	4	_aComputer Graphics.
700	1		_aCosnard, Michel. _eeditor.
700	1		_aFerreira, Afonso. _eeditor.
700	1		_aPeters, Joseph. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540580782
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v805
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-58078-6
942			_2EBK6470 _cEBK
999			_c35764 _d35764