• Suche: "Analysis of algorithms and problem complexity"

Treffer 101 - 120 von 12.834

101

Log-space Algorithms for Paths and Matchings in k-trees
Das, Bireswar ; Datta, Samir ; Nimbhorkar, Prajakta ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :215-226

Nancy, France k-trees reachability matching log-space ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
102

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
Das, Bireswar ; Toran, Jacobo ; Wagner, Fabian ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :227-238

Nancy, France Complexity Algorithms Graph Isomorphism Proble... Treewidth LogCFL …
Konferenz
Zu den Favoriten
103

A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines
Jeż, Łukasz ; Institute of Computer Science ; University of Wrocław [Poland] (UWr) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :489-500

Nancy, France online algorithms scheduling buffer management ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
104

Holant Problems for Regular Graphs with Complex Edge Functions
Kowalczyk, Michael ; Cai, Jin-Yi ; Department of Mathematics and Computer Science ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :525-536

Nancy, France Computational complexity ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.1: Numerical Algorit... [INFO.INFO-CC]Computer S... …
Konferenz
Zu den Favoriten
105

Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Jansen, Maurice ; Institute for Theoretical Computer Science (ITCS) ; Tsinghua University [Beijing] (THU) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :465-476

Nancy, France computational complexity arithmetic circuits hardness-randomness trad... identity testing determinant versus perma... …
Konferenz
Zu den Favoriten
106

AMS Without 4-Wise Independence on Product Domains
Braverman, Vladimir ; Chung, Kai-Min ; Liu, Zhenming ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :119-130

Nancy, France Data Streams Randomized Algorithms Streaming Algorithms Independence Sketches …
Konferenz
Zu den Favoriten
107

The Recognition of Tolerance and Bounded Tolerance Graphs
Mertzios, George B. ; Sau, Ignasi ; Zaks, Shmuel ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :585-596

Nancy, France Tolerance graphs bounded tolerance graphs recognition vertex splitting NPcomplete …
Konferenz
Zu den Favoriten
108

Relaxed spanners for directed disk graphs
Peleg, David ; Roditty, Liam ; Department of Computer Science and Applied Mathematics [Rehovot] ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :609-620

Nancy, France Spanners Directed graphs ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.0: General …
Konferenz
Zu den Favoriten
109

Two-phase algorithms for the parametric shortest path problem
Chakraborty, Sourav ; Fischer, Eldar ; Lachish, Oded ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :167-178

Nancy, France Parametric Algorithms Shortest path problem ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.3: Tradeoffs between... …
Konferenz
Zu den Favoriten
110

On optimal heuristic randomized semidecision procedures, with application to proof complexity
Hirsch, Edward A. ; Itsykson, Dmitry ; St. Petersburg Department of V.A. Steklov Mathematical Institute (PDMI RAS) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :453-464

Nancy, France propositional proof comp... optimal algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... [INFO.INFO-CC]Computer S... …
Konferenz
Zu den Favoriten
111

Construction Sequences and Certifying 3-Connectedness
Schmidt, Jens M. ; Dept. of Computer Science ; Freie Universität Berlin = Free University of Berlin ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :633-644

Nancy, France removable edges Tutte contraction certifying algorithm 3-connected construction sequence …
Konferenz
Zu den Favoriten
112

Alternation-Trading Proofs, Linear Programming, and Lower Bounds
Williams, Ryan ; IBM Almaden Research Center [San Jose] ; IBM ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :669-680

Nancy, France time-space tradeoffs lower bounds alternation linear programming ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
113

Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
Chan, Ho-Leung ; Lam, Tak-Wah ; Lee, Lap-Kei ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :179-190

Nancy, France Algorithms distributed data streams communication efficiency frequent items ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
114

Sponsored Search, Market Equilibria, and the Hungarian Method
Dütting, Paul ; Henzinger, Monika ; Weber, Ingmar ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :287-298

Nancy, France stablematching envy-free allocation general auction mechanis... general position ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
115

Dynamic sharing of a multiple access channel
Bienkowski, Marcin ; Klonowski, Marek ; Korzeniowski, Miroslaw ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :83-94

Nancy, France distributed algorithms multiple access channel mutual exclusion ACM: C.: Computer System... C.1: PROCESSOR ARCHITECT... …
Konferenz
Zu den Favoriten
116

An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
Le Gall, François ; Department of Computer Science ; University of Tokyo [Tokyo] = Tōkyō teikoku daigaku (UTokyo) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :549-560

Nancy, France Quantum Algorithms Group Isomorphism Proble... Black-box Groups ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
117

Online Correlation Clustering
Mathieu, Claire ; Sankur, Ocan ; Schudy, Warren ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :573-584

Nancy, France correlation clustering online algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Konferenz
Zu den Favoriten
118

The tropical double description method
Allamigeon, Xavier ; Gaubert, Stéphane ; Goubault, Eric ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :47-58

Nancy, France convexity in tropical al... algorithmics and combina... computational geometry discrete event systems static analysis …
Konferenz
Zu den Favoriten
119

Communication and Streaming Complexity of Approximate Pattern Matching
Starikovskaya, Tatiana ; Département d'informatique - ENS-PSL (DI-ENS) ; École normale supérieure - Paris (ENS-PSL) ; et al.
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.13⟩

Warsaw, Poland 1998 ACM Subject Classif... 1998 ACM Subject Classif... edit distance randomised algorithms streaming algorithms …
Konferenz
Zu den Favoriten
120

Tabu Split and Merge for the Simplification of Polygonal Curves
Ménier, Gildas ; Marteau, Pierre-François ; Laboratoire de Recherche en Informatique et ses Applications de Vannes et Lorient (VALORIA) ; et al.
IEEE international conference on Systems. :1322-1327

San Antonio, Texas, Unit... dynamic programming Polygonal approximation Tabu search Splitand- Merge top down multi resolutio... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter