( en | de | ru )

 

Disambiguation of "Sudborough, Ivan Hal"

Author of the publication

copydeleteadd this publication to your clipboard
New lower bounds for permutation arrays using contraction.

, , , , and . Des. Codes Cryptogr., 87 (9): 2105-2128 (2019)

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.

Roy Hal

Wilhelm Hal

Sarah Ivanovas

Svilen Ivanov

Natalie Ivanits

 

Other publications of authors with the same name

On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space., and . Theor. Comput. Sci., (1982)Bandwidth Constraints on Problems Complete for Polynomial Time.. Theor. Comput. Sci., (1983)A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions., , and . Theor. Comput. Sci., 210 (2): 327-339 (1999)Bounding prefix transposition distance for strings and permutations., and . Theor. Comput. Sci., (2012)On the Complexity of Single Row Routing Problems., and . WADS, volume 382 of Lecture Notes in Computer Science, page 529-540. Springer, (1989)Efficient Mappings of Pyramid Networks., and . IEEE Trans. Parallel Distributed Syst., 5 (10): 1009-1017 (1994)Separating Tape Bounded Auxiliary Pushdown Automata Classes. STOC, page 208-217. ACM, (1977)The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.. WG, volume 100 of Lecture Notes in Computer Science, page 293-305. Springer, (1980)Simulation Permutation Networks on Hypercubes., , , and . LATIN, volume 583 of Lecture Notes in Computer Science, page 61-70. Springer, (1992)On Families of Languages Defined by Time-Bounded Random Access Machines., and . MFCS, page 333-338. Mathematical Institute of the Slovak Academy of Sciences, (1973)