Showing 61 - 80 of 321

61

Hadwiger and Helly-type theorems for disjoint unit spheres in R3
Cheong, Otfried ; Goaoc, Xavier ; Holmsen, Andreas ; et al.
21st Annual ACM Symposium on Computational Geometry 2005 (SoCG'05 ). :10-15

Pisa, Italy unit sphere unit ball line transversal Helly theorem Hadwiger theorem
Conference
Save to List
62

Automata Column: The Complexity of Reachability in Vector Addition Systems
Schmitz, Sylvain ; Verification in databases (DAHU) ; Laboratoire Spécification et Vérification [Cachan] (LSV) ; et al.
ACM SIGLOG News. 3(1):3-21

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.3: LOGICS AND MEANINGS... F.3.1: Specifying and Ve... [INFO.INFO-LO]Computer S...
Journal
Save to List
63

Efficiently navigating a random Delaunay triangulation
Broutin, Nicolas ; Devillers, Olivier ; Hemsley, Ross ; et al.
Random Structures and Algorithms. 49(1):95-136

random analysis point location routing Delaunay triangulation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Journal
Save to List
64

Formalizing Convex Hulls Algorithms
Formalisation d'algorithmes d'enveloppes convexes

Pichardie, David ; Bertot, Yves ; Logiciel : ANalyse et DEveloppement (Lande) ; et al.
TPHOLs 2001 - 14th International Conference Theorem Proving in Higher Order Logics. :346-361

Edinburgh, United Kingdo... ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.1: Specifying and Ve... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi...
Conference
Save to List
65

Scheduling on hierarchical clusters using malleable tasks
Dutot, Pierre-François ; Trystram, Denis ; Parallel algorithms and load sharing (APACHE) ; et al.
Symposium on Parallel Algorithms and Architectures. :199-208

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.5: Sequencing and... [INFO.INFO-DC]Computer S... Distributed, Parallel, a...
Conference
Save to List
66

On the complexity of the F5 Gröbner basis algorithm
Bardet, Magali ; Faugère, Jean-Charles ; Salvy, Bruno ; et al.
Journal of Symbolic Computation. 70:49-70

Gröbner bases Regular Sequences Noether Position F5 algorithm Complexity ACM: F.: Theory of Compu...
Journal
Save to List
67

Towards a Realistic Analysis of Some Popular Sorting Algorithms
Clément, Julien ; Nguyen Thi, Thu Hien ; Vallée, Brigitte ; et al.
Combinatorics. 24(01):104-144

Primary 68W32, 68P10, 68... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.6: Sorting and sea... [INFO.INFO-DS]Computer S...
Journal
Save to List
68

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs
Antunes, Daniel ; Mathieu, Claire ; Mustafa, Nabil ; et al.
25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩

Vienna, Austria Combinatorial Optimizati... Expansion Hall's Theorem Local Search Planar Graphs
Conference
Save to List
69

Fine-grained complexity of coloring unit disks and balls
Biró, Csaba ; Bonnet, Edouard ; Marx, Dániel ; et al.

Brisbane, Australia ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
70

Local Equivalence and Intrinsic Metrics Between Reeb Graphs
Carriere, Mathieu ; Oudot, Steve Y. ; Understanding the Shape of Data (DATASHAPE) ; et al.
International Symposium on Computational Geometry, Jul 2017, Brisbane, Australia

Brisbane, Australia Topological Data Induced Metrics Analysis Reeb Graphs ACM: F.: Theory of Compu...
Conference
Save to List
71

An Efficient Representation for Filtrations of Simplicial Complexes
Boissonnat, Jean-Daniel ; Srikanta, Karthik C. ; Understanding the Shape of Data (DATASHAPE) ; et al.
Symposium on Discrete Algorithms SODA 2017, Jan 2017, Barcelona, France

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

High-dimensional approximate r-nets
Avarikioti, Georgia ; Emiris, Ioannis Z. ; Kavouras, Loukas ; et al.
SODA: ACM/SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelone, Spain

Barcelone, Spain Locality-sensitive hashi... r-nets Approximation algorithms High dimension Metric geometry
Conference
Save to List
73

Regular Separability of Parikh Automata
Clemente, Lorenzo ; Czerwiński, Wojciech ; Lasota, Sławomir ; et al.

Varsovie, Poland separability problem Parikh automata integer vector addition... visible one counter auto... decidability
Conference
Save to List
74

Faster Graph Coloring in Polynomial Space
Gaspers, Serge ; Lee, Edward J.
Algorithmica. 85(2):584-609

Academic journal
Save to List
75

Delaunay Stability via Perturbations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
International Journal of Computational Geometry and Applications. 24:125-152

perturbation stability Delaunay triangulation ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Journal
Save to List
76

The stability of Delaunay triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
International Journal of Computational Geometry and Applications. 23(4-5):303-333

Delaunay triangulation s... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-CG]Computer S...
Journal
Save to List
77

The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields
Barbulescu, Razvan ; Pierrot, Cécile ; Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) ; et al.
LMS Journal of Computation and Mathematics. 17:230-246

Discrete logarithm probl... finite fields number field sieve ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Journal
Save to List
78

Discretized Riemannian Delaunay triangulations
Rouxel-Labbé, Maël ; Wintraecken, M ; Boissonnat, J.-D ; et al.

Washington DC, United St... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.2: Geometrical pro... [INFO.INFO-CG]Computer S...
Conference
Save to List
79

On the Voting Time of the Deterministic Majority Process
Kaaser, Dominik ; Mallmann-Trenn, Frederik ; Natale, Emanuele ; et al.
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Aug 2016, Krakow, Poland. ⟨10.4230/LIPIcs.MFCS.2016.55⟩

Krakow, Poland majority rule distributed voting ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List
80

Bounds on the Voter Model in Dynamic Networks
Berenbrink, Petra ; Giakkoupis, George ; Kermarrec, Anne-Marie ; et al.

Rome, Italy Voting Distributed Computing Conductance Dynamic Graphs Consensus
Conference
Save to List

Filter