default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Etsuji Tomita
@article{DBLP:journals/ieiceta/KanaharaKT22,
author = {Kazuho Kanahara and
Kengo Katayama and
Etsuji Tomita},
title = {Speeding-Up Construction Algorithms for the Graph Coloring Problem},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {105-A},
number = {9},
pages = {1241--1251},
year = {2022},
url = {https://doi.org/10.1587/transfun.2021dmp0011},
doi = {10.1587/TRANSFUN.2021DMP0011},
timestamp = {Thu, 11 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceta/KanaharaKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ConteT22,
author = {Alessio Conte and
Etsuji Tomita},
title = {On the overall and delay complexity of the {CLIQUES} and Bron-Kerbosch
algorithms},
journal = {Theor. Comput. Sci.},
volume = {899},
pages = {1--24},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.11.005},
doi = {10.1016/J.TCS.2021.11.005},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ConteT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/ConteT21,
author = {Alessio Conte and
Etsuji Tomita},
editor = {Ryuhei Uehara and
Seok{-}Hee Hong and
Subhas C. Nandy},
title = {Overall and Delay Complexity of the {CLIQUES} and Bron-Kerbosch Algorithms},
booktitle = {{WALCOM:} Algorithms and Computation - 15th International Conference
and Workshops, {WALCOM} 2021, Yangon, Myanmar, February 28 - March
2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12635},
pages = {195--207},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-68211-8\_16},
doi = {10.1007/978-3-030-68211-8\_16},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/walcom/ConteT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bwcca/KanaharaKMT20,
author = {Kazuho Kanahara and
Kengo Katayama and
Takafumi Miyake and
Etsuji Tomita},
editor = {Leonard Barolli and
Makoto Takizawa and
Tomoya Enokido and
Hsing{-}Chung Chen and
Keita Matsuo},
title = {Speeding-Up of Construction Algorithms for the Graph Coloring Problem},
booktitle = {Advances on Broad-Band Wireless Computing, Communication and Applications
- Proceedings of the 15th International Conference on Broad-Band and
Wireless Computing, Communication and Applications (BWCCA-2020), Yonago,
Japan, 28-30 October, 2020},
series = {Lecture Notes in Networks and Systems},
volume = {159},
pages = {211--222},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61108-8\_21},
doi = {10.1007/978-3-030-61108-8\_21},
timestamp = {Thu, 12 Aug 2021 13:48:35 +0200},
biburl = {https://dblp.org/rec/conf/bwcca/KanaharaKMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/TomitaMNIW17,
author = {Etsuji Tomita and
Sora Matsuzaki and
Atsuki Nagao and
Hiro Ito and
Mitsuo Wakatsuki},
title = {A Much Faster Algorithm for Finding a Maximum Clique with Computational
Experiments},
journal = {J. Inf. Process.},
volume = {25},
pages = {667--677},
year = {2017},
url = {https://doi.org/10.2197/ipsjjip.25.667},
doi = {10.2197/IPSJJIP.25.667},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jip/TomitaMNIW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Tomita17,
author = {Etsuji Tomita},
editor = {Sheung{-}Hung Poon and
Md. Saidur Rahman and
Hsu{-}Chun Yen},
title = {Efficient Algorithms for Finding Maximum and Maximal Cliques and Their
Applications},
booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference
and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10167},
pages = {3--15},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53925-6\_1},
doi = {10.1007/978-3-319-53925-6\_1},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/Tomita17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijdsa/ZhaiHOT16,
author = {Hongjie Zhai and
Makoto Haraguchi and
Yoshiaki Okubo and
Etsuji Tomita},
title = {A fast and complete algorithm for enumerating pseudo-cliques in large
graphs},
journal = {Int. J. Data Sci. Anal.},
volume = {2},
number = {3-4},
pages = {145--158},
year = {2016},
url = {https://doi.org/10.1007/s41060-016-0022-1},
doi = {10.1007/S41060-016-0022-1},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijdsa/ZhaiHOT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/RahmanT16,
author = {M. Sohel Rahman and
Etsuji Tomita},
title = {Special issue on {WALCOM} 2015},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.01.002},
doi = {10.1016/J.JDA.2016.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/RahmanT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanT16,
author = {M. Sohel Rahman and
Etsuji Tomita},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00381},
doi = {10.7155/JGAA.00381},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/TomitaYHNIW16,
author = {Etsuji Tomita and
Kohei Yoshida and
Takuro Hatta and
Atsuki Nagao and
Hiro Ito and
Mitsuo Wakatsuki},
editor = {Daming Zhu and
Sergey Bereg},
title = {A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique},
booktitle = {Frontiers in Algorithmics, 10th International Workshop, {FAW} 2016,
Qingdao, China, June 30- July 2, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9711},
pages = {215--226},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-39817-4\_21},
doi = {10.1007/978-3-319-39817-4\_21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/TomitaYHNIW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mldm/OkuboHT16,
author = {Yoshiaki Okubo and
Makoto Haraguchi and
Etsuji Tomita},
editor = {Petra Perner},
title = {Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection
Lower Bound},
booktitle = {Machine Learning and Data Mining in Pattern Recognition - 12th International
Conference, {MLDM} 2016, New York, NY, USA, July 16-21, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9729},
pages = {569--583},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41920-6\_45},
doi = {10.1007/978-3-319-41920-6\_45},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/mldm/OkuboHT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pakdd/ZhaiHOT16,
author = {Hongjie Zhai and
Makoto Haraguchi and
Yoshiaki Okubo and
Etsuji Tomita},
editor = {James Bailey and
Latifur Khan and
Takashi Washio and
Gillian Dobbie and
Joshua Zhexue Huang and
Ruili Wang},
title = {A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs},
booktitle = {Advances in Knowledge Discovery and Data Mining - 20th Pacific-Asia
Conference, {PAKDD} 2016, Auckland, New Zealand, April 19-22, 2016,
Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9651},
pages = {423--435},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-31753-3\_34},
doi = {10.1007/978-3-319-31753-3\_34},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/pakdd/ZhaiHOT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Tomita16,
author = {Etsuji Tomita},
title = {Clique Enumeration},
booktitle = {Encyclopedia of Algorithms},
pages = {313--317},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_725},
doi = {10.1007/978-1-4939-2864-4\_725},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Tomita16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dis/ZhaiHOT15,
author = {Hongjie Zhai and
Makoto Haraguchi and
Yoshiaki Okubo and
Etsuji Tomita},
editor = {Nathalie Japkowicz and
Stan Matwin},
title = {Enumerating Maximal Clique Sets with Pseudo-Clique Constraint},
booktitle = {Discovery Science - 18th International Conference, {DS} 2015, Banff,
AB, Canada, October 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9356},
pages = {324--339},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24282-8\_28},
doi = {10.1007/978-3-319-24282-8\_28},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/dis/ZhaiHOT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/sci/WakatsukiTN15,
author = {Mitsuo Wakatsuki and
Etsuji Tomita and
Tetsuro Nishino},
editor = {Roger Lee},
title = {A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic
Restricted One-Counter Transducers Which Accept by Final State},
booktitle = {Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed
Computing},
series = {Studies in Computational Intelligence},
volume = {569},
pages = {131--144},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-10389-1\_10},
doi = {10.1007/978-3-319-10389-1\_10},
timestamp = {Tue, 16 May 2017 14:24:34 +0200},
biburl = {https://dblp.org/rec/series/sci/WakatsukiTN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/walcom/2015,
editor = {M. Sohel Rahman and
Etsuji Tomita},
title = {{WALCOM:} Algorithms and Computation - 9th International Workshop,
{WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8973},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15612-5},
doi = {10.1007/978-3-319-15612-5},
isbn = {978-3-319-15611-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/TomitaSHW13,
author = {Etsuji Tomita and
Yoichi Sutani and
Takanori Higashi and
Mitsuo Wakatsuki},
title = {A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum
Clique with Computational Experiments},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {96-D},
number = {6},
pages = {1286--1298},
year = {2013},
url = {https://doi.org/10.1587/transinf.E96.D.1286},
doi = {10.1587/TRANSINF.E96.D.1286},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/TomitaSHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/miwai/OkuboHT13,
author = {Yoshiaki Okubo and
Makoto Haraguchi and
Etsuji Tomita},
editor = {Sheela Ramanna and
Pawan Lingras and
Chattrakul Sombattheera and
Aneesh Krishna},
title = {Relational Change Pattern Mining Based on Modularity Difference},
booktitle = {Multi-disciplinary Trends in Artificial Intelligence - 7th International
Workshop, {MIWAI} 2013, Krabi, Thailand, December 9-11, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8271},
pages = {187--198},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-44949-9\_18},
doi = {10.1007/978-3-642-44949-9\_18},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/miwai/OkuboHT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/snpd/WakatsukiTN13,
author = {Mitsuo Wakatsuki and
Etsuji Tomita and
Tetsuro Nishino},
title = {A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time
Deterministic Restricted One-Counter Transducers Which Accept by Final
State},
booktitle = {14th {ACIS} International Conference on Software Engineering, Artificial
Intelligence, Networking and Parallel/Distributed Computing, {SNPD}
2013, Honolulu, Hawaii, USA, 1-3 July, 2013},
pages = {459--465},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/SNPD.2013.18},
doi = {10.1109/SNPD.2013.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/snpd/WakatsukiTN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/MoriTFTTA12,
author = {Tomoya Mori and
Takeyuki Tamura and
Daiji Fukagawa and
Atsuhiro Takasu and
Etsuji Tomita and
Tatsuya Akutsu},
title = {A Clique-Based Method Using Dynamic Programming for Computing Edit
Distance Between Unordered Trees},
journal = {J. Comput. Biol.},
volume = {19},
number = {10},
pages = {1089--1104},
year = {2012},
url = {https://doi.org/10.1089/cmb.2012.0133},
doi = {10.1089/CMB.2012.0133},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/MoriTFTTA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dis/OkuboHT12,
author = {Yoshiaki Okubo and
Makoto Haraguchi and
Etsuji Tomita},
editor = {Jean{-}Gabriel Ganascia and
Philippe Lenca and
Jean{-}Marc Petit},
title = {Structural Change Pattern Mining Based on Constrained Maximal k-Plex
Search},
booktitle = {Discovery Science - 15th International Conference, {DS} 2012, Lyon,
France, October 29-31, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7569},
pages = {284--298},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33492-4\_23},
doi = {10.1007/978-3-642-33492-4\_23},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/dis/OkuboHT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iiaiaai/LiHOT12,
author = {Aixiang Li and
Makoto Haraguchi and
Yoshiaki Okubo and
Etsuji Tomita},
title = {Finding What Changes for Two Graphs Constructed from Different Time
Intervals},
booktitle = {{IIAI} International Conference on Advanced Applied Informatics, {IIAI-AAI}
2012, Fukuoka, Japan, September 20-22, 2012},
pages = {48--53},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/IIAI-AAI.2012.19},
doi = {10.1109/IIAI-AAI.2012.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iiaiaai/LiHOT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/FukagawaTTTA11,
author = {Daiji Fukagawa and
Takeyuki Tamura and
Atsuhiro Takasu and
Etsuji Tomita and
Tatsuya Akutsu},
title = {A clique-based method for the edit distance between unordered trees
and its application to analysis of glycan structures},
journal = {{BMC} Bioinform.},
volume = {12},
number = {{S-1}},
pages = {S13},
year = {2011},
url = {https://doi.org/10.1186/1471-2105-12-S1-S13},
doi = {10.1186/1471-2105-12-S1-S13},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/FukagawaTTTA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiyataTT11,
author = {Akinobu Miyata and
Jun Tarui and
Etsuji Tomita},
title = {Learning Boolean functions in AC\({}^{\mbox{0}}\) on attribute and
classification noise - Estimating an upper bound on attribute and
classification noise},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4650--4660},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.047},
doi = {10.1016/J.TCS.2011.04.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MiyataTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cisis/AkutsuMTFTT11,
author = {Tatsuya Akutsu and
Tomoya Mori and
Takeyuki Tamura and
Daiji Fukagawa and
Atsuhiro Takasu and
Etsuji Tomita},
title = {An Improved Clique-Based Method for Computing Edit Distance between
Unordered Trees and Its Application to Comparison of Glycan Structures},
booktitle = {International Conference on Complex, Intelligent and Software Intensive
Systems, {CISIS} 2011, June 30 - July 2, 2011, Korean Bible University,
Seoul, Korea},
pages = {536--540},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CISIS.2011.88},
doi = {10.1109/CISIS.2011.88},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cisis/AkutsuMTFTT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/WakatsukiT10,
author = {Mitsuo Wakatsuki and
Etsuji Tomita},
editor = {Jos{\'{e}} M. Sempere and
Pedro Garc{\'{\i}}a},
title = {Polynomial Time Identification of Strict Prefix Deterministic Finite
State Transducers},
booktitle = {Grammatical Inference: Theoretical Results and Applications, 10th
International Colloquium, {ICGI} 2010, Valencia, Spain, September
13-16, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6339},
pages = {313--316},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15488-1\_34},
doi = {10.1007/978-3-642-15488-1\_34},
timestamp = {Wed, 13 Jan 2021 14:02:25 +0100},
biburl = {https://dblp.org/rec/conf/icgi/WakatsukiT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/TomitaSHTW10,
author = {Etsuji Tomita and
Yoichi Sutani and
Takanori Higashi and
Shinya Takahashi and
Mitsuo Wakatsuki},
editor = {Md. Saidur Rahman and
Satoshi Fujita},
title = {A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum
Clique},
booktitle = {{WALCOM:} Algorithms and Computation, 4th International Workshop,
{WALCOM} 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5942},
pages = {191--203},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11440-3\_18},
doi = {10.1007/978-3-642-11440-3\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/TomitaSHTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/MatsunagaYTM09,
author = {Tsutomu Matsunaga and
Chikara Yonemori and
Etsuji Tomita and
Masaaki Muramatsu},
title = {Clique-based data mining for related genes in a biomedical database},
journal = {{BMC} Bioinform.},
volume = {10},
year = {2009},
url = {https://doi.org/10.1186/1471-2105-10-205},
doi = {10.1186/1471-2105-10-205},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/MatsunagaYTM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/TomitaK09,
author = {Etsuji Tomita and
Toshikatsu Kameda},
title = {An efficient branch-and-bound algorithm for finding a maximum clique
with computational experiments},
journal = {J. Glob. Optim.},
volume = {44},
number = {2},
pages = {311},
year = {2009},
url = {https://doi.org/10.1007/s10898-008-9362-2},
doi = {10.1007/S10898-008-9362-2},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/TomitaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/WakatsukiT08,
author = {Mitsuo Wakatsuki and
Etsuji Tomita},
title = {Polynomial Time Identification of Strict Deterministic Restricted
One-Counter Automata in Some Class from Positive Data},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {91-D},
number = {6},
pages = {1704--1718},
year = {2008},
url = {https://doi.org/10.1093/ietisy/e91-d.6.1704},
doi = {10.1093/IETISY/E91-D.6.1704},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/WakatsukiT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/TomitaK07,
author = {Etsuji Tomita and
Toshikatsu Kameda},
title = {An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique
with Computational Experiments},
journal = {J. Glob. Optim.},
volume = {37},
number = {1},
pages = {95--111},
year = {2007},
url = {https://doi.org/10.1007/s10898-006-9039-7},
doi = {10.1007/S10898-006-9039-7},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/TomitaK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SimonT07,
author = {Hans Ulrich Simon and
Etsuji Tomita},
title = {Guest editors' foreword},
journal = {Theor. Comput. Sci.},
volume = {387},
number = {1},
pages = {1--3},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.07.022},
doi = {10.1016/J.TCS.2007.07.022},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SimonT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdpta/TomitaSH07,
author = {Etsuji Tomita and
Yoichi Sutani and
Takanori Higashi},
editor = {Hamid R. Arabnia},
title = {A More Efficient Algorithm for Finding a Maximum Clique with an Improved
Approximate Coloring},
booktitle = {Proceedings of the International Conference on Parallel and Distributed
Processing Techniques and Applications, {PDPTA} 2007, Las Vegas, Nevada,
USA, June 25-28, 2007, Volume 2},
pages = {719--725},
publisher = {{CSREA} Press},
year = {2007},
timestamp = {Wed, 12 Dec 2007 09:04:34 +0100},
biburl = {https://dblp.org/rec/conf/pdpta/TomitaSH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/AkutsuHBTSH06,
author = {Tatsuya Akutsu and
Morihiro Hayashida and
Dukka Bahadur and
Etsuji Tomita and
Jun'ichi Suzuki and
Katsuhisa Horimoto},
title = {Dynamic Programming and Clique Based Approaches for Protein Threading
with Profiles and Constraints},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {89-A},
number = {5},
pages = {1215--1222},
year = {2006},
url = {https://doi.org/10.1093/ietfec/e89-a.5.1215},
doi = {10.1093/IETFEC/E89-A.5.1215},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/AkutsuHBTSH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/DukkaTSHA06,
author = {K. C. Dukka Bahadur and
Etsuji Tomita and
Jun'ichi Suzuki and
Katsuhisa Horimoto and
Tatsuya Akutsu},
title = {Protein Threading with Profiles and Distance Constraints Using Clique
Based Algorithms},
journal = {J. Bioinform. Comput. Biol.},
volume = {4},
number = {1},
pages = {19--42},
year = {2006},
url = {https://doi.org/10.1142/S0219720006001680},
doi = {10.1142/S0219720006001680},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/DukkaTSHA06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TomitaTT06,
author = {Etsuji Tomita and
Akira Tanaka and
Haruhisa Takahashi},
title = {The worst-case time complexity for generating all maximal cliques
and computational experiments},
journal = {Theor. Comput. Sci.},
volume = {363},
number = {1},
pages = {28--42},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.06.015},
doi = {10.1016/J.TCS.2006.06.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TomitaTT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/WakatsukiTY06,
author = {Mitsuo Wakatsuki and
Etsuji Tomita and
Go Yamada},
editor = {Yasubumi Sakakibara and
Satoshi Kobayashi and
Kengo Sato and
Tetsuro Nishino and
Etsuji Tomita},
title = {A Unified Algorithm for Extending Classes of Languages Identifiable
in the Limit from Positive Data},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th International
Colloquium, {ICGI} 2006, Tokyo, Japan, September 20-22, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4201},
pages = {161--174},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11872436\_14},
doi = {10.1007/11872436\_14},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/WakatsukiTY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icgi/2006,
editor = {Yasubumi Sakakibara and
Satoshi Kobayashi and
Kengo Sato and
Tetsuro Nishino and
Etsuji Tomita},
title = {Grammatical Inference: Algorithms and Applications, 8th International
Colloquium, {ICGI} 2006, Tokyo, Japan, September 20-22, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4201},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11872436},
doi = {10.1007/11872436},
isbn = {3-540-45264-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icgi/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/BahadurTSA05,
author = {K. C. Dukka Bahadur and
Etsuji Tomita and
Jun'ichi Suzuki and
Tatsuya Akutsu},
title = {Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic
Approach},
journal = {J. Bioinform. Comput. Biol.},
volume = {3},
number = {1},
pages = {103--126},
year = {2005},
url = {https://doi.org/10.1142/S0219720005000904},
doi = {10.1142/S0219720005000904},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/BahadurTSA05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/JainST05,
author = {Sanjay Jain and
Hans Ulrich Simon and
Etsuji Tomita},
editor = {Sanjay Jain and
Hans Ulrich Simon and
Etsuji Tomita},
title = {Editors' Introduction},
booktitle = {Algorithmic Learning Theory, 16th International Conference, {ALT}
2005, Singapore, October 8-11, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3734},
pages = {1--9},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11564089\_1},
doi = {10.1007/11564089\_1},
timestamp = {Fri, 08 Sep 2023 21:18:15 +0200},
biburl = {https://dblp.org/rec/conf/alt/JainST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apbc/BahadurTSHA05,
author = {Dukka Bahadur and
Etsuji Tomita and
Jun'ichi Suzuki and
Katsuhisa Horimoto and
Tatsuya Akutsu},
editor = {Yi{-}Ping Phoebe Chen and
Limsoon Wong},
title = {Clique-based algorithms for protein threading with profiles and constraints},
booktitle = {Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January
2005, Singapore},
pages = {51--64},
publisher = {Imperial College Press, London},
year = {2005},
url = {http://www.comp.nus.edu.sg/\%7Ewongls/psZ/apbc2005/camera-ready/146.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/apbc/BahadurTSHA05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alt/2005,
editor = {Sanjay Jain and
Hans Ulrich Simon and
Etsuji Tomita},
title = {Algorithmic Learning Theory, 16th International Conference, {ALT}
2005, Singapore, October 8-11, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3734},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11564089},
doi = {10.1007/11564089},
isbn = {3-540-29242-X},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TajimaTWT04,
author = {Yasuhiro Tajima and
Etsuji Tomita and
Mitsuo Wakatsuki and
Matsuaki Terada},
title = {Polynomial time learning of simple deterministic languages via queries
and a representative sample},
journal = {Theor. Comput. Sci.},
volume = {329},
number = {1-3},
pages = {203--221},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.08.012},
doi = {10.1016/J.TCS.2004.08.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TajimaTWT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/MiyataTT04,
author = {Akinobu Miyata and
Jun Tarui and
Etsuji Tomita},
editor = {Shai Ben{-}David and
John Case and
Akira Maruoka},
title = {Learning Boolean Functions in AC\({}^{\mbox{0}}\) on Attribute and
Classification Noise},
booktitle = {Algorithmic Learning Theory, 15th International Conference, {ALT}
2004, Padova, Italy, October 2-5, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3244},
pages = {142--155},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30215-5\_12},
doi = {10.1007/978-3-540-30215-5\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/MiyataTT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apbc/BahadurATS04,
author = {Dukka Bahadur and
Tatsuya Akutsu and
Etsuji Tomita and
Tomokazu Seki},
editor = {Yi{-}Ping Phoebe Chen},
title = {Protein Side-chain Packing Problem: {A} Maximum Edge-weight Clique
Algorithmic Approach},
booktitle = {Second Asia-Pacific Bioinformatics Conference {(APBC} 2004), January
18-22, 2004, Dunedin, New Zealand},
series = {{CRPIT}},
volume = {29},
pages = {191--200},
publisher = {Australian Computer Society},
year = {2004},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV29Dukka.html},
timestamp = {Thu, 25 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/apbc/BahadurATS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibe/AkutsuHTSH04,
author = {Tatsuya Akutsu and
Morihiro Hayashida and
Etsuji Tomita and
Jun'ichi Suzuki and
Katsuhisa Horimoto},
title = {Protein Threading with Profiles and Constraints},
booktitle = {4th {IEEE} International Symposium on BioInformatics and BioEngineering
{(BIBE} 2004), 19-21 March 2004, Taichung, Taiwan},
pages = {537--544},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/BIBE.2004.1317389},
doi = {10.1109/BIBE.2004.1317389},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bibe/AkutsuHTSH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/TomitaTT04,
author = {Etsuji Tomita and
Akira Tanaka and
Haruhisa Takahashi},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {The Worst-Case Time Complexity for Generating All Maximal Cliques},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {161--170},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_19},
doi = {10.1007/978-3-540-27798-9\_19},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/TomitaTT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/WakatsukiTT04,
author = {Mitsuo Wakatsuki and
Kiyoshi Teraguchi and
Etsuji Tomita},
editor = {Georgios Paliouras and
Yasubumi Sakakibara},
title = {Polynomial Time Identification of Strict Deterministic Restricted
One-Counter Automata in Some Class from Positive Data},
booktitle = {Grammatical Inference: Algorithms and Applications, 7th International
Colloquium, {ICGI} 2004, Athens, Greece, October 11-13, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3264},
pages = {260--272},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30195-0\_23},
doi = {10.1007/978-3-540-30195-0\_23},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/WakatsukiTT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/TomitaS03,
author = {Etsuji Tomita and
Tomokazu Seki},
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique},
booktitle = {Discrete Mathematics and Theoretical Computer Science, 4th International
Conference, {DMTCS} 2003, Dijon, France, July 7-12, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2731},
pages = {278--289},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45066-1\_22},
doi = {10.1007/3-540-45066-1\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/dmtcs/TomitaS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/TajimaT00,
author = {Yasuhiro Tajima and
Etsuji Tomita},
editor = {Arlindo L. Oliveira},
title = {A Polynomial Time Learning Algorithm Simple Deterministic Languages
via Membership Queries and a Representative Sample},
booktitle = {Grammatical Inference: Algorithms and Applications, 5th International
Colloquium, {ICGI} 2000, Lisbon, Portugal, September 11-13, 2000,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1891},
pages = {284--297},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/978-3-540-45257-7\_23},
doi = {10.1007/978-3-540-45257-7\_23},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/TajimaT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scjapan/TomitaIKW97,
author = {Etsuji Tomita and
Ken'ichi Imamatsu and
Yasuhiro Kohata and
Mitsuo Wakatsuki},
title = {A simple and efficient branch and bound algorithm for finding a maximum
clique with experimental evaluations},
journal = {Syst. Comput. Jpn.},
volume = {28},
number = {5},
pages = {60--67},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1520-684X(199705)28:5\&\#60;60::AID-SCJ7\&\#62;3.0.CO;2-M},
doi = {10.1002/(SICI)1520-684X(199705)28:5\&\#60;60::AID-SCJ7\&\#62;3.0.CO;2-M},
timestamp = {Wed, 13 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scjapan/TomitaIKW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/TomitaS95,
author = {Etsuji Tomita and
Kazushi Seino},
title = {The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic
Pushdowen Automata},
journal = {Acta Informatica},
volume = {32},
number = {4},
pages = {395--413},
year = {1995},
url = {https://doi.org/10.1007/BF01178385},
doi = {10.1007/BF01178385},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/TomitaS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/HiguchiTW95,
author = {Ken Higuchi and
Etsuji Tomita and
Mitsuo Wakatsuki},
title = {A Polynomial-Time Algorithm for Checking the Inclusion for Strict
Deterministic Restricted One-Counter Automata},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {78-D},
number = {4},
pages = {305--313},
year = {1995},
url = {http://search.ieice.org/bin/summary.php?id=e78-d\_4\_305},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/HiguchiTW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/HiguchiWT95,
author = {Ken Higuchi and
Mitsuo Wakatsuki and
Etsuji Tomita},
title = {A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time
Deterministic Restricted One-Counter Automata Which Accept by Final
State},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {78-D},
number = {8},
pages = {939--950},
year = {1995},
url = {http://search.ieice.org/bin/summary.php?id=e78-d\_8\_939},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/HiguchiWT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scjapan/YamadaTT94,
author = {Yoshiaki Yamada and
Etsuji Tomita and
Haruhisa Takahashi},
title = {A randomized algorithm for finding a near-maximum clique and its experimental
evaluations},
journal = {Syst. Comput. Jpn.},
volume = {25},
number = {2},
pages = {1--7},
year = {1994},
url = {https://doi.org/10.1002/scj.4690250201},
doi = {10.1002/SCJ.4690250201},
timestamp = {Wed, 13 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scjapan/YamadaTT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nn/TakahashiTK93,
author = {Haruhisa Takahashi and
Etsuji Tomita and
Tsutomu Kawabata},
title = {Separability of internal representations in multilayer perceptrons
with application to learning},
journal = {Neural Networks},
volume = {6},
number = {5},
pages = {689--703},
year = {1993},
url = {https://doi.org/10.1016/S0893-6080(05)80113-3},
doi = {10.1016/S0893-6080(05)80113-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nn/TakahashiTK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alt/1993,
editor = {Klaus P. Jantke and
Shigenobu Kobayashi and
Etsuji Tomita and
Takashi Yokomori},
title = {Algorithmic Learning Theory, 4th International Workshop, {ALT} '93,
Tokyo, Japan, November 8-10, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {744},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57370-4},
doi = {10.1007/3-540-57370-4},
isbn = {3-540-57370-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/1993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scjapan/ShindoT90,
author = {Miklo Shindo and
Etsuji Tomita},
title = {A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case
Time Complexity},
journal = {Syst. Comput. Jpn.},
volume = {21},
number = {3},
pages = {1--13},
year = {1990},
url = {https://doi.org/10.1002/scj.4690210301},
doi = {10.1002/SCJ.4690210301},
timestamp = {Wed, 13 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scjapan/ShindoT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TomitaS89,
author = {Etsuji Tomita and
Kazushi Seino},
title = {A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic
Pushdown Transducers, one of which is Real-Time Strict},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {39--53},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90096-0},
doi = {10.1016/0304-3975(89)90096-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TomitaS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TomitaS85,
author = {Etsuji Tomita and
Kazushi Seino},
title = {A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's
to be Decidable},
journal = {Theor. Comput. Sci.},
volume = {41},
pages = {223--230},
year = {1985},
url = {https://doi.org/10.1016/0304-3975(85)90072-6},
doi = {10.1016/0304-3975(85)90072-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TomitaS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tomita84,
author = {Etsuji Tomita},
title = {An Extended Direct Branching Algorithm for Checking Equivalence of
Deterministic Pushdown Automata},
journal = {Theor. Comput. Sci.},
volume = {32},
pages = {87--120},
year = {1984},
url = {https://doi.org/10.1016/0304-3975(84)90026-4},
doi = {10.1016/0304-3975(84)90026-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tomita84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tomita83,
author = {Etsuji Tomita},
title = {A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic
{VS.} LL(k) Grammars},
journal = {Theor. Comput. Sci.},
volume = {23},
pages = {129--154},
year = {1983},
url = {https://doi.org/10.1016/0304-3975(83)90052-X},
doi = {10.1016/0304-3975(83)90052-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tomita83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Tomita82,
author = {Etsuji Tomita},
title = {A Direct Branching Algorithm for Checking Equivalence of Some Classes
of Deterministic Pushdown Automata},
journal = {Inf. Control.},
volume = {52},
number = {2},
pages = {187--238},
year = {1982},
url = {https://doi.org/10.1016/S0019-9958(82)80029-6},
doi = {10.1016/S0019-9958(82)80029-6},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/Tomita82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
