• Search: "Analysis of algorithms and problem complexity"

Showing 41 - 60 of 12,834

41

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule: Strongly convergent inertial proximal point algorithm without on-line rule
Jolaoso, Lateef O. ; Shehu, Yekini ; Yao, Jen-Chih
Journal of Optimization Theory and Applications. 200:555-584

strong convergence Hilbert spaces Convex programming Discrete approximations... Nonlinear programming Analysis of algorithms a... …
Academic journal
Save to List
42

Query lower bounds for log-concave sampling
Sinho Chewi ; Jaume de Dios Pont ; Jerry Li ; et al.
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). :2139-2148

block Krylov FOS: Computer and inform... Computer Science - Machi... Analysis of algorithms a... Learning and adaptive sy... matrix-vector queries …
Academic journal
Save to List
43

On the width of complicated JSJ decompositions
Sur la largeur des décompositions JSJ compliquées
Huszár, Kristóf ; Spreer, Jonathan ; Laboratoire de l'Informatique du Parallélisme (LIP) ; et al.
39th International Symposium on Computational Geometry (SoCG 2023). :42-42

Dallas, United States generalized Heegaard spl... fixed-parameter tractabi... computational 3-manifold... triangulations treewidth …
Conference
Save to List
44

The Parallel Complexity of Coloring Games
Ducoffe, Guillaume ; Combinatorics, Optimization and Algorithms for Telecommunications (COATI) ; Centre Inria d'Université Côte d'Azur ; et al.
9th International Symposium. :27-39

Liverpool, United Kingdo... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... [INFO.INFO-CC]Computer S... …
Conference
Save to List
45

A Sequent Calculus for a Modal Logic on Finite Data Trees
Baelde, David ; Lunel, Simon ; Schmitz, Sylvain ; et al.
CSL 2016. :1-16

Marseille, France XPath proof systems modal logic complexity ACM: F.: Theory of Compu... …
Conference
Save to List
46

Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
Lucarelli, Giorgio ; Kim Thang, Nguyen ; Srivastav, Abhinav ; et al.
European Symposium on Algorithms (ESA 2016). :1-17

Aarhus, Denmark Primal-dual algorithms Online algorithms Non-preemptive schedulin... Resource augmentation ACM: F.: Theory of Compu... …
Conference
Save to List
47

On the Complexity of Computing Treebreadth
Ducoffe, Guillaume ; Legay, Sylvain ; Nisse, Nicolas ; et al.
27th International Workshop on Combinatorial Algorithms. :3-15

Helsinki, Finland ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... [INFO.INFO-CC]Computer S... …
Conference
Save to List
48

The Complexity of Coverability in ν-Petri Nets
Lazić, Ranko ; Schmitz, Sylvain ; Centre for Discrete Mathematics and its Applications [Warwick] (DIMAP) ; et al.
LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science. :467-476

New York, United States Well-structured transiti... Formal verification Well-quasi-order Order ideal Fast-growing complexity …
Conference
Save to List
49

Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes
Meyer, Antoine ; Modeste, Simon ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; et al.

Lille, France complexité algorithme problème didactique ACM: F.: Theory of Compu... …
Conference
Save to List
50

A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan ; et al.
Mathematical Programming: A Publication of the Mathematical Optimization Society. :1-24

Academic journal
Save to List
51

The algorithm and complexity of co-secure domination in geometric intersection graphs
Wang, Cai-Xia ; Yang, Yu ; Xu, Shou-Jun
Computational and Applied Mathematics. 44

Vertex subsets with spec... co-secure domination Analysis of algorithms a... geometric intersection g... APX-hard approximation algorithm …
Academic journal
Save to List
52

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams: Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
Arijit Bishnu ; Arijit Ghosh ; Sudeshna Kolay ; et al.
Theory of Computing Systems. 67:1241-1267

streaming algorithms Analysis of algorithms a... FPT Combinatorial Optimizati... Constraint Satisfaction... 0102 computer and inform... …
Academic journal
Save to List
53

An attack on a key exchange protocol based on max-times and min-times algebras
Ivan Buchinskiy ; Matvei Kotov ; Alexander Treier
Indian Journal of Pure and Applied Mathematics. 56:180-190

Programming in abstract... key exchange protocol matrix powers Analysis of algorithms a... max-times algebra Cryptography …
Academic journal
Save to List
54

Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Fürer, Martin ; Hoppen, Carlos ; Trevisan, Vilmar ; et al.
Theoretical Computer Science. 1040:115187

Computer Science - Symbo... FOS: Computer and inform... Treewidth Analysis of algorithms a... G.2.2 0102 computer and inform... …
Academic journal
Save to List
55

Relationship between superstring and compression measures: New insights on the greedy conjecture
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
Discrete Applied Mathematics. 245:59-64

Approximation algorithm Shortest Common Superstr... Stringology Data compression Assembly Greedy conjecture …
Journal
Save to List
56

Zentralitätsmaßnahmen für die Evakuierung: so finden Sie agile Evakuierungsrouten
Centrality measures for evacuation: Finding agile evacuation routes
Medidas de centralidad para la evacuación. Cómo encontrar rutas de evacuación ágil
Mesures de centralité pour l'évacuation: comment trouver des itinéraires d'évacuation agiles
Misure di centralita per l'evacuazione. Come trovare percorsi di evacuazione agili
Lujak, Marin ; Giordani, Stefano ; Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai) ; et al.
Future Generation Computer Systems. 83:401-412

ACM: I.: Computing Metho... I.2: ARTIFICIAL INTELLIG... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Journal
Save to List
57

Malleable task-graph scheduling with a practical speed-up model
Marchal, Loris ; Simon, Bertrand ; Sinnen, Oliver ; et al.
IEEE Transactions on Parallel and Distributed Systems. 29(6):1357-1370

malleable tasks task graph Scheduling proportional mapping approximation algorithms speedup model …
Journal
Save to List
58

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
Blin, Lélia ; Tixeuil, Sébastien ; Université d'Évry-Val-d'Essonne (UEVE) ; et al.
Distributed Computing. 31(2):139-166

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Journal
Save to List
59

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots
Balabonski, Thibaut ; Courtieu, Pierre ; Pelle, Robin ; et al.
[Research Report] Sorbonne Université. :1-12

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Save to List
60

The Ideal View on Rackoff's Coverability Technique
Lazić, Ranko ; Schmitz, Sylvain ; University of Warwick [Coventry] ; et al.
RP 2015 - 9th International Workshop on Reachability Problems. :1-13

Warsaw, Poland complexity ideal well-quasi-order vector addition system ACM: F.: Theory of Compu... …
Conference
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter