default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakahisa Toda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Zhenjiang Zhao
, Takahisa Toda, Takashi Kitamura:
Diversity-aware fairness testing of machine learning classifiers through hashing-based sampling. Inf. Softw. Technol. 167: 107390 (2024)- [c17]Zhenjiang Zhao, Takahisa Toda, Takashi Kitamura:
Approximation-guided Fairness Testing through Discriminatory Space Analysis. ASE 2024: 1007-1018 - [c16]Takashi Kitamura, Sousuke Amasaki, Jun Inoue, Yoshinao Isobe, Takahisa Toda:
Toward Individual Fairness Testing with Data Validity. ASE 2024: 2284-2288 - 2023
- [c15]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR 2023: 167-183 - [c14]Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama:
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. ICTAI 2023: 294-302 - 2022
- [c13]Zhenjiang Zhao, Takahisa Toda, Takashi Kitamura:
Efficient Fairness Testing Through Hash-Based Sampling. SSBSE 2022: 35-50 - [c12]Takashi Kitamura, Zhenjiang Zhao, Takahisa Toda:
Applying Combinatorial Testing to Verification-Based Fairness Testing. SSBSE 2022: 101-107 - [i3]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR abs/2207.13959 (2022) - 2021
- [j9]Takahisa Toda, Takeru Inoue:
Interval-based Counterexample Analysis for Error Explanation. J. Inf. Process. 29: 630-639 (2021) - 2020
- [j8]Kohei Nishikawa, Takahisa Toda:
Exact Method for Generating Strategy-Solvable Sudoku Clues. Algorithms 13(7): 171 (2020) - [i2]Kohei Nishikawa, Takahisa Toda:
Exact Method for Generating Strategy-Solvable Sudoku Clues. CoRR abs/2005.14098 (2020)
2010 – 2019
- 2018
- [c11]Hisashi Koga, Satoshi Suzuki, Taiki Itabashi, Gibran Fuentes Pineda, Takahisa Toda:
Extended Min-Hash Focusing on Intersection Cardinality. IDEAL (1) 2018: 17-26 - 2017
- [j7]Takahisa Toda:
Dualization of boolean functions using ternary decision diagrams. Ann. Math. Artif. Intell. 79(1-3): 229-244 (2017) - [j6]Takahisa Toda, Takeru Inoue:
Exploiting Functional Dependencies of Variables in All Solutions SAT Solvers. J. Inf. Process. 25: 459-468 (2017) - [c10]Tomohiro Yamazaki, Hisashi Koga, Takahisa Toda:
Fast Exact Algorithm to Solve Continuous Similarity Search for Evolving Queries. AIRS 2017: 84-96 - [c9]Taichi Uchino, Hisashi Koga, Takahisa Toda:
Improved Compression-Based Pattern Recognition Exploiting New Useful Features. IbPRIA 2017: 363-371 - 2016
- [j5]Takahisa Toda, Takehide Soh:
Implementing Efficient All Solutions SAT Solvers. ACM J. Exp. Algorithmics 21(1): 1.12:1-1.12:44 (2016) - [c8]Hisashi Koga, Yuji Nakajima, Takahisa Toda:
Effective construction of compression-based feature space. ISITA 2016: 116-120 - 2015
- [c7]Takahisa Toda, Koji Tsuda:
BDD construction for all solutions SAT and efficient caching mechanism. SAC 2015: 1880-1886 - [c6]Takahisa Toda, Shogo Takeuchi, Koji Tsuda, Shin-ichi Minato:
Superset Generation on Decision Diagrams. WALCOM 2015: 317-322 - [i1]Takahisa Toda, Takehide Soh:
Implementing Efficient All Solutions SAT Solvers. CoRR abs/1510.00523 (2015) - 2014
- [j4]Yuma Inoue, Takahisa Toda, Shin-ichi Minato:
Implicit Generation of Pattern-Avoiding Permutations by Using Permutation Decision Diagrams. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1171-1179 (2014) - [c5]Takahisa Toda:
Dualization of Boolean functions Using Ternary Decision Diagrams. ISAIM 2014 - [c4]Hiroshi Aoki, Takahisa Toda, Shin-ichi Minato:
Three-way Indexing ZDDs for Large-Scale Sparse Datasets. PAKDD Workshops 2014: 457-469 - [c3]Shogo Takeuchi, Takahisa Toda, Shin-ichi Minato:
A General Framework for Parallel Unary Operations on ZDDs. PAKDD Workshops 2014: 494-503 - 2013
- [j3]Takahisa Toda, Ivo Vigan:
On separating families of bipartitions. Discret. Math. 313(3): 286-292 (2013) - [c2]Takahisa Toda:
Fast Compression of Large-Scale Hypergraphs for Solving Combinatorial Problems. Discovery Science 2013: 281-293 - [c1]Takahisa Toda:
Hypergraph Transversal Computation with Binary Decision Diagrams. SEA 2013: 91-102 - 2012
- [j2]Takahisa Toda:
Extracting Co-Occurrence Relations from ZDDs. Algorithms 5(4): 654-667 (2012) - 2011
- [j1]Takahisa Toda:
On Partitioning Colored Points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1242-1246 (2011)
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 2025-10-28 23:10 CET 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:
