Showing 121 - 140 of 322

121

Building Efficient and Compact Data Structures for Simplicial Complexe
Boissonnat, Jean-Daniel ; Srikanta, Karthik C. ; Tavenas, Sébastien ; et al.
Algorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩

NP-hard Automaton Compact data structures Simplicial complex ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Journal
Save to List
122

Infinite Unlimited Churn
Foreback, Dianne ; Nesterenko, Mikhail ; Tixeuil, Sébastien ; et al.
[Research Report] LIP6 - Laboratoire d'Informatique de Paris 6; Kent State University. 2016

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.1: Network Architect... C.2.2: Network Protocols C.2.3: Network Operation... C.2.4: Distributed Syste...
Report
Save to List
123

Optimal Mobile Byzantine Fault Tolerant Distributed Storage
Bonomi, Silvia ; del Pozzo, Antonella ; Potop-Butucaru, Maria ; et al.
[Research Report] UPMC - Université Paris 6 Pierre et Marie Curie. 2016

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.0: Complexity of p... F.2.2.1: Computations on... ACM: D.: Software
Report
Save to List
124

A randomized, efficient algorithm for MAX2SAT
Dumitrescu, Cristian ; Chercheur indépendant

NP-complete problems MAX2SAT ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Electronic Resource
Save to List
125

Hierarchical Overlap Graph
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
Information Processing Letters. 155:105862-105862

Aho-Corasik greedy superstring suffix overlap graph assembly
Journal
Save to List
126

Master-slave Tasking on Heterogeneous Processors
Dutot, Pierre-François ; Parallel algorithms and load sharing (APACHE) ; Informatique et Distribution (ID-IMAG) ; et al.
International Parallel and Distributed Processing Symposium, Apr 2003, Nice, France

Scheduling Master-Slave Tasking Algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List
127

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
Courtieu, Pierre ; Rieg, Lionel ; Tixeuil, Sébastien ; et al.
[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015

ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.1: Models of Computa... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro...
Report
Save to List
128

A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.

Delaunay complex witness complex relaxed Delaunay complex distance and incircle pr... simplex quality Lovàsz local lemma
Electronic Resource
Save to List
129

Randomized Initialization of a Wireless Multihop Network
Ravelomanana, Vlady

Computer Science - Distr... Computer Science - Discr... ACM Classification: C.2.... F.2.2 Nonnumerical algor... G.3 Probability and stat...
Report
Save to List
130

Fast Parallel Graph-Search with Splittable and Catenable Frontiers
Acar, Umut A. ; Charguéraud, Arthur ; Rainey, Mike ; et al.
[Technical Report] Inria. 2015

ACM: C.: Computer System... C.1: PROCESSOR ARCHITECT... C.1.4: Parallel Architec... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Report
Save to List
131

Packet Efficient Implementation of the Omega Failure Detector
Bramas, Quentin ; Foreback, Dianne ; Nesterenko, Mikhail ; et al.
[Research Report] UPMC Université Paris VI; Kent State University. 2015

impossibility result packet efficiency distributed algorithm Failure detector ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Report
Save to List
132

Complexity of Token Swapping and its Variants
Bonnet, Edouard ; Miltzow, Tillmann ; Rzążewski, Paweł ; et al.
34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017). :16-16

Hanovre, Germany token swapping parameterized complexity NP-hardness ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
133

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
Olaf Beyersdorff ; Joshua Blinkhorn ; Leroy Chew ; et al.
J Autom Reason
Beyersdorff, O, Blinkhorn, J, Leroy Chew, Schmidt, R & Suda, M 2018, 'Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF', Journal of Automated Reasoning, vol. 63, no. 0, pp. 597–623. https://doi.org/10.1007/s10817-018-9482-4
Journal of Automated Reasoning

Dependency schemes 0202 electrical engineer... DQBF Quantified Boolean formu... 0102 computer and inform... 02 engineering and techn...
Academic journal
Save to List
134

Only distances are required to reconstruct submanifolds
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
[Research Report] INRIA Sophia Antipolis. 2014

Witness complex power protection sampling manifold reconstruction ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Report
Save to List
135

On the complexity of the representation of simplicial complexes by trees
De la difficulté de représenter des complexes simpliciaux par des arbres

Boissonnat, Jean-Daniel ; Mazauric, Dorian ; Geometric computing (GEOMETRICA) ; et al.
[Research Report] RR-8647, Inria Sophia Antipolis; INRIA. 2014

tree representations approximation algorithms NP-complete simplicial complexes hypergraphs ACM: F.: Theory of Compu...
Report
Save to List
136

Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm
Balabonski, Thibaut ; Delga, Amélie ; Rieg, Lionel ; et al.
International Symposium on Stabilization. :7-19

Lyon, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... F.2.2.0: Complexity of p...
Conference
Save to List
137

Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper)
Bramas, Quentin ; Tixeuil, Sébastien ; Networks and Performance Analysis (NPA) ; et al.
International Symposium on Stabilization. :88-93

Lyon, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.1: Computations on... F.2.2.2: Geometrical pro...
Conference
Save to List
138

Parameterized Hardness of Art Gallery Problems
Bonnet, Edouard ; Miltzow, Tillmann ; Computer and Automation Research Institute [Budapest] (MTA SZTAKI )
24th European Symposium on Algorithms (ESA 2016). :19-19

Aarhus, Denmark ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CC]Computer S... Computational Complexity...
Conference
Save to List
139

Decomposition of multihomogeneous polynomials: minimal number of variables
Berthomieu, Jérémy ; Polynomial Systems (PolSys) ; Laboratoire d'Informatique de Paris 6 (LIP6) ; et al.

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-SC]Computer S... Symbolic Computation [cs...
Electronic Resource
Save to List
140

A probabilistic algorithm to compute the real dimension of a semi-algebraic set
Safey El Din, Mohab ; Tsigaridas, Elias ; Polynomial Systems (PolSys) ; et al.

symbolic computation complexity Effective real algebraic... real dimension ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR...
Electronic Resource
Save to List

Filter