BibTeX records: Tat-hung Chan

• > Home > Persons > Tat-hung Chan

@article{DBLP:journals/sigcse/Chan91,
  author       = {Tat{-}hung Chan},
  title        = {Computing average path lengths of binary search trees},
  journal      = {{ACM} {SIGCSE} Bull.},
  volume       = {23},
  number       = {3},
  pages        = {10},
  year         = {1991},
  url          = {https://doi.org/10.1145/126459.126463},
  doi          = {10.1145/126459.126463},
  timestamp    = {Mon, 15 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/sigcse/Chan91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Chan90,
  author       = {Tat{-}hung Chan},
  title        = {Nondecreasing subsequences of t-sequences},
  journal      = {Discret. Math.},
  volume       = {79},
  number       = {2},
  pages        = {215--218},
  year         = {1990},
  url          = {https://doi.org/10.1016/0012-365X(90)90036-H},
  doi          = {10.1016/0012-365X(90)90036-H},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Chan90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Chan88,
  author       = {Tat{-}hung Chan},
  title        = {The Boundedness Problem for Three-Dimensional Vector Addition Systems
                  with States},
  journal      = {Inf. Process. Lett.},
  volume       = {26},
  number       = {6},
  pages        = {287--289},
  year         = {1988},
  url          = {https://doi.org/10.1016/0020-0190(88)90184-6},
  doi          = {10.1016/0020-0190(88)90184-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Chan88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Chan88,
  author       = {Tat{-}hung Chan},
  title        = {Pushdown Automata with Reversal-Bounded Counters},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {37},
  number       = {3},
  pages        = {269--291},
  year         = {1988},
  url          = {https://doi.org/10.1016/0022-0000(88)90008-6},
  doi          = {10.1016/0022-0000(88)90008-6},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/Chan88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Chan87,
  author       = {Tat{-}hung Chan},
  title        = {On Two-Way Weak Counter Machines},
  journal      = {Math. Syst. Theory},
  volume       = {20},
  number       = {1},
  pages        = {31--41},
  year         = {1987},
  url          = {https://doi.org/10.1007/BF01692057},
  doi          = {10.1007/BF01692057},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Chan87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ChanI83,
  author       = {Tat{-}hung Chan and
                  Oscar H. Ibarra},
  title        = {On the Space and Time Complexity of Functions Computable by Simple
                  Programs},
  journal      = {{SIAM} J. Comput.},
  volume       = {12},
  number       = {4},
  pages        = {708--716},
  year         = {1983},
  url          = {https://doi.org/10.1137/0212048},
  doi          = {10.1137/0212048},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChanI83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChanI83,
  author       = {Tat{-}hung Chan and
                  Oscar H. Ibarra},
  title        = {On the Finite-Valuedness Problem for Sequential Machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {23},
  pages        = {95--101},
  year         = {1983},
  url          = {https://doi.org/10.1016/0304-3975(88)90012-6},
  doi          = {10.1016/0304-3975(88)90012-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChanI83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Chan81,
  author       = {Tat{-}hung Chan},
  title        = {Deciding Freeness for Program Schemes with a Single Unary Function},
  journal      = {Inf. Process. Lett.},
  volume       = {13},
  number       = {3},
  pages        = {98--102},
  year         = {1981},
  url          = {https://doi.org/10.1016/0020-0190(81)90118-6},
  doi          = {10.1016/0020-0190(81)90118-6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Chan81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Chan81,
  author       = {Tat{-}hung Chan},
  title        = {Reversal Complexity of Counter Machines},
  booktitle    = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
                  May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
  pages        = {146--157},
  publisher    = {{ACM}},
  year         = {1981},
  url          = {https://doi.org/10.1145/800076.802468},
  doi          = {10.1145/800076.802468},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Chan81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/us/Chan80,
  author       = {Tat{-}hung Chan},
  title        = {Reversal-Bounded Computations},
  school       = {Cornell University, {USA}},
  year         = {1980},
  timestamp    = {Mon, 28 Mar 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/Chan80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}