Showing 181 - 200 of 13,067

181

Approximability of open k-monopoly problems: Approximability of open \(k\)-monopoly problems
Sounaka Mishra ; B. Arjuna Krishna ; Shijin Rajakrishnan
Theory of Computing Systems. 65:798-814

Vertex subsets with spec... Graph theory (including... Analysis of algorithms a... open \(k\)-monopolies dominating set 0102 computer and inform...
Academic journal
Save to List
182

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
183

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
184

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
185

Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux ; Sebastian Ordyniak ; Robert Ganian ; et al.
Algorithmica
1201–1221

(directed) feedback vert... parameterized algorithms 1998 ACM Subject Classif... [INFO.INFO-DS] Computer... 0102 computer and inform... 16. Peace & justice
Academic journal
Save to List
186

Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs
Yeh, Hao-Ping ; Lu, Wei ; Chen, Li-Hsuan ; et al.
In Theoretical Computer Science 24 June 2022 922:13-24

Academic journal
Save to List
187

Fast computation of all pairs of geodesic distances
Noyel, Guillaume ; Angulo, Jesus ; Jeulin, Dominique ; et al.
Image Analysis & Stereology. 30(2):101-109

geodesic propagation fast marching All pairs of geodesic di... Mathematical Morphology ACM: G.: Mathematics of... G.1: NUMERICAL ANALYSIS
Journal
Save to List
188

Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity
Faugère, Jean-Charles ; Safey El Din, Mohab ; Spaenlehauer, Pierre-Jean ; et al.
Journal of Symbolic Computation. 46(4):406-437

complexity bihomogeneous ideals algorithms Gröbner bases ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR...
Journal
Save to List
189

On the Uniformity of Peer Sampling based on View Shuffling
Busnel, Yann ; Beraldi, Roberto ; Baldoni, Roberto ; et al.
Journal of Parallel and Distributed Computing. 71(8):1165-1176

Numerical evaluation Stochastic process Theoretical analysis Peer sampling Gossip-based protocol ACM: F.: Theory of Compu...
Journal
Save to List
190

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves
Enge, Andreas ; Gaudry, Pierrick ; Thomé, Emmanuel ; et al.
Journal of Cryptology. 24:24-41

discrete logarithm algebraic curve subexponentiality function field sieve ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA...
Journal
Save to List
191

Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time
Chambers, Erin Wolf ; Colin de Verdière, Eric ; Erickson, Jeff ; et al.
Computational Geometry. 43(3):295-311

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: I.: Computing Metho... [INFO.INFO-CG]Computer S... Computational Geometry [...
Journal
Save to List
192

Computing modular polynomials in quasi-linear time
Enge, Andreas ; Lithe and fast algorithmic number theory (LFANT) ; Institut de Mathématiques de Bordeaux (IMB) ; et al.
Mathematics of Computation. 78(267):1809-1824

ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA... G.4.0: Algorithm design... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit...
Journal
Save to List
193

The complexity of class polynomial computation via floating point approximations
Enge, Andreas ; Algorithmic number theory for cryptology (TANC) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
Mathematics of Computation. 78(266):1089-1107

ACM: G.: Mathematics of... G.4: MATHEMATICAL SOFTWA... G.4.0: Algorithm design... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit...
Journal
Save to List
194

On subset seeds for protein alignment
Roytberg, Mikhail, A. ; Gambin, Anna ; Noé, Laurent ; et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 6(3):483-494

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... F.2.2.3: Pattern matchin... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Journal
Save to List
195

On the Degree of Standard Geometric Predicates for Line Transversals in 3D
Everett, Hazel ; Lazard, Sylvain ; Lenhart, Bill ; et al.
Computational Geometry. 42(5):484-494

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: I.: Computing Metho... I.3: COMPUTER GRAPHICS I.3.7: Three-Dimensional...
Journal
Save to List
196

Automating the Addition of Fault Tolerance with Discrete Controller Synthesis
Girault, Alain ; Rutten, Eric ; Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time (POP ART) ; et al.
Formal Methods in System Design. 35:190-225

ACM: C.: Computer System... C.3: SPECIAL-PURPOSE AND... C.3.2: Real-time and emb... ACM: D.: Software D.3: PROGRAMMING LANGUAG... D.3.2: Language Classifi...
Journal
Save to List
197

The Voronoi diagram of three lines
Everett, Hazel ; Lazard, Daniel ; Lazard, Sylvain ; et al.
Discrete and Computational Geometry. 42(1):94-130

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... [INFO.INFO-CG]Computer S...
Journal
Save to List
198

On the pathwidth of hyperbolic 3-manifolds
Sur la largeur arborescente linéaire des 3-variétés hyperboliques

Huszár, Kristóf ; Understanding the Shape of Data (DATASHAPE) ; Centre Inria d'Université Côte d'Azur ; et al.
Computing in Geometry and Topology. 1(1):1-1

computational 3-manifold... fixed-parameter tractabi... generalized Heegaard spl... pathwidth treewidth hyperbolic 3-manifolds
Journal
Save to List
199

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
Iwamasa, Yuni ; Takazawa, Kenjiro
Mathematical Programming: A Publication of the Mathematical Optimization Society. 194(1-2):229-256

Academic journal
Save to List
200

Efficient Sampling of Random Permutations
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Journal of Discrete Algorithms. 6(1):125-139

random permutations random shuffling coarse grained paralleli... external memory algorith... uniformly generated comm... ACM: F.: Theory of Compu...
Journal
Save to List

Filter