( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
LALR(k) Testing is PSPACE-Complete

, и . STOC, стр. 202-206. ACM, (1981)

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.

Barbara Eljaschewitsch

Minna Eljasch

Josef Eljaschewitsch

Michael Eljaschoff

Julij Eljaschewitsch

 

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

Practical Error Recovery in LR Parsing., и . POPL, стр. 177-184. ACM Press, (1982)Efficient Evaluation for a Subset of Recursive Queries., , и . PODS, стр. 284-293. ACM, (1987)Locling Policies and Predeclared Transactions., и . MFDBS, том 364 из Lecture Notes in Computer Science, стр. 317-336. Springer, (1989)Transitive closure algorithm MEMTC and its performance analysis., , и . Discret. Appl. Math., 110 (1): 77-84 (2001)Avoiding Redundant Computations in Evaluating Linear Queries., и . Australasian Database Conference, стр. 124-135. Global Publications Service, Singapore; Distributed by World Scientific, (1994)Concurrency Control for B-Trees with Differential Indices., , и . IDEAS, стр. 287-295. IEEE Computer Society, (2000)On Structural Similarity of Context-Free Grammars., и . MFCS, том 118 из Lecture Notes in Computer Science, стр. 491-498. Springer, (1981)The Compiler Writing System HLP (Helsinki Language Processor), , , и . report, A-1978-2. Department of Comp. Sc., University of Helsinki, (марта 1978)An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems., и . PODS, стр. 108-116. ACM, (1982)On Classification of Strings., и . SPIRE, том 3246 из Lecture Notes in Computer Science, стр. 321-330. Springer, (2004)