• Search: "Analysis of algorithms and problem complexity"

Showing 61 - 80 of 12,834

61

A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations
Boissonnat, Jean-Daniel ; Dyer, Ramsay ; Ghosh, Arijit ; et al.
Algorithms - ESA 2015. :595-606

Patras, Greece Lovász local lemma simplex quality distance and incircle pr... relaxed Delaunay complex witness complex …
Conference
Save to List
62

Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets
Bannwarth, Ivan ; Safey El Din, Mohab ; Polynomial Systems (PolSys) ; et al.
ISSAC'15 - 40th International Symposium on Symbolic and Algebraic Computation. :37-44

Bath, United Kingdom Real solutions Polynomial systems Real Geometry General Te... Theory Real dimension …
Conference
Save to List
63

Optimal Torus Exploration by Oblivious Robots
Devismes, Stéphane ; Lamani, Anissa ; Petit, Franck ; et al.
NETYS 2015 - Third International Conference on Networked Systems. :183-199

Agadir, Morocco Oblivious Exploration Torus Robot ACM: F.: Theory of Compu... …
Conference
Save to List
64

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG
Manuel Cáceres ; Brendan Mumey ; Edin Husić ; et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics

graph algorithms 0301 basic medicine Computer and information... Genome Base Sequence 0206 medical engineering …
Academic journal
Save to List
65

Cut Query Algorithms with Star Contraction
Apers, Simon ; Efron, Yuval ; Gawrychowski, Pawel ; et al.
Apers, S, Efron, Y, Gawrychowski, P, Lee, T, Mukhopadhyay, S & Nanongkai, D 2022, Cut Query Algorithms with Star Contraction . in Proceedings-2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 . IEEE Computer Society Press, Proceedings-Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 2022-October, pp. 507-518, 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, United States, 31/10/2022 . https://doi.org/10.1109/FOCS54457.2022.00055

FOS: Computer and inform... Quantum Physics F.2 Analysis of Algorith... FOS: Physical sciences [INFO.INFO-DS] Computer... F.1.3 Complexity Measure... …
Academic journal
Save to List
66

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
Frank E. Curtis ; Michael J. O’Neill ; Daniel P. Robinson
Mathematical Programming. 205:431-483

Analysis of algorithms a... 0211 other engineering a... Stochastic programming 02 engineering and techn... stochastic optimization nonlinear optimization …
Academic journal
Save to List
67

Efficient methods of calculating the number of heapable permutations
Benjamin Chen ; Michael Cho ; Mario Tutuncu-Macias ; et al.
Discrete Applied Mathematics. 331:126-137

Permutations, words, mat... heapable permutations Analysis of algorithms a... binary heaps 0102 computer and inform... 0101 mathematics …
Academic journal
Save to List
68

Multi-Round Cooperative Search Games with Multiple Players
Korman, Amos ; Rodeh, Yoav ; Networks, Graphs and Algorithms (GANG) ; et al.
ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming, Jul 2019, Patras, Greece

Patras, Greece ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-DC]Computer S... Distributed, Parallel, a... [INFO.INFO-GT]Computer S... …
Conference
Save to List
69

Grundy Distinguishes Treewidth from Pathwidth: Grundy distinguishes treewidth from pathwidth
Rémy Belmonte ; Eun Jung Kim ; Michael Lampis ; et al.
SIAM Journal on Discrete Mathematics. 36:1761-1787

Computational Geometry (... FOS: Computer and inform... Treewidth Analysis of algorithms a... minimum enclosing ball Parameterized complexity... …
Academic journal
Save to List
70

Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
PSC: Prague Stringology Conference. :148-161

Prague, Czech Republic MAX-SNP subset system conjecture overlap graph prefix graph …
Conference
Save to List
71

Sub-cubic Change of Ordering for Gröner Basis: A Probabilistic Approach
Faugère, Jean-Charles ; Gaudry, Pierrick ; Huot, Louise ; et al.
ISSAC '14 - 39th International Symposium on Symbolic and Algebraic Computation. :170-177

Kobe, Japan ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... …
Conference
Save to List
72

Modeling parsimonious putative regulatory networks: complexity and heuristic approach
Acuña, Vicente ; Aravena, Andrés ; Maass, Alejandro ; et al.
15th conference in Verification. :322-336

San Diego, United States ACM: J.: Computer Applic... J.3: LIFE AND MEDICAL SC... J.3.0: Biology and genet... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Conference
Save to List
73

Improved Bounds for the Expected Number of k-Sets: Improved bounds for the expected number of \(k\)-sets
Brett Leroux ; Luis Rademacher
Discrete & Computational Geometry. 70:790-815

Lattices and convex bodi... random point configurati... Analysis of algorithms a... Probability (math.PR) Metric Geometry (math.MG... 52C05, 52C10, 05C30, 60D... …
Academic journal
Save to List
74

The sandwich problem for odd-hole-free and even-hole-free graphs
Kathie Cameron ; Aristotelis Chaniotis ; Celina M.H. de Figueiredo ; et al.
Discrete Mathematics. 348:114383

even-hole-free graphs FOS: Computer and inform... Discrete Mathematics (cs... Graph algorithms (graph-... Analysis of algorithms a... forbidden induced subgra... …
Academic journal
Save to List
75

The complexity of data aggregation in static and dynamic wireless sensor networks
Bramas, Quentin ; Tixeuil, Sébastien ; Networks and Performance Analysis (NPA) ; et al.
Information and Computation. 255(3):369-383

Dynamic graphs Complexity Data aggregation ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software …
Journal
Save to List
76

On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems
Faugère, Jean-Charles ; Safey El Din, Mohab ; Verron, Thibaut ; et al.
The 38th International Symposium on Symbolic and Algebraic Computation. :189-196

Boston, Maine, United St... Polynomial system solvin... Quasi-homogeneous polyno... Gröbner bases ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... …
Conference
Save to List
77

Approximating Multidimensional Subset Sum and the Minkowski Decomposition of Polygons
Emiris, Ioannis, Z. ; Karasoulou, Anna ; Tzovas, Charilaos ; et al.
Mathematics in Computer Science. 11:35-48

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics …
Journal
Save to List
78

Some mathematical remarks on the polynomial selection in NFS
Barbulescu, Razvan ; Lachand, Armand ; Cryptology, arithmetic : algebraic methods for better algorithms (CARAMBA) ; et al.
Mathematics of Computation. 86:397-418

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CR]Computer S... Cryptography and Securit... [MATH.MATH-NT]Mathematic... …
Journal
Save to List
79

Accurate self-correction of errors in long reads using de Bruijn graphs
Salmela, Leena ; Walve, Riku ; Rivals, Eric ; et al.
Bioinformatics. 33(6):799-806

substitution Sequence analysis PacBio DNA NGS de Bruijn …
Journal
Save to List
80

A Penalized Best-Response Algorithm for Non-Linear Single-Path Routing Problems
Brun, Olivier ; Prabhu, Balakrishna ; Vallet, Josselin ; et al.
Networks. 69(1):52-66

Approximation algorithms best response single-path routing game theory non-linear programming Nash equilibrium …
Journal
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter