• Suche: "Analysis of algorithms and problem complexity"

Treffer 81 - 100 von 12.834

81

Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
Aupy, Guillaume ; Herrmann, Julien ; Topology-Aware System-Scale Data Management for High-Performance Computing (TADAAM) ; et al.
Optimization Methods and Software. 32(3):594-624

Automatic differentiatio... Program reversal Adjoint computation Checkpointing Asymptotic optimality Online …
Zeitschrift
Zu den Favoriten
82

Proper Hamiltonian Cycles in Edge-Colored Multigraphs
Águeda, Raquel ; Borozan, Valentin ; Díaz, Raquel ; et al.
Discrete Mathematics. 340(8):1897-1902

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... [INFO.INFO-DM]Computer S... Discrete Mathematics [cs... [INFO.INFO-DS]Computer S... …
Zeitschrift
Zu den Favoriten
83

Impact Of The Energy Model On The Complexity Of RNA Folding With Pseudoknots
Sheikh, Saad ; Backofen, Rolf ; Ponty, Yann ; et al.
CPM - 23rd Annual Symposium on Combinatorial Pattern Matching - 2012. :321-333

Helsinki, Finland RNA folding General pseudoknots Hardness Inapproximability ACM: J.: Computer Applic... …
Konferenz
Zu den Favoriten
84

Anonymous Agreement: The Janus Algorithm
Bouzid, Zohir ; Sutra, Pierre ; Travers, Corentin ; et al.
OPODIS'11 - 15th International Conference On Principles Of Distributed Systems. :175-190

Toulouse, France ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-DC]Computer S... Distributed, Parallel, a...
Konferenz
Zu den Favoriten
85

Restricted coloring problems on graphs with few P4's
Campos, Victor ; Linhares Sales, Claudia ; Maia de Oliviera, Ana Karolinna ; et al.
LAGOS'11 - VI Latin-American Algorithms. :57-62

Bariloche, Argentina ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-DS]Computer S... Data Structures and Algo...
Konferenz
Zu den Favoriten
86

Random polynomials and expected complexity of bisection methods for real solving
Emiris, Ioannis Z. ; Galligo, André ; Tsigaridas, Elias ; et al.
ISSAC. :235-242

Munich, Germany Random polynomial real-root isolation Bernstein polynomial expected complexity separation bound …
Konferenz
Zu den Favoriten
87

The DMM bound: multivariate (aggregate) separation bounds
Emiris, Ioannis Z. ; Mourrain, Bernard ; Tsigaridas, Elias ; et al.
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. :243-250

Munich, Germany separation bound polynomial system mixed volume Milne positive polynomial …
Konferenz
Zu den Favoriten
88

Large-girth roots of graphs
Adamaszek, Anna ; Adamaszek, Michal ; Department of Computer Science and DIMAP ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :35-46

Nancy, France Graph roots Graph powers NP-completeness Recognition algorithms ACM: G.: Mathematics of... …
Konferenz
Zu den Favoriten
89

The Traveling Salesman Problem Under Squared Euclidean Distances
de Berg, Mark ; van Nijnatten, Fred ; Sitters, Rene ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :239-250

Nancy, France APX-hard NP-hard distance-power gradient power-assignment in wire... Geometric traveling sale... …
Konferenz
Zu den Favoriten
90

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :251-262

Nancy, France Parameterized Subexponen... Directed Graphs Out-Branching Internal Out-Branching ACM: G.: Mathematics of... …
Konferenz
Zu den Favoriten
91

Planar Subgraph Isomorphism Revisited
Dorn, Frédéric ; Department of Informatics [Bergen] (UiB) ; University of Bergen (UiB) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :263-274

Nancy, France Graph algorithms Subgraph Isomorphism NP-hard problems Dynamic programming Topological graph theory …
Konferenz
Zu den Favoriten
92

Dispersion in unit disks
Dumitrescu, Adrian ; Jiang, Minghui ; Department of Computer Sciences [Madison] (CS) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :299-310

Nancy, France Dispersion problem linear programming approximation algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
93

Long non-crossing configurations in the plane
Dumitrescu, Adrian ; Tóth, Csaba D. ; Department of Computer Sciences [Madison] (CS) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :311-322

Nancy, France Longest non-crossing Ham... longest non-crossing Ham... longest non-crossing spa... approximation algorithm ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
94

Evasiveness and the Distribution of Prime Numbers
Babai, Laszlo ; Banerjee, Anandam ; Kulkarni, Raghav ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :71-82

Nancy, France decision tree complexity evasiveness graph property group action Dirichlet primes …
Konferenz
Zu den Favoriten
95

The Complexity of Approximating Bounded-Degree Boolean #CSP
Dyer, Martin ; Ann Goldberg, Leslie ; Jalsenius, Markus ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :323-334

Nancy, France Boolean constraint satis... generalized satisfiabili... counting approximation algorithms ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
96

The Remote Point Problem, Small Bias Space, and Expanding Generator Sets
Arvind, Vikraman ; Srinivasan, Srikanth ; Institute of Mathematical Sciences [Chennai] (IMSc) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :59-70

Nancy, France small bias spaces expander graphs cayley graphs remote point problem ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
97

The k-in-a-path problem for claw-free graphs
Fiala, Jiří ; Kamiński, Marcin ; Lidický, Bernard ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :371-382

Nancy, France induced path claw-free graph polynomial-time algorith... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Konferenz
Zu den Favoriten
98

Computing Least Fixed Points of Probabilistic Systems of Polynomials
Esparza, Javier ; Gaiser, Andreas ; Kiefer, Stefan ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :359-370

Nancy, France computing fixed points numerical approximation stochastic model branching processes ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
99

Exact Covers via Determinants
Björklund, Andreas ; Department of Computer Science [Lund] ; Skane University Hospital [Lund] ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :95-106

Nancy, France moderately exponential t... exact set cover k-dimensional matching ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Konferenz
Zu den Favoriten
100

On Iterated Dominance, Matrix Elimination, and Matched Paths
Brandt, Felix ; Fischer, Felix ; Holzer, Markus ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :107-118

Nancy, France Algorithmic Game Theory Computational Complexity Iterated Dominance Matching ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter