Works matching IS 14324350 AND DT 2021 AND VI 65 AND IP 3

Results: 11

Special Issue on Computer Science Symposium in Russia (2019).

Published in:

2021

By:

van Bevern, René;
Kucherov, Gregory

Publication type:

Editorial

On Decidability of Theories of Regular Languages.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 462, doi. 10.1007/s00224-020-09995-4

By:

Dudakov, Sergey;
Karlov, Boris

Publication type:

Article

Forward Looking Huffman Coding.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 593, doi. 10.1007/s00224-020-09992-7

By:

Klein, Shmuel T.;
Saadia, Shoham;
Shapira, Dana

Publication type:

Article

Belga B-Trees.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 541, doi. 10.1007/s00224-020-09991-8

By:

Demaine, Erik D.;
Iacono, John;
Koumoutsos, Grigorios;
Langerman, Stefan

Publication type:

Article

Transition Property for Cube-Free Words.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 479, doi. 10.1007/s00224-020-09979-4

By:

Petrova, Elena A.;
Shur, Arseny M.

Publication type:

Article

Unpopularity Factor in the Marriage and Roommates Problems.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 579, doi. 10.1007/s00224-020-09978-5

By:

Ruangwises, Suthee;
Itoh, Toshiya

Publication type:

Article

Parameterized Complexity of Conflict-Free Set Cover.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 515, doi. 10.1007/s00224-020-10022-9

By:

Jacob, Ashwin;
Majumdar, Diptapriyo;
Raman, Venkatesh

Publication type:

Article

Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 497, doi. 10.1007/s00224-020-10010-z

By:

Das, Bireswar;
Sharma, Shivdutt

Publication type:

Article

On Tseitin Formulas, Read-Once Branching Programs and Treewidth.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 613, doi. 10.1007/s00224-020-10007-8

By:

Glinskih, Ludmila;
Itsykson, Dmitry

Publication type:

Article

The Non-hardness of Approximating Circuit Size.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 559, doi. 10.1007/s00224-020-10004-x

By:

Allender, Eric;
Ilango, Rahul;
Vafa, Neekon

Publication type:

Article

Derandomization for Sliding Window Algorithms with Strict Correctness∗.

Published in:

Theory of Computing Systems, 2021, v. 65, n. 3, p. 1, doi. 10.1007/s00224-020-10000-1

By:

Ganardi, Moses;
Hucke, Danny;
Lohrey, Markus

Publication type:

Article