Showing 141 - 160 of 4,040

141

Note: Regular languages with no conflicts (forbidden pairs) are regular but have exponential size DFA
Cornet, Alexis ; Laforest, Christian ; Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS) ; et al.
[Research Report] LIMOS (UMR CNRS 6158), université Clermont Auvergne, France 2016

Regular languages DFA forbidden pairs conflicts ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Report
Save to List
142

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
143

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
144

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
145

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
146

Where to begin: on pattern language entry points
Lukas Reinfurt ; Michael Falkenthal ; Frank Leymann ; et al.
SICS Software-Intensive Cyber-Physical Systems. 35:127-139

Nonnumerical Algorithms... Pattern Languages 4. Education Software Engineering Sof... Discrete Mathematics Gra... Internet of Things
Academic journal
Save to List
147

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
148

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
149

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
150

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
151

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
152

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
153

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
154

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
155

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
156

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
157

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
158

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
159

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
160

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

Filter