Pierre Fraigniaud

According to our database1, Pierre Fraigniaud authored at least 202 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Parallel Bayesian Search with No Coordination.
J. ACM, 2019

Randomized proof-labeling schemes.
Distributed Computing, 2019

On Distributed Merlin-Arthur Decision Protocols.
Proceedings of the Structural Information and Communication Complexity, 2019

A Topological Perspective on Distributed Network Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2019

2018
What can be verified locally?
J. Comput. Syst. Sci., 2018

Formal Methods and Fault-Tolerant Distributed Comp.: Forging an Alliance (Dagstuhl Seminar 18211).
Dagstuhl Reports, 2018

Preferential Attachment as a Unique Equilibrium.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Redundancy in Distributed Proofs.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Equilibria of Games in Networks for Local Tasks.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017
Error-Sensitive Proof-Labeling Schemes.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Three Notes on Distributed Property Testing.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Certification of Compact Low-Stretch Routing Schemes.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

What Can Be Verified Locally?.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Distributed Detection of Cycles.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Locality in Distributed Graph Algorithms.
Encyclopedia of Algorithms, 2016

Forewords: Special issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2016

Rumor spreading in random evolving graphs.
Random Struct. Algorithms, 2016

An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets.
J. ACM, 2016

Survey of Distributed Decision.
Bulletin of the EATCS, 2016

On the complexity of the shortest-path broadcast problem.
Discrete Applied Mathematics, 2016

Distributed Testing of Excluded Subgraphs.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Parallel exhaustive search without coordination.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Perfect Failure Detection with Very Few Bits.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Asynchronous Coordination Under Preferences and Constraints.
Proceedings of the Structural Information and Communication Complexity, 2016

Sparsifying Congested Cliques and Core-Periphery Networks.
Proceedings of the Structural Information and Communication Complexity, 2016

Noisy Rumor Spreading and Plurality Consensus.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Challenges in Fault-Tolerant Distributed Runtime Verification.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

A Hierarchy of Local Decision.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Local Conflict Coloring.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Decentralized Asynchronous Crash-Resilient Runtime Verification.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Core-periphery clustering and collaboration networks.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
Randomized Local Network Computing.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Node Labels in Local Decision.
Proceedings of the Structural Information and Communication Complexity, 2015

Randomized Proof-Labeling Schemes.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
The worst case behavior of randomized gossip protocols.
Theor. Comput. Sci., 2014

Flooding in dynamic graphs with arbitrary degree sequence.
J. Parallel Distrib. Comput., 2014

Randomized distributed decision.
Distributed Computing, 2014

Greedy routing in small-world networks with power-law degrees.
Distributed Computing, 2014

Distributedly Testing Cycle-Freeness.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Automatically Adjusting Concurrency to the Level of Synchrony.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems.
Proceedings of the Runtime Verification - 5th International Conference, 2014

The Opinion Number of Set-Agreement.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
Towards a complexity theory for local distributed computing.
J. ACM, 2013

Special issue with selected papers from PODC 2011.
Distributed Computing, 2013

Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042).
Dagstuhl Reports, 2013

Local Decision and Verification with Bounded-Size Outputs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

What can be decided locally without identifiers?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Rumor Spreading in Random Evolving Graphs.
Proceedings of the Algorithms - ESA 2013, 2013

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Foreword: Special Issue on Theory and Applications of Graph Searching Problems.
Theor. Comput. Sci., 2012

Connected graph searching.
Inf. Comput., 2012

Randomized Distributed Decision.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

The Worst Case Behavior of Randomized Gossip.
Proceedings of the Theory and Applications of Models of Computation, 2012

Notions of Connectivity in Overlay Networks.
Proceedings of the Structural Information and Communication Complexity, 2012

What Can Be Computed without Communications?
Proceedings of the Structural Information and Communication Complexity, 2012

Brief announcement: what can be computed without communication?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

On the Impact of Identifiers on Local Decision.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Computing with Large Populations Using Interactions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Decidability Classes for Mobile Agents Computing.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Special Issue on "Theory and Applications of Graph Searching Problems".
Theor. Comput. Sci., 2011

Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071).
Dagstuhl Reports, 2011

Locality and Checkability in Wait-Free Computing.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Local Distributed Decision.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
A Lower Bound for Network Navigability.
SIAM J. Discrete Math., 2010

Communication algorithms with advice.
J. Comput. Syst. Sci., 2010

On the additive constant of the k-server Work Function Algorithm.
Inf. Process. Lett., 2010

An optimal ancestry scheme and small universal posets.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the searchability of small-world networks with arbitrary underlying structure.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Delays induce an exponential memory gap for rendezvous in trees.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

On the bit communication complexity of randomized rumor spreading.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Compact Ancestry Labeling Schemes for XML Trees.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Distributed computational complexities: are you volvo-addicted or nascar-obsessed?
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networks.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Provenance for database transformations.
Proceedings of the Database Theory, 2010

"Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks.
Proceedings of IEEE International Conference on Communications, 2010

Informative Labeling Schemes.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Universal augmentation schemes for network navigability.
Theor. Comput. Sci., 2009

On the Additive Constant of the k-Server Work Function Algorithm.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

On randomized representations of graphs using short labels.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Sub-linear Universal Spatial Gossip Protocols.
Proceedings of the Structural Information and Communication Complexity, 2009

The effect of power-law degrees on the navigability of small worlds: [extended abstract].
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Parsimonious flooding in dynamic graphs.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Online Computation with Advice.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Forewords: Special issue on graph searching.
Theor. Comput. Sci., 2008

Tree exploration with advice.
Inf. Comput., 2008

Impact of memory size on graph exploration capability.
Discrete Applied Mathematics, 2008

Opportunistic spatial gossip over mobile social networks.
Proceedings of the first Workshop on Online Social Networks, 2008

Deterministic Rendezvous in Trees with Little Memory.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Polylogarithmic network navigability using compact metrics with small stretch.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Recovering the Long-Range Links in Augmented Graphs.
Proceedings of the Structural Information and Communication Complexity, 2008

Forget him and keep on moving.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

The Inframetric Model for the Internet.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Networks Become Navigable as Nodes Move and Forget.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.
Theory Comput. Syst., 2007

Special Issue DISC 2005.
Distributed Computing, 2007

Local MST computation with short advice.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Distributed Computing with Advice: Information Sensitivity of Graph Coloring.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation.
Proceedings of the Algorithms, 2007

2006
D2B: A de Bruijn based content-addressable network.
Theor. Comput. Sci., 2006

Header-size lower bounds for end-to-end communication in memoryless networks.
Computer Networks, 2006

Deterministic Rendezvous in Graphs.
Algorithmica, 2006

Monotony Properties of Connected Visible Graph Searching.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Brief Announcement: On Augmented Graph Navigability.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Distributed Chasing of Network Intruders.
Proceedings of the Structural Information and Communication Complexity, 2006

Oracle size: a new measure of difficulty for communication tasks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Tree Exploration with an Oracle.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Connected Treewidth and Connected Graph Searching.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Navigability of Small World Networks.
Proceedings of the High Performance Computing, 2006

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.
Proceedings of the Algorithms, 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
Proceedings of the Theoretical Computer Science, 2006

2005
Efficient trigger-broadcasting in heterogeneous clusters.
J. Parallel Distrib. Comput., 2005

An algorithmic model for heterogeneous hyper-clusters: rationale and experience.
Int. J. Found. Comput. Sci., 2005

Space Lower Bounds for Graph Exploration via Reduced Automata.
Proceedings of the Structural Information and Communication Complexity, 2005

Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Labeling Schemes for Tree Representation.
Proceedings of the Distributed Computing, 2005

Label-Guided Graph Exploration by a Finite Automaton.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Greedy Routing in Tree-Decomposed Graphs.
Proceedings of the Algorithms, 2005

2004
A note on line broadcast in digraphs under the edge-disjoint paths mode.
Discrete Applied Mathematics, 2004

Digraphs Exploration with Little Memory.
Proceedings of the STACS 2004, 2004

Eclecticism shrinks even small worlds.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Reducing Packet-Loss by Taking Long-Range Dependences into Account.
Proceedings of the NETWORKING 2004, 2004

Graph Exploration by a Finite Automaton.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Collective Tree Exploration.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges.
Wireless Communications and Mobile Computing, 2003

Searching Is Not Jumping.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Lower Bounds for Oblivious Single-Packet End-to-End Communication.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Can we elect if we cannot compare?
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Brief announcement: an overview of the content-addressable network D2B.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

MλT: a multicast protocol with QoS support.
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003

Topic Introduction.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Deterministic Rendezvous in Graphs.
Proceedings of the Algorithms, 2003

2002
Oriented hypercubes.
Networks, 2002

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees.
Theory Comput. Syst., 2002

Recognizing Knödel graphs.
Discrete Mathematics, 2002

A Space Lower Bound for Routing in Trees.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Capture of an intruder by mobile agents.
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Tree exploration with little memory.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Unslotted deflection routing: a practical and efficient protocol for multihop optical networks.
IEEE/ACM Trans. Netw., 2001

Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs.
Networks, 2001

Assigning labels in an unknown anonymous network with a leader.
Distributed Computing, 2001

Interval routing schemes allow broadcasting with linear message-complexity.
Distributed Computing, 2001

Efficient Routing in Networks with Long Range Contacts.
Proceedings of the Distributed Computing, 15th International Conference, 2001

HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Routing in Trees.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.
Proceedings of the Algorithms, 2001

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
Guest Editors' Foreword.
Theory Comput. Syst., 2000

Assigning labels in unknown anonymous networks (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Interval routing schemes allow broadcasting with linear message-complexity (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

On Recognizing Cayley Graphs.
Proceedings of the Algorithms, 2000

1999
Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes.
Parallel Processing Letters, 1999

Recognizing Bipartite Incident-Graphs of Circulant Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Scheduling Calls for Multicasting in Tree-Networks.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks.
IEEE Trans. Parallel Distrib. Syst., 1998

Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.
IEEE Trans. Parallel Distrib. Syst., 1998

On XRAM and PRAM Models, and on Data-Movement-Intensive Problems.
Theor. Comput. Sci., 1998

Strategies for Path-Based Multicasting in Wormhole-Routed Meshes.
J. Parallel Distrib. Comput., 1998

Hierarchical Broadcast Networks.
Inf. Process. Lett., 1998

Interval Routing Schemes.
Algorithmica, 1998

A Theoretical Model for Routing Complexity.
Proceedings of the SIROCCO'98, 1998

Minimal contention-free matrices with application to multicasting.
Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

1997
Approximation Algorithms for Broadcasting and Gossiping.
J. Parallel Distrib. Comput., 1997

Universal Routing Schemes.
Distributed Computing, 1997

Approximation Algorithms for Structured Communication Problems.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks.
Proceedings of the SIROCCO'97, 1997

Broadcasting and Multicasting in Cut-through Routed Networks.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

An extended comparison of slotted and unslotted deflection routing.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), 1997

1996
Minimum gossip bus networks.
Networks, 1996

Local Memory Requirement of Universal Routing Schemes.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1995
Antepenultimate broadcasting.
Networks, 1995

Memory Requirement for Universal Routing Schemes.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Structured communication in torus networks.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer.
IEEE Trans. Parallel Distrib. Syst., 1994

Broadcasting and Gossiping in de Bruijn Networks.
SIAM J. Comput., 1994

Methods and problems of communication in usual networks.
Discrete Applied Mathematics, 1994

A Characterization of Networks Supporting Linear Interval Routing.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Multicasting in Meshes.
Proceedings of the 1994 International Conference on Parallel Processing, 1994

Optimal Interval Routing.
Proceedings of the Parallel Processing: CONPAR 94, 1994

1993
Open Problems.
Parallel Processing Letters, 1993

Scheduling a Scattering-Gathering Sequence on Hypercubes.
Parallel Processing Letters, 1993

Finding a Target Subnetwork in Sparse Networks with Random Faults.
Inf. Process. Lett., 1993

Disjoint Spanning Trees of Small Depth.
Proceedings of the Parallel Computing: Trends and Applications, 1993

1992
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers.
IEEE Trans. Computers, 1992

Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities.
J. Parallel Distrib. Comput., 1992

1991
Broadcasting in a Hypercube when Some Calls Fail.
Inf. Process. Lett., 1991

Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks.
Proceedings of the International Conference on Parallel Processing, 1991

Fault-Tolerant Gossiping on Hypercube Multicomputers.
Proceedings of the Distributed Memory Computing, 2nd Euronean Conference, 1991

1990
Scattering on a ring of processors.
Parallel Computing, 1990

Finding the roots of a polynomial on an MIMD multicomputer.
Parallel Computing, 1990

A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial.
Proceedings of the CONPAR 90, 1990

Communications intensives dans les architectures a memoire distribuee et algorithmes paralleles pour la recherche de racines de polynomes.
PhD thesis, 1990


  Loading...