default search action
Ivan Hal Sudborough
Person information
- affiliation: University of Texas at Dallas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j60]Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough:
Improved bounds for permutation arrays under Chebyshev distance. Des. Codes Cryptogr. 92(4): 1023-1039 (2024) - 2023
- [i6]Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough:
Improved Bounds for Permutation Arrays Under Chebyshev Distance. CoRR abs/2302.12855 (2023) - 2022
- [j59]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Using permutation rational functions to obtain permutation arrays with large hamming distance. Des. Codes Cryptogr. 90(7): 1659-1677 (2022) - 2020
- [j58]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. 88(2): 311-339 (2020) - [c60]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. WAIFI 2020: 234-252 - [i5]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. CoRR abs/2003.10072 (2020)
2010 – 2019
- 2019
- [j57]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87(9): 2105-2128 (2019) - [i4]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong:
Equivalence Relations for Computing Permutation Polynomials. CoRR abs/1911.12823 (2019) - 2018
- [j56]Sergey Bereg, Avi Levy, Ivan Hal Sudborough:
Constructing permutation arrays from groups. Des. Codes Cryptogr. 86(5): 1095-1111 (2018) - [i3]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Maximizing Hamming Distance in Contraction of Permutation Arrays. CoRR abs/1804.03768 (2018) - [i2]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Constructing Permutation Arrays using Partition and Extension. CoRR abs/1804.08252 (2018) - 2017
- [j55]Sergey Bereg, Linda Morales, Ivan Hal Sudborough:
Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83(3): 661-683 (2017) - [c59]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Parallel Partition and Extension. CISS 2017: 1-6 - [c58]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Kronecker product and tiling of permutation arrays for hamming distances. ISIT 2017: 2198-2202 - 2015
- [i1]Sergey Bereg, Avi Levy, Ivan Hal Sudborough:
Constructing Permutation Arrays from Groups. CoRR abs/1511.04494 (2015) - 2014
- [j54]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Embedding multidimensional grids into optimal hypercubes. Theor. Comput. Sci. 552: 52-82 (2014) - 2012
- [j53]Bhadrachalam Chitturi, Ivan Hal Sudborough:
Bounding prefix transposition distance for strings and permutations. Theor. Comput. Sci. 421: 15-24 (2012) - 2010
- [j52]Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough:
Calibrating embedded protocols on asynchronous systems. Inf. Sci. 180(10): 1793-1801 (2010) - [j51]Linda Morales, Ivan Hal Sudborough:
A quadratic lower bound for Topswops. Theor. Comput. Sci. 411(44-46): 3965-3970 (2010) - [c57]Bhadrachalam Chitturi, Ivan Hal Sudborough:
Prefix Reversals on Strings. BIOCOMP 2010: 591-598 - [c56]Saïd Bettayeb, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Stack and Queue Layouts for Toruses and Extended Hypercubes. HICSS 2010: 1-10
2000 – 2009
- 2009
- [j50]Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410(8-10): 711-717 (2009) - [j49]Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough, Walter Voit:
An (18/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. 410(36): 3372-3390 (2009) - [c55]Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough:
Bounding the Size of k-Tuple Covers. HICSS 2009: 1-8 - 2008
- [c54]Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng:
Adjacent Swaps on Strings. COCOON 2008: 299-308 - [c53]Bhadrachalam Chitturi, Ivan Hal Sudborough:
Bounding Prefix Transposition Distance for Strings and Permutations. HICSS 2008: 468 - [c52]Doina Bein, Linda Morales, Wolfgang W. Bein, Charles O. Shields Jr., Z. Meng, Ivan Hal Sudborough:
Clustering and the Biclique Partition Problem. HICSS 2008: 475 - [c51]Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough:
Calibrating an Embedded Protocol on an Asynchronous System. IDC 2008: 227-236 - 2007
- [j48]Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West:
Short proofs for cut-and-paste sorting of permutations. Discret. Math. 307(22): 2866-2870 (2007) - [c50]Mohammad Hossain Heydari, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough:
Computing Cross Associations for Attack Graphs and Other Applications. HICSS 2007: 270 - 2006
- [c49]Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. HICSS 2006 - 2005
- [j47]Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough:
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. Networks 45(3): 143-164 (2005) - [c48]Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124 - 2004
- [j46]Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Combinatorial Optimization of Group Key Management. J. Netw. Syst. Manag. 12(1): 33-50 (2004) - [j45]Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks 5(2): 111-130 (2004) - [c47]Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Towards Trusted Online Dissemination of Consumer Information. HICSS 2004 - [c46]Xuerong Feng, Z. Meng, Ivan Hal Sudborough:
Improved Upper Bound for Sorting by Short Swaps. ISPAN 2004: 98-103 - 2003
- [j44]Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough:
Expansion of layouts of complete binary trees into grids. Discret. Appl. Math. 131(3): 611-642 (2003) - [j43]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14(3): 425-437 (2003) - [j42]Douglas W. Bass, Ivan Hal Sudborough:
Hamilton Decompositions and (n/2)-Factorizations of Hypercubes. J. Graph Algorithms Appl. 7(1): 79-98 (2003) - [j41]Douglas W. Bass, Ivan Hal Sudborough:
Pancake problems with restricted prefix reversals and some corresponding Cayley networks. J. Parallel Distributed Comput. 63(3): 327-336 (2003) - [c45]Linda Morales, Ivan Hal Sudborough, Mohamed Eltoweissy, Mohammad Hossain Heydari:
Combinatorial Optimization of Multicast Key Management. HICSS 2003: 332 - 2002
- [c44]Linda Morales, Ivan Hal Sudborough:
Comparing Star and Pancake Networks. The Essence of Computation 2002: 18-36 - [c43]Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough:
On the Generalization of the Pancake Network. ISPAN 2002: 173-178 - [c42]Douglas W. Bass, Ivan Hal Sudborough:
Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. ISPAN 2002: 219-224 - [c41]Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281- - [c40]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. ISPAN 2002: 349-354 - [e1]Torben Æ. Mogensen, David A. Schmidt, Ivan Hal Sudborough:
The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]. Lecture Notes in Computer Science 2566, Springer 2002, ISBN 3-540-00326-6 [contents] - 2000
- [j40]Changwook Kim, Ivan Hal Sudborough:
Leftmove-bounded picture languages. Theor. Comput. Sci. 237(1-2): 183-195 (2000) - [j39]Douglas W. Bass, Ivan Hal Sudborough:
Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter. Telecommun. Syst. 13(1): 135-146 (2000) - [c39]Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147
1990 – 1999
- 1999
- [j38]Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough:
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. 210(2): 327-339 (1999) - [c38]Ivan Hal Sudborough, Taoyu Zhang:
Circuit-Switched Routings for Automorphisms of a Hypercube. ISPAN 1999: 28-35 - [c37]Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel:
On Mapping Complete Binary Trees into Grids and Extended Grids. ISPAN 1999: 242-247 - 1998
- [c36]Douglas W. Bass, Ivan Hal Sudborough:
Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. ICPP 1998: 11-19 - 1997
- [j37]Mohammad Hossain Heydari, Ivan Hal Sudborough:
On the Diameter of the Pancake Network. J. Algorithms 25(1): 67-94 (1997) - [c35]Douglas W. Bass, Ivan Hal Sudborough:
On The Shuffle-Exchange Permutation Network. ISPAN 1997: 165-171 - 1996
- [j36]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Math. Syst. Theory 29(6): 551-572 (1996) - [j35]Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough:
Embedding Star Networks into Hypercubes. IEEE Trans. Computers 45(2): 186-194 (1996) - 1995
- [j34]Adair Dingle, Ivan Hal Sudborough:
Single Row Routing on Multilayers. J. Comput. Syst. Sci. 50(1): 126-131 (1995) - [c34]Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Embedding hypercubes into pancake, cycle prefix and substring reversal networks. HICSS (2) 1995: 537-545 - 1994
- [j33]John A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner:
The Vertex Separation and Search Number of a Graph. Inf. Comput. 113(1): 50-79 (1994) - [j32]Zevi Miller, Ivan Hal Sudborough:
Compressing grids into small hypercubes. Networks 24(6): 327-357 (1994) - [j31]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. IEEE Trans. Computers 43(1): 13-22 (1994) - [j30]Adair Dingle, Ivan Hal Sudborough:
Efficient Mappings of Pyramid Networks. IEEE Trans. Parallel Distributed Syst. 5(10): 1009-1017 (1994) - [c33]Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough:
Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing 1994: 73-80 - 1993
- [j29]Xiaojun Shen, Qing Hu, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb:
The 4-Star Graph is not a Subgraph of Any Hypercube. Inf. Process. Lett. 45(4): 199-203 (1993) - [j28]Adair Dingle, Ivan Hal Sudborough:
Simulation of Binary Trees and X-Trees on Pyramid Networks. J. Parallel Distributed Comput. 19(2): 119-124 (1993) - [j27]Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis:
Difference bases and sparse sensor arrays. IEEE Trans. Inf. Theory 39(2): 716-721 (1993) - [c32]Dipak Pravin Doctor, Ivan Hal Sudborough:
Parallel Algorithm for Quadtree Medial Axis Transform. ICCI 1993: 266-271 - [c31]Dipak Pravin Doctor, Ivan Hal Sudborough:
Efficient Parallel Sibling Finding for Quadtree Data Structure. SPDP 1993: 141-149 - 1992
- [j26]Shai Simonson, Ivan Hal Sudborough:
On the Complexity of Tree Embedding Problems. Inf. Process. Lett. 44(6): 323-328 (1992) - [j25]Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough:
Embedding Grids into Hypercubes. J. Comput. Syst. Sci. 45(3): 340-366 (1992) - [j24]Changwook Kim, Ivan Hal Sudborough:
On Reversal-Bounded Picture Languages. Theor. Comput. Sci. 104(2): 185-206 (1992) - [c30]Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough:
Simulation Permutation Networks on Hypercubes. LATIN 1992: 61-70 - [c29]Mohammad Hossain Heydari, Ivan Hal Sudborough:
On Sorting by Prefix Reversals and the Diameter of Pancake Networks. Heinz Nixdorf Symposium 1992: 218-227 - 1991
- [j23]Zevi Miller, Ivan Hal Sudborough:
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. Math. Syst. Theory 24(1): 11-40 (1991) - [c28]Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough:
Three disjoint path paradigms in star networks. SPDP 1991: 400-406 - 1990
- [c27]Bin Cong, Zevi Miller, Ivan Hal Sudborough:
Optimum Simulation of Meshes by Small Hypercubes. IMYCS 1990: 30-46 - [c26]Seshu Madhavapeddy, Ivan Hal Sudborough:
A topological property of hypercubes: node disjoint paths. SPDP 1990: 532-539 - [c25]Seshu Madhavapeddy, Ivan Hal Sudborough:
Deterministic Message Routing in Faulty Hypercubes. WG 1990: 154-169
1980 – 1989
- 1989
- [j22]Fillia Makedon, Ivan Hal Sudborough:
On minimizing width in linear layouts. Discret. Appl. Math. 23(3): 243-265 (1989) - [c24]Adair Dingle, Ivan Hal Sudborough:
On the Complexity of Single Row Routing Problems. WADS 1989: 529-540 - [c23]Seshu Madhavapeddy, Ivan Hal Sudborough:
Disjoint Paths in the Hypercube. WG 1989: 3-18 - 1988
- [j21]Burkhard Monien, Ivan Hal Sudborough:
Min Cut is NP-Complete for Edge Weighted Treees. Theor. Comput. Sci. 58: 209-229 (1988) - [c22]Burkhard Monien, Ivan Hal Sudborough:
Simulating Binary Trees on Hypercubes. AWOC 1988: 170-180 - [c21]Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough:
Embedding Grids into Hypercubes. AWOC 1988: 201-211 - [c20]Burkhard Monien, Ivan Hal Sudborough:
Comparing Interconnection Networks. MFCS 1988: 138-153 - 1987
- [j20]Changwook Kim, Ivan Hal Sudborough:
The Membership and Equivalence Problems for Picture Languages. Theor. Comput. Sci. 52: 177-191 (1987) - 1986
- [c19]Zevi Miller, Ivan Hal Sudborough:
A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. Aegean Workshop on Computing 1986: 252-260 - [c18]Burkhard Monien, Ivan Hal Sudborough:
Min Cut is NP-Complete for Edge Weigthed Trees. ICALP 1986: 265-274 - 1985
- [j19]Moon-Jung Chung, Michael Evangelist, Ivan Hal Sudborough:
Complete Problems for Space Bounded Subclasses of NP. Acta Informatica 22(4): 379-395 (1985) - [j18]Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner:
Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. SIAM J. Comput. 14(1): 158-177 (1985) - [j17]Ivan Hal Sudborough, Emo Welzl:
Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. 36: 173-202 (1985) - [j16]Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. 41: 141-167 (1985) - 1984
- [j15]Eitan M. Gurari, Ivan Hal Sudborough:
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. J. Algorithms 5(4): 531-546 (1984) - 1983
- [j14]Arnold L. Rosenberg, Ivan Hal Sudborough:
Bandwidth and pebbling. Computing 31(2): 115-139 (1983) - [j13]Ivan Hal Sudborough:
Bandwidth Constraints on Problems Complete for Polynomial Time. Theor. Comput. Sci. 26: 25-52 (1983) - [c17]Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough:
Topological Bandwidth. CAAP 1983: 317-331 - [c16]Fillia Makedon, Ivan Hal Sudborough:
Minimizing Width in Linear Layouts. ICALP 1983: 478-490 - 1982
- [j12]Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. Theor. Comput. Sci. 21: 237-253 (1982) - [c15]Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner:
Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. FOCS 1982: 262-271 - 1981
- [j11]Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl:
On the Complexity of the General Coloring Problem. Inf. Control. 51(2): 128-145 (1981) - [c14]Ivan Hal Sudborough:
Pebbling and Bandwith. FCT 1981: 373-383 - [c13]Burkhard Monien, Ivan Hal Sudborough:
Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). MFCS 1981: 78-93 - [c12]Burkhard Monien, Ivan Hal Sudborough:
Bandwidth Constrained NP-Complete Problems. STOC 1981: 207-217 - 1980
- [c11]Ivan Hal Sudborough:
Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes. FOCS 1980: 62-73 - [c10]Burkhard Monien, Ivan Hal Sudborough:
Bounding the Bandwidth of NP-Complete Problems. WG 1980: 279-292 - [c9]Ivan Hal Sudborough:
The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. WG 1980: 293-305
1970 – 1979
- 1979
- [c8]Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ICALP 1979: 431-445 - 1978
- [j10]Ivan Hal Sudborough:
A Note on Weak Operator Precedence Grammars. Inf. Process. Lett. 7(5): 213-218 (1978) - [j9]Ivan Hal Sudborough:
On the Tape Complexity of Deterministic Context-Free Languages. J. ACM 25(3): 405-414 (1978) - [j8]Bruce E. Litow, Ivan Hal Sudborough:
On non-erasing oracle tapes in space bounded reducibility. SIGACT News 10(2): 53-57 (1978) - 1977
- [j7]Ivan Hal Sudborough:
A Note on Weak Operator Precedence Grammars. Inf. Process. Lett. 6(6): 213-218 (1977) - [j6]Ivan Hal Sudborough:
Some Remarks on Multihead Automata. RAIRO Theor. Informatics Appl. 11(3): 181-195 (1977) - [c7]Ivan Hal Sudborough:
The Time and Tape Complexity of Developmental Languages. ICALP 1977: 509-523 - [c6]Ivan Hal Sudborough:
Time and Tape Bounded Auxiliary Pushdown Automata. MFCS 1977: 493-503 - [c5]Ivan Hal Sudborough:
Separating Tape Bounded Auxiliary Pushdown Automata Classes. STOC 1977: 208-217 - 1976
- [j5]Ivan Hal Sudborough:
One-Way Multihead Writing Finite Automata. Inf. Control. 30(1): 1-20 (1976) - [j4]Ivan Hal Sudborough, A. Zalcberg:
On Families of Languages Defined by Time-Bounded Random Access Machines. SIAM J. Comput. 5(2): 217-230 (1976) - [c4]Ivan Hal Sudborough:
On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store. STOC 1976: 141-148 - 1975
- [j3]Ivan Hal Sudborough:
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages. J. ACM 22(4): 499-500 (1975) - [j2]Ivan Hal Sudborough:
On Tape-Bounded Complexity Classes and Multihead Finite Automata. J. Comput. Syst. Sci. 10(1): 62-76 (1975) - 1974
- [j1]Ivan Hal Sudborough:
Bounded-Reversal Multihead Finite Automata Languages. Inf. Control. 25(4): 317-328 (1974) - 1973
- [c3]Ivan Hal Sudborough:
On Tape-Bounded Complexity Classes and Multi-Head Finite Automata. SWAT 1973: 138-144 - [c2]Ivan Hal Sudborough, A. Zalcberg:
On Families of Languages Defined by Time-Bounded Random Access Machines. MFCS 1973: 333-338 - 1971
- [c1]Ivan Hal Sudborough:
Computation by Multi-Head Finite Automata. SWAT 1971: 105-113
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint