Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Thomas G. Szymanski"'
Autor:
Thomas G. Szymanski, Narendra Shenoy
Publikováno v:
The Best of ICCAD ISBN: 9781461350071
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7d1091916ff049716f6b8ba496c0dd5
https://doi.org/10.1007/978-1-4615-0292-0_48
https://doi.org/10.1007/978-1-4615-0292-0_48
Publikováno v:
The Best of ICCAD ISBN: 9781461350071
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::424a4e53430c8be7ec6d422b3fa6387f
https://doi.org/10.1007/978-1-4615-0292-0_38
https://doi.org/10.1007/978-1-4615-0292-0_38
Autor:
Thomas G Szymanski
Publikováno v:
Journal of Algorithms. 6:322-335
We consider the operation of permuting in place the records of an open address hash table in order to correspond to a different hashing function. Our emphasis is primarily on minimizing the amount of work space used. Lower and upper bounds are derive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8991a66c2668299edb753345bf6c53a7
https://doi.org/10.1016/0196-6774(85)90002-1
https://doi.org/10.1016/0196-6774(85)90002-1
Publikováno v:
Communications of the ACM. 20:171-176
Various computations on relations, Boolean matrices, or directed graphs, such as the computation of precedence relations for a context-free grammar, can be done by a practical algorithm that is asymptotically faster than those in common use. For exam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7600f858c6822de2b2b555c9c48e356
https://doi.org/10.1145/359436.359446
https://doi.org/10.1145/359436.359446
Autor:
Thomas G. Szymanski, Bruce W. Leverett
Publikováno v:
ACM Transactions on Programming Languages and Systems. 2:274-289
The assembled length of a span-dependent jump instruction depends on the distance between the instruction and its target. Such instructions are found on many computers and typically have two forms, long and short. We consider the problem of minimizin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7fce942e5d52a3322b32042c87d89fd
https://doi.org/10.1145/357103.357105
https://doi.org/10.1145/357103.357105
Autor:
Thomas G. Szymanski
Publikováno v:
Communications of the ACM. 21:300-308
Many modern computers contain instructions whose lengths depend on the distance from a given instance of such an instruction to the operand of that instruction. This paper considers the problem of minimizing the lengths of programs for such machines.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ce675f3b146b919ffd66a9fd61dd60d
https://doi.org/10.1145/359460.359474
https://doi.org/10.1145/359460.359474
Publikováno v:
IEEE Design & Test of Computers. 2:64-72
Advances in VLSI have resulted in more and more complex circuitry, fueling the need for programs that analyze IC mask artwork. This article describes Goalie, an artwork analysis system, by explaining the algorithms used to support circuit extraction,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cac44f7c02e48b67c1f6d55e6e6d8c83
https://doi.org/10.1109/mdt.1985.294742
https://doi.org/10.1109/mdt.1985.294742
Publikováno v:
SIAM Journal on Computing. 10:405-421
We present an algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors. We then apply this algorithm to synthesize a relational algebra expression from a simple tableau, a problem arising in the theory of relation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7b5fbcfa08cca7fe2c8d00d70802c9b
https://doi.org/10.1137/0210030
https://doi.org/10.1137/0210030
Autor:
Thomas G. Szymanski
Publikováno v:
Theoretical Computer Science. 3:273-282
Consider the problem of testing whether a context-free grammar is an (m, n)-BRC grammar. Let ‖G‖ denote the size of the grammar G. It is first shown that G is (m, n)-BRC if and only if G is (m0, n)-BRC where m0=4·‖G‖2·(n + 1)2. Deterministi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aca369240027f93bd1cb61224b9c575e
https://doi.org/10.1016/0304-3975(76)90046-3
https://doi.org/10.1016/0304-3975(76)90046-3
Autor:
Thomas G. Szymanski, John H. Williams
Publikováno v:
SIAM Journal on Computing. 5:231-250
A bottom-up parsing technique which can make non-leftmost possible reductions in sentential forms is said to be non-canonical. Nearly every existing parsing technique can be extended to a non-canonical method which operates on larger classes of gramm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5f8e6fcdbf5110ea8228214d818c7c8
https://doi.org/10.1137/0205019
https://doi.org/10.1137/0205019