Result 81 to 100 of 739 total
Concatenation of regular languages and descriptional complexity. (English)
Theory Comput. Syst. 49, No. 2, 306-318 (2011).
81
Lower bounds for the determinantal complexity of explicit low degree polynomials. (English)
Theory Comput. Syst. 49, No. 2, 343-354 (2011).
82
Compressed word problems in HNN-extensions and amalgamated products. (English)
Theory Comput. Syst. 49, No. 2, 283-305 (2011).
83
Querying data sources that export infinite sets of views. (English)
Theory Comput. Syst. 49, No. 2, 367-428 (2011).
84
New plain-exponential time classes for graph homomorphism. (English)
Theory Comput. Syst. 49, No. 2, 273-282 (2011).
85
On the complexity of matroid isomorphism problem. (English)
Theory Comput. Syst. 49, No. 2, 246-272 (2011).
86
Query languages for data exchange: beyond unions of conjunctive queries. (English)
Theory Comput. Syst. 49, No. 2, 489-564 (2011).
87
Special issue: Computability in Europe. Selected papers based on the presentations at the conference CiE 2008, logic and theory of algorithms, Athens, Greece, June 2008. (English)
Theory Comput. Syst. 48, No. 3, 614-729 (2011).
88
Special issue: 12th international conference on database theory. Selected papers based on the presentations at the conference, St. Petersburg, Russia, March 23‒25, 2009. (English)
Theory Comput. Syst. 49, No. 2, 365-564 (2011).
89
Special issue: International symposium on computer science in Russia (CSR 2009). Selected papers based on the presentations at the symposium, Novosibirsk Akademgorodok, Russia, August 19‒23, 2009. (English)
Theory Comput. Syst. 49, No. 2, 225-364 (2011).
90
Special issue: Algorithmic game theory (SAGT 2009). Selected papers based on the presentations at the 2nd international symposium Paphos, Cyprus, October 18‒20, 2009. (English)
Theory Comput. Syst. 49, No. 1, 223~p. (2011).
91
Algorithms for finding a most similar subforest. (English)
Theory Comput. Syst. 48, No. 4, 865-887 (2011).
92
Straight-line instruction sequence completeness for total calculation on cancellation meadows. (English)
Theory Comput. Syst. 48, No. 4, 840-864 (2011).
93
Lower bounds for kernelizations and other preprocessing procedures. (English)
Theory Comput. Syst. 48, No. 4, 803-839 (2011).
94
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. (English)
Theory Comput. Syst. 48, No. 4, 731-766 (2011).
95
Semi-online preemptive scheduling: one algorithm for all variants. (English)
Theory Comput. Syst. 48, No. 3, 577-613 (2011).
96
Weak MSO with the unbounding quantifier. (English)
Theory Comput. Syst. 48, No. 3, 554-576 (2011).
97
Generating shorter bases for hard random lattices. (English)
Theory Comput. Syst. 48, No. 3, 535-553 (2011).
98
Ambiguity and communication. (English)
Theory Comput. Syst. 48, No. 3, 517-534 (2011).
99
Fragments of first-order logic over infinite words. (English)
Theory Comput. Syst. 48, No. 3, 486-516 (2011).
100
Result 81 to 100 of 739 total
Start
Contact
Print
General Help
