Author of the publication

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries.

, , , , and . Theor. Comput. Sci., 261 (1): 119-156 (2001)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Testing consistency of quartet topologies: a parameterized approach., , and . Inf. Process. Lett., 113 (22-24): 852-857 (2013)Exact algorithms for problems related to the densest k-set problem., , , , and . Inf. Process. Lett., 114 (9): 510-513 (2014)Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)., , , and . Dagstuhl Reports, 4 (11): 1-21 (2014)Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries., , , , and . Theor. Comput. Sci., 261 (1): 119-156 (2001)The online knapsack problem: Advice and randomization., , , and . Theor. Comput. Sci., (2014)Fast exact algorithm for L(2, 1)-labeling of graphs., , , , and . Theor. Comput. Sci., (2013)Fast Dynamic Programming on Graph Decompositions., , , , and . CoRR, (2018)An Automata Approach to Some Problems on Context-Free Grammars., and . Foundations of Computer Science: Potential - Theory - Cognition, volume 1337 of Lecture Notes in Computer Science, page 143-152. Springer, (1997)Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries., , , , and . ALT, volume 1316 of Lecture Notes in Computer Science, page 260-276. Springer, (1997)Learning from Random Text.. ALT, volume 1720 of Lecture Notes in Computer Science, page 132-144. Springer, (1999)