( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue.

, , , , , , и . Theor. Comput. Sci., (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Uta Jez

Günther Jezewski

Katarzyna Jezierska

Stefan Jezierski

Horst Adalbert Jezierski

 

Другие публикации лиц с тем же именем

Unambiguous Conjunctive Grammars over a One-Letter Alphabet., и . Developments in Language Theory, том 7907 из Lecture Notes in Computer Science, стр. 277-288. Springer, (2013)A really Simple Approximation of Smallest Grammar.. CPM, том 8486 из Lecture Notes in Computer Science, стр. 182-191. Springer, (2014)On the Computational Completeness of Equations over Sets of Natural Numbers., и . ICALP (2), том 5126 из Lecture Notes in Computer Science, стр. 63-74. Springer, (2008)Recompression: Technique for Word Equations and Compressed Data.. LATA, том 12038 из Lecture Notes in Computer Science, стр. 44-67. Springer, (2020)Length-reducing Automata (almost) without Auxiliary Symbols., и . Journal of Automata, Languages and Combinatorics, 16 (2-4): 141-164 (2011)Unambiguous conjunctive grammars over a one-symbol alphabet., и . Theor. Comput. Sci., (2017)Approximation of Grammar-Based Compression via Recompression.. CPM, том 7922 из Lecture Notes in Computer Science, стр. 165-176. Springer, (2013)Balancing Straight-Line Programs., , и . FOCS, стр. 1169-1183. IEEE Computer Society, (2019)A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue., , , , , , и . Theor. Comput. Sci., (2013)Finding all solutions of equations in free groups and monoids with involution., , и . Inf. Comput., (2016)