Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. CFCP 1994: Montréal, Canada
- Michel Cosnard, Afonso Ferreira, Joseph G. Peters:
Parallel and Distributed Computing, First Canada-France Conference, Montréal, Canada, May 19-21, 1994, Proceedings. Lecture Notes in Computer Science 805, Springer 1994, ISBN 3-540-58078-6 - Nicholas Pippenger:
Juggling Networks. 1-12 - Brandon Dixon, Robert Endre Tarjan:
Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. 13-22 - Raymond Greenlaw, Jonathan Machta:
The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract). 23-34 - Stephan Waack:
On the Parallel Complexity of Iterated Multiplication in Rings of Algebraic Integers. 35-44 - Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher:
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). 45-57 - Brandon Dixon:
Concurrency in an O(log log N) Priority Queue. 59-71 - Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough:
Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). 73-80 - Markus Röttger, Ulf-Peter Schroeder, Walter Unger:
Embedding 3-dimensional Grids into Optimal Hypercubes. 81-94 - Frank K. H. A. Dehne, Rafael Dueire Lins:
Distributed Cyclic Reference Counting. 95-100 - Philippe Baldy, Hervé Dicky, Raoul Medina, Michel Morvan, Jean-François Vilarem:
Efficient Reconstruction of the Causal Relationship in Distributed Systems. 101-113 - Frank K. H. A. Dehne:
Scalable Parallel Computational Geometry (Summary). 115-119 - Danny Krizanc, Lata Narayanan:
Sorting and Selection on Arrays with Diagonal Connections. 121-136 - Stéphane Ubéda:
Work-Optimal Thinning Algorithm On SIMD Machines. 137-152 - Van-Dat Cung, Bertrand Le Cun:
An Efficient Implementation of Parallel A*. 153-168 - Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Constant-Time Convexity Problems on Reconfigurable Meshes. 169-180 - Jérôme Galtier:
Deepness Analysis: Bringing Optimal Fronts to Triangular Finite Element Methods. 181-196 - André Hily, Dominique Sotteau:
Communications in Bus Networks. 197-206 - Krzysztof Diks, Andrzej Pelc:
Fault-Tolerant Linear Broadcasting. 207-217 - Klaus Jansen, Haiko Müller
:
The Minimum Broadcast Time Problem. 219-234 - Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks. 235-249 - David W. Krumme:
Representations of Gossip Schemes. 251-265 - Priyalal Kulasinghe, Saïd Bettayeb:
On the Multiply-Twisted Hypercube. 267-278
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 19:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
