• Search: "Analysis of algorithms and problem complexity"

Showing 121 - 140 of 13,067

121

Minimum delay Data Gathering in Radio Networks
Bermond, Jean-Claude ; Nisse, Nicolas ; Reyes, Patricio ; et al.
ADHOC-NOW 2009 - 8th international conference on Ad Hoc Networks and Wireless. :69-82

Murcia, Spain ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.2: Network Protocols C.2.2.3: Routing protoco... ACM: G.: Mathematics of... …
Conference
Save to List
122

Upper Bounds on Stream I/O Using Semantic Interpretations
Gaboardi, Marco ; Péchoux, Romain ; Dipartimento di Informatica [Torino] ; et al.
23rd international Workshop on Computer Science Logic. :271-286

Coimbra, Portugal ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.0: General [INFO.INFO-CC]Computer S... Computational Complexity...
Conference
Save to List
123

Appearance-guided Synthesis of Element Arrangements by Example
Hurtut, Thomas ; Landes, Pierre-Edouard ; Thollot, Joëlle ; et al.
NPAR 2009 - 7th International Symposium on Non-Photorealistic Animation and Rendering. :51-60

New Orleans, LA, United... NPR by-example synthesis Vector texture synthesis ACM: I.: Computing Metho... I.3: COMPUTER GRAPHICS …
Conference
Save to List
124

Univariate Algebraic Kernel and Application to Arrangements
Lazard, Sylvain ; Peñaranda, Luis, Mariano ; Tsigaridas, Elias P., P. ; et al.
8th International Symposium SEA 2009. :209-220

Dortmund, Germany ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... I.1.2: Algorithms …
Conference
Save to List
125

Approximating Acyclicity Parameters of Sparse Hypergraphs
Fomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M. ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :445-456

Freiburg, Germany Graph hypergraph hypertree width treewidth ACM: F.: Theory of Compu... …
Conference
Save to List
126

Shortest Paths Avoiding Forbidden Subpaths
Ahmed, Mustaq ; Lubiw, Anna ; David R. Cheriton School of Computer Science ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :63-74

Freiburg, Germany Algorithms and data stru... Graph algorithms Optical networks ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Conference
Save to List
127

Quantum Query Complexity of Multilinear Identity Testing
Arvind, V. ; Mukhopadhyay, Partha ; The Institue of Mathematical Sciences ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :87-98

Freiburg, Germany Quantum Algorithm Identity Testing Query Complexity Multilinear Polynomials ACM: F.: Theory of Compu... …
Conference
Save to List
128

Lower Bounds for Multi-Pass Processing of Multiple Data Streams
Schweikardt, Nicole ; Institut für Informatik ; Goethe University Frankfurt = Goethe-Universität Frankfurt am Main ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :51-62

Freiburg, Germany data streams lower bounds machine models automata the set disjointness pro... …
Conference
Save to List
129

Generating Shorter Bases for Hard Random Lattices
Alwen, Joël ; Peikert, Chris ; New York University ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :75-86

Freiburg, Germany lattices random short basis average-case hardness Hermite normal form …
Conference
Save to List
130

Economical Caching
Englert, Matthias ; Röglin, Heiko ; Spönemann, Jacob ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :385-396

Freiburg, Germany Online Algorithms Competitive Analysis Storage Management ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... …
Conference
Save to List
131

A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Fellows, Michael R. ; Guo, Jiong ; Moser, Hannes ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :409-420

Freiburg, Germany graph problems kernelization combinatorial optimizati... fixed-parameter tractabi... W[2]-completeness …
Conference
Save to List
132

Efficient Isomorphism Testing for a Class of Group Extensions
Le Gall, François ; ERATO-SORST Quantum Computation and Information Project ; Japan Science and Technology Agency ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :625-636

Freiburg, Germany polynomial-time algorith... group isomorphism black-box groups ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Conference
Save to List
133

Polynomial Kernelizations for MIN F+PI 1 and MAX NP
Kratsch, Stefan ; Max-Planck-Institut für Informatik (MPII) ; Max-Planck-Gesellschaft ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :601-612

Freiburg, Germany parameterized complexity kernelization approximation algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Conference
Save to List
134

On the Average Complexity of Moore's State Minimization Algorithm
Bassino, Frédérique ; David, Julien ; Nicaud, Cyril ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :123-134

Freiburg, Germany finite automata state minimization Moore's algorithm average complexity ACM: F.: Theory of Compu... …
Conference
Save to List
135

Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). :99-113

attachment models random graph generation k-trees ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Book
Save to List
136

Nearly Optimal Communication and Query Complexity of Bipartite Matching
Blikstad, Joakim ; Van Den Brand, Jan ; Efron, Yuval ; et al.
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). :1174-1185

FOS: Computer and inform... Computer Science - Compu... F.1.1 Models of Computat... F.2 Analysis of Algorith... Computer Science - Data... Data Structures and Algo... …
Academic journal
Save to List
137

Killing a Vortex: Killing a vortex
Dimitrios M. Thilikos ; Sebastian Wiederrecht
Journal of the ACM. 71:1-56

FOS: Computer and inform... Discrete Mathematics (cs... Analysis of algorithms a... Graph minors G.2.1 05C83, 05C85, 68R05, 68R... …
Academic journal
Save to List
138

More on change-making and related problems
Gao, Younan ; He, Meng ; Nekrich, Yakov ; et al.
Journal of Computer and System Sciences. 124:159-169

Frobenius problem FOS: Computer and inform... Combinatorial optimizati... Analysis of algorithms a... coin changing Coin changing …
Academic journal
Save to List
139

Characterizations of Polynomial Complexity Classes with a Better Intensionality
Marion, Jean-Yves ; Péchoux, Romain ; Theoretical adverse computations, and safety (CARTE) ; et al.
Proceedings of the 10th international ACM SIGPLAN conference on Principles and Practice of Declarative Programming - PPDP 2008. :79-88

Valencia, Spain static analysis resource upper bounds quasi-interpretation sup-interpretation ACM: F.: Theory of Compu... …
Conference
Save to List
140

Timed Quorum System for Large-Scale and Dynamic Environments
Gramoli, Vincent ; Raynal, Michel ; As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP) ; et al.
11th International Conference On Principles Of Distributed Systems. :429-442

Pointe à Pitre, Guadelou... Probabilistic atomicity Time Quorums Churn Scalability …
Conference
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter