default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuichi Yoshida
Person information
- affiliation: National Institute of Informatics, NII, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2022
[b1]Arnab Bhattacharyya, Yuichi Yoshida:
Property Testing - Problems and Techniques. Springer 2022, ISBN 978-981-16-8621-4, pp. 1-427
Journal Articles
- 2024
- [j47]Kaito Fujii
, Yuichi Yoshida:
The Secretary Problem with Predictions. Math. Oper. Res. 49(2): 1241-1262 (2024) - [j46]Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Theory Comput. Syst. 68(4): 868-899 (2024) - 2023
- [j45]Tasuku Soma, Yuichi Yoshida:
Online risk-averse submodular maximization. Ann. Oper. Res. 320(1): 393-414 (2023) - [j44]Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. SIAM J. Comput. 52(4): 1039-1081 (2023) - 2022
- [j43]Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. SIAM J. Discret. Math. 36(1): 355-382 (2022) - [j42]Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida:
Finding Cheeger cuts in hypergraphs via heat equation. Theor. Comput. Sci. 930: 1-23 (2022) - 2021
- [j41]Yuichi Yoshida, Xue Ding, Kohei Iwatsuki, Katsuya Taniizumi, Hirofumi Inoue, Jin Wang, Kenji Sakai, Toshihiko Kiwa:
Detection of Lung Cancer Cells in Solutions Using a Terahertz Chemical Microscope. Sensors 21(22): 7631 (2021) - [j40]Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-time algorithms for submodular Laplacian systems. Theor. Comput. Sci. 892: 170-186 (2021) - 2020
- [j39]Masako Kishida, Masaki Ogura, Yuichi Yoshida, Tadashi Wadayama:
Deep Learning-Based Average Consensus. IEEE Access 8: 142404-142412 (2020) - [j38]Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida:
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Algorithmica 82(4): 1006-1032 (2020) - [j37]Kohei Hayashi, Yuichi Yoshida:
Testing Proximity to Subspaces: Approximate ℓ ∞ Minimization in Constant Time. Algorithmica 82(5): 1277-1297 (2020) - 2019
- [j36]Shinichi Sumiyoshi, Yuichi Yoshida:
Estimating 3D Position of Strongly Occluded Object with Semi-Real Time by Using Auxiliary 3D Points in Occluded Space. Int. J. Autom. Technol. 13(4): 464-474 (2019) - [j35]Eric Blais, Yuichi Yoshida:
A characterization of constant-sample testable properties. Random Struct. Algorithms 55(1): 73-88 (2019) - [j34]Hubie Chen, Matt Valeriote, Yuichi Yoshida:
Constant-Query Testability of Assignments to Constraint Satisfaction Problems. SIAM J. Comput. 48(3): 1022-1045 (2019) - [j33]Yuichi Yoshida:
Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint. SIAM J. Discret. Math. 33(3): 1452-1471 (2019) - 2018
- [j32]Tasuku Soma, Yuichi Yoshida:
Maximizing monotone submodular functions over the integer lattice. Math. Program. 172(1-2): 539-563 (2018) - [j31]Suguru Tamaki, Yuichi Yoshida:
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. ACM Trans. Algorithms 14(4): 45:1-45:13 (2018) - [j30]Kazuo Iwama, Yuichi Yoshida:
Parameterized Testability. ACM Trans. Comput. Theory 9(4): 16:1-16:16 (2018) - 2017
- [j29]Yuichi Yoshida, Tsuyoshi Toyofuku:
Image Retrieval Framework Based on Dual Representation Descriptor. IEICE Trans. Inf. Syst. 100-D(10): 2605-2613 (2017) - 2016
- [j28]Yuichi Yoshida:
Testing list H-homomorphisms. Comput. Complex. 25(4): 737-773 (2016) - [j27]Tetsuya Manabe, Takaaki Hasegawa, Takashi Serizawa, Nobuhiro Machida, Yuichi Yoshida, Takayuki Fujiwara:
New Types of Markers and the Integration of M-CubITS Pedestrian WYSIWYAS Navigation Systems for Advanced WYSIWYAS Navigation Environments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(1): 282-296 (2016) - [j26]Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Dynamic Influence Analysis in Evolving Networks. Proc. VLDB Endow. 9(12): 1077-1088 (2016) - [j25]Kenta Oono, Yuichi Yoshida:
Testing properties of functions on finite groups. Random Struct. Algorithms 49(3): 579-598 (2016) - [j24]Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida:
Half-integrality, LP-branching, and FPT Algorithms. SIAM J. Comput. 45(4): 1377-1411 (2016) - 2015
- [j23]Shin-ichi Tanigawa, Yuichi Yoshida:
Testing the Supermodular-Cut Condition. Algorithmica 71(4): 1065-1075 (2015) - [j22]Yuichi Yoshida, Hiro Ito:
Testing Outerplanarity of Bounded Degree Graphs. Algorithmica 73(1): 1-20 (2015) - [j21]Hiro Ito, Stefan Langerman, Yuichi Yoshida:
Generalized River Crossing Problems. Theory Comput. Syst. 56(2): 418-435 (2015) - [j20]Takanori Hayashi, Takuya Akiba, Yuichi Yoshida:
Fully Dynamic Betweenness Centrality Maintenance on Massive Networks. Proc. VLDB Endow. 9(2): 48-59 (2015) - [j19]Suguru Tamaki, Yuichi Yoshida:
A query efficient non-adaptive long code test with perfect completeness. Random Struct. Algorithms 47(2): 386-406 (2015) - [j18]Eric Blais, Amit Weinstein, Yuichi Yoshida:
Partially Symmetric Functions Are Efficiently Isomorphism Testable. SIAM J. Comput. 44(2): 411-432 (2015) - 2014
- [j17]Eric Blais, Amit Weinstein, Yuichi Yoshida:
Semi-Strong Colouring of Intersecting Hypergraphs. Comb. Probab. Comput. 23(1): 1-7 (2014) - [j16]Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida:
Generalized skew bisubmodularity: A characterization and a min-max theorem. Discret. Optim. 12: 1-9 (2014) - 2013
- [j15]Yuichi Yoshida, Takeshi Imai, Kazuhiko Ohe:
The trends in EMR and CPOE adoption in Japan under the national strategy. Int. J. Medical Informatics 82(10): 1004-1011 (2013) - [j14]Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. Int. J. Netw. Comput. 3(2): 205-216 (2013) - [j13]Yuji Yamauchi, Mitsuru Ambai, Ikuro Sato, Yuichi Yoshida, Hironobu Fujiyoshi:
Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching. Inf. Media Technol. 8(4): 1110-1114 (2013) - [j12]Yuji Yamauchi, Mitsuru Ambai, Ikuro Sato, Yuichi Yoshida, Hironobu Fujiyoshi:
Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching. IPSJ Trans. Comput. Vis. Appl. 5: 124-128 (2013) - [j11]François Le Gall, Yuichi Yoshida:
Property testing for cyclic groups and beyond. J. Comb. Optim. 26(4): 636-654 (2013) - 2012
- [j10]Yuichi Yoshida, Hiro Ito:
Property Testing on k-Vertex-Connectivity of Graphs. Algorithmica 62(3-4): 701-712 (2012) - [j9]Gábor Ivanyos, François Le Gall, Yuichi Yoshida:
On the distance between non-isomorphic groups. Eur. J. Comb. 33(4): 474-476 (2012) - [j8]Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems. SIAM J. Comput. 41(4): 1074-1093 (2012) - [j7]Yusuke Kobayashi, Yuichi Yoshida:
Algorithms for Finding a Maximum Non-k-Linked Graph. SIAM J. Discret. Math. 26(2): 591-604 (2012) - [j6]Yuichi Yoshida, Yusuke Kobayashi:
Testing the (s, t)-disconnectivity of graphs and digraphs. Theor. Comput. Sci. 434: 98-113 (2012) - 2011
- [j5]Mitsuru Ambai, Nugraha P. Utama, Yuichi Yoshida:
Dimensionality Reduction for Histogram Features Based on Supervised Non-negative Matrix Factorization. IEICE Trans. Inf. Syst. 94-D(10): 1870-1879 (2011) - [j4]Mitsuru Ambai, Yuichi Yoshida:
Augmenting Training Samples with a Large Number of Rough Segmentation Datasets. IEICE Trans. Inf. Syst. 94-D(10): 1880-1888 (2011) - 2010
- [j3]Yuichi Yoshida, Hiro Ito:
Query-Number Preserving Reductions and Linear Lower Bounds for Testing. IEICE Trans. Inf. Syst. 93-D(2): 233-240 (2010) - [j2]Yuichi Yoshida, Hiro Ito:
Testing k-edge-connectivity of digraphs. J. Syst. Sci. Complex. 23(1): 91-101 (2010) - 1997
- [j1]Takayuki Arai, Yuichi Yoshida:
Reconstruction of a signal using the spectrum-reversal technique. IEEE Trans. Signal Process. 45(10): 2593-2595 (1997)
Conference and Workshop Papers
- 2024
- [c114]Uri Meir, Gregory Schwartzman, Yuichi Yoshida:
Stochastic Distance in Property Testing. APPROX/RANDOM 2024: 57:1-57:13 - [c113]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Allocations for Optimization Games. ICALP 2024: 102:1-102:16 - [c112]Augusto Modanese, Yuichi Yoshida:
Testing Spreading Behavior in Networks with Arbitrary Topologies. ICALP 2024: 112:1-112:20 - [c111]Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida:
Online Algorithms for Spectral Hypergraph Sparsification. IPCO 2024: 405-417 - 2023
- [c110]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Algorithms for Graph Problems. FOCS 2023: 762-797 - [c109]Satoshi Hara, Yuichi Yoshida:
Average Sensitivity of Decision Tree Learning. ICLR 2023 - [c108]Yuri Kinoshita, Kenta Oono, Kenji Fukumizu, Yuichi Yoshida, Shin-ichi Maeda:
Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network. ICML 2023: 17041-17060 - [c107]Jing Dong, Yuichi Yoshida:
A Batch-to-Online Transformation under Random-Order Model. NeurIPS 2023 - [c106]Olaf Hartig, Yuichi Yoshida:
GRADES-NDA'23: 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA). SIGMOD Conference Companion 2023: 307-308 - [c105]Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. SODA 2023: 738-792 - [c104]Pan Peng, Yuichi Yoshida:
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. SODA 2023: 4936-4965 - 2022
- [c103]Akbar Rafiey, Yuichi Yoshida:
Sparsification of Decomposable Submodular Functions. AAAI 2022: 10336-10344 - [c102]Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of the Knapsack Problem. ESA 2022: 75:1-75:14 - [c101]Nathaniel Harms, Yuichi Yoshida:
Downsampling for Testing and Learning in Product Distributions. ICALP 2022: 71:1-71:19 - [c100]Yuichi Yoshida, Shinji Ito:
Average Sensitivity of Euclidean k-Clustering. NeurIPS 2022 - [c99]Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of Dynamic Programming. SODA 2022: 1925-1961 - 2021
- [c98]Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi:
RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding. EACL 2021: 1551-1565 - [c97]Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida:
Spectral Hypergraph Sparsifiers of Nearly Linear Size. FOCS 2021: 1159-1170 - [c96]Keisuke Ozawa, Shinichi Sumiyoshi, Yusuke Sekikawa, Keisuke Uto, Yuichi Yoshida, Mitsuru Ambai:
Snapshot Multispectral Image Completion Via Self-Dictionary Transformed Tensor Nuclear Norm Minimization With Total Variation. ICIP 2021: 364-368 - [c95]Tasuku Soma, Yuichi Yoshida:
Online Risk-Averse Submodular Maximization. IJCAI 2021: 2988-2994 - [c94]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Ordered Graph Limits and Their Applications. ITCS 2021: 42:1-42:20 - [c93]Yuichi Yoshida, Samson Zhou:
Sensitivity Analysis of the Maximum Matching Problem. ITCS 2021: 58:1-58:20 - [c92]Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci:
Local Algorithms for Estimating Effective Resistance. KDD 2021: 1329-1338 - [c91]Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. SODA 2021: 684-703 - [c90]Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. STACS 2021: 23:1-23:19 - [c89]Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida:
Towards tight bounds for spectral sparsification of hypergraphs. STOC 2021: 598-611 - 2020
- [c88]Kohei Hayashi, Masaaki Imaizumi, Yuichi Yoshida:
On Random Subsampling of Gaussian Process Regression: A Graphon-Based Analysis. AISTATS 2020: 2055-2065 - [c87]Akbar Rafiey, Yuichi Yoshida:
Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. ICML 2020: 7887-7897 - [c86]Noah Fleming, Yuichi Yoshida:
Distribution-Free Testing of Linear Functions on ℝⁿ. ITCS 2020: 22:1-22:19 - [c85]Richard Santiago, Yuichi Yoshida:
Weakly Submodular Function Maximization Using Local Submodularity Ratio. ISAAC 2020: 64:1-64:17 - [c84]Pan Peng, Yuichi Yoshida:
Average Sensitivity of Spectral Clustering. KDD 2020: 1132-1140 - [c83]Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida:
Hypergraph Clustering Based on PageRank. KDD 2020: 1970-1978 - [c82]Shinji Ito, Shuichi Hirahara, Tasuku Soma, Yuichi Yoshida:
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits. NeurIPS 2020 - 2019
- [c81]Hubie Chen, Yuichi Yoshida:
Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. PODS 2019: 365-382 - [c80]Tasuku Soma, Yuichi Yoshida:
Spectral Sparsification of Hypergraphs. SODA 2019: 2570-2581 - [c79]Yuichi Yoshida:
Cheeger Inequalities for Submodular Transformations. SODA 2019: 2582-2601 - [c78]Koh Takeuchi, Yuichi Yoshida, Yoshinobu Kawahara:
Variational Inference of Penalized Regression with Submodular Functions. UAI 2019: 1202-1211 - [c77]Shogo Murai, Yuichi Yoshida:
Estimating Walk-Based Similarities Using Random Walk. WWW 2019: 1321-1331 - [c76]Shogo Murai, Yuichi Yoshida:
Sensitivity Analysis of Centralities on Unweighted Networks. WWW 2019: 1332-1342 - 2018
- [c75]Yusuke Sekikawa, Kohta Ishikawa, Kosuke Hara, Yuichi Yoshida, Koichiro Suzuki, Ikuro Sato, Hideo Saito:
Constant Velocity 3D Convolution. 3DV 2018: 343-351 - [c74]Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Using k-Way Co-Occurrences for Learning Word Embeddings. AAAI 2018: 5037-5044 - [c73]Masaaki Imaizumi, Takanori Maehara, Yuichi Yoshida:
Statistically Efficient Estimation for Non-Smooth Probability Densities. AISTATS 2018: 978-987 - [c72]Fanhua Shang, Yuanyuan Liu, Kaiwen Zhou, James Cheng, Kelvin Kai Wing Ng, Yuichi Yoshida:
Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization. AISTATS 2018: 1027-1036 - [c71]Amit Levi, Yuichi Yoshida:
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices. APPROX-RANDOM 2018: 17:1-17:19 - [c70]Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. FOCS 2018: 462-473 - [c69]Tasuku Soma, Yuichi Yoshida:
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. ICALP 2018: 99:1-99:14 - [c68]Takeru Miyato, Toshiki Kataoka, Masanori Koyama, Yuichi Yoshida:
Spectral Normalization for Generative Adversarial Networks. ICLR 2018 - [c67]Daisuke Hatano, Yuichi Yoshida:
Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games. IJCAI 2018: 310-316 - 2017
- [c66]Wataru Inariba, Takuya Akiba, Yuichi Yoshida:
Random-Radius Ball Method for Estimating Closeness Centrality. AAAI 2017: 125-131 - [c65]Daisuke Hatano, Yuichi Yoshida:
Computing Least Cores of Supermodular Cooperative Games. AAAI 2017: 551-557 - [c64]Tasuku Soma, Yuichi Yoshida:
Non-Monotone DR-Submodular Function Maximization. AAAI 2017: 898-904 - [c63]Tasuku Soma, Yuichi Yoshida:
Regret Ratio Minimization in Multi-Objective Submodular Function Maximization. AAAI 2017: 905-911 - [c62]Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida:
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. APPROX-RANDOM 2017: 11:1-11:14 - [c61]Kohei Hayashi, Yuichi Yoshida:
Fitting Low-Rank Tensors in Constant Time. NIPS 2017: 2473-2481 - [c60]Lucien D. J. Valstar, George H. L. Fletcher, Yuichi Yoshida:
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries. SIGMOD Conference 2017: 345-358 - [c59]Naoto Ohsaka, Yuichi Yoshida:
Portfolio Optimization for Influence Spread. WWW 2017: 977-985 - 2016
- [c58]Yusuke Sekikawa, Koichiro Suzuki, Yuichi Yoshida, Kosuke Hara, Ikuro Sato:
Fast Eigen Matching. BMVC 2016 - [c57]Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
Testing Assignments to Constraint Satisfaction Problems. FOCS 2016: 525-534 - [c56]Takanori Hayashi, Takuya Akiba, Yuichi Yoshida:
Efficient Algorithms for Spanning Tree Centrality. IJCAI 2016: 3733-3739 - [c55]Tasuku Soma, Yuichi Yoshida:
Maximizing Monotone Submodular Functions over the Integer Lattice. IPCO 2016: 325-336 - [c54]Kohei Hayashi, Yuichi Yoshida:
Minimizing Quadratic Functions in Constant Time. NIPS 2016: 2217-2225 - [c53]Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. SODA 2016: 404-413 - [c52]Tasuku Soma, Yuichi Yoshida:
Non-convex Compressed Sensing with the Sum-of-Squares Method. SODA 2016: 570-579 - [c51]Yuichi Yoshida:
Gowers Norm, Function Limits, and Parameter Estimation. SODA 2016: 1391-1406 - [c50]Yuichi Yoshida:
Nonlinear Laplacian for Digraphs and its Applications to Network Analysis. WSDM 2016: 483-492 - 2015
- [c49]Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida:
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. AAAI 2015: 2-8 - [c48]Daisuke Hatano, Yuichi Yoshida:
Distributed Multiplicative Weights Methods for DCOP. AAAI 2015: 2074-2080 - [c47]Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Learning Word Representations from Relational Graphs. AAAI 2015: 2146-2152 - [c46]Yoichi Iwata, Yuichi Yoshida:
On the Equivalence among Problems of Bounded Width. ESA 2015: 754-765 - [c45]Naoto Ohsaka, Yuichi Yoshida:
Monotone k-Submodular Function Maximization with Size Constraints. NIPS 2015: 694-702 - [c44]Tasuku Soma, Yuichi Yoshida:
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice. NIPS 2015: 847-855 - 2014
- [c43]Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. AAAI 2014: 138-144 - [c42]Yuji Yamauchi, Mitsuru Ambai, Ikuro Sato, Yuichi Yoshida, Hironobu Fujiyoshi, Takayoshi Yamashita:
Asymmetric Feature Representation for Object Recognition in Client Server System. ACCV (1) 2014: 598-612 - [c41]Suguru Tamaki, Yuichi Yoshida:
Robust Approximation of Temporal CSP. APPROX-RANDOM 2014: 419-432 - [c40]Mitsuru Kusumoto, Yuichi Yoshida:
Testing Forest-Isomorphism in the Adjacency List Model. ICALP (1) 2014: 763-774 - [c39]Takahiro Hasegawa, Yuji Yamauchi, Mitsuru Ambai, Yuichi Yoshida, Hironobu Fujiyoshi:
Keypoint detection by cascaded fast. ICIP 2014: 5676-5680 - [c38]Yuichi Yoshida, Yuan Zhou:
Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. ITCS 2014: 423-438 - [c37]Kazuo Iwama, Yuichi Yoshida:
Parameterized testability. ITCS 2014: 507-516 - [c36]Yuichi Yoshida:
Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches. KDD 2014: 1416-1425 - [c35]Yoichi Iwata, Keigo Oka, Yuichi Yoshida:
Linear-Time FPT Algorithms via Network Flow. SODA 2014: 1749-1761 - [c34]Yuichi Yoshida:
A characterization of locally testable affine-invariant properties via decomposition theorems. STOC 2014: 154-163 - [c33]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. WWW 2014: 237-248 - 2013
- [c32]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. CIKM 2013: 909-918 - [c31]Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. CIKM 2013: 1601-1606 - [c30]Arnab Bhattacharyya, Yuichi Yoshida:
An Algebraic Characterization of Testable Boolean CSPs. ICALP (1) 2013: 123-134 - [c29]Karl Wimmer, Yuichi Yoshida:
Testing Linear-Invariant Function Isomorphism. ICALP (1) 2013: 840-850 - [c28]Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Mining for Analogous Tuples from an Entity-Relation Graph. IJCAI 2013: 2064-2070 - [c27]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast exact shortest-path distance queries on large networks by pruned landmark labeling. SIGMOD Conference 2013: 349-360 - [c26]Yoichi Iwata, Yuichi Yoshida:
Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. STACS 2013: 127-138 - [c25]Ken-ichi Kawarabayashi, Yuichi Yoshida:
Testing subdivision-freeness: property testing meets structural graph theory. STOC 2013: 437-446 - 2012
- [c24]Suguru Tamaki, Yuichi Yoshida:
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. APPROX-RANDOM 2012: 313-324 - [c23]Yuichi Yoshida:
Testing List H-homomorphisms. CCC 2012: 85-95 - [c22]Eric Blais, Amit Weinstein, Yuichi Yoshida:
Partially Symmetric Functions Are Efficiently Isomorphism-Testable. FOCS 2012: 551-560 - [c21]Hiro Ito, Stefan Langerman, Yuichi Yoshida:
Algorithms and Complexity of Generalized River Crossing Problems. FUN 2012: 235-244 - [c20]Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito:
Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. ICNC 2012: 407-413 - [c19]Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida:
Constant-Time Algorithms for Sparsity Matroids. ICALP (1) 2012: 498-509 - [c18]Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou:
Linear programming, width-1 CSPs, and robust satisfaction. ITCS 2012: 484-495 - [c17]Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida:
Constant-Time Approximation Algorithms for the Knapsack Problem. TAMC 2012: 131-142 - 2011
- [c16]Yuichi Yoshida:
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs. CCC 2011: 34-44 - [c15]François Le Gall, Yuichi Yoshida:
Property Testing for Cyclic Groups and Beyond. COCOON 2011: 432-443 - [c14]Yusuke Kobayashi, Yuichi Yoshida:
Algorithms for Finding a Maximum Non-k-linked Graph. ESA 2011: 131-142 - [c13]Mitsuru Ambai, Yuichi Yoshida:
CARD: Compact And Real-time Descriptors. ICCV 2011: 97-104 - [c12]Yuichi Yoshida:
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP. STOC 2011: 665-674 - 2010
- [c11]Daisuke Okanohara, Yuichi Yoshida:
Conjunctive Filter: Breaking the Entropy Barrier. ALENEX 2010: 77-83 - [c10]Yuichi Yoshida, Hiro Ito:
Testing Outerplanarity of Bounded Degree Graphs. APPROX-RANDOM 2010: 642-655 - [c9]Suguru Tamaki, Yuichi Yoshida:
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness. APPROX-RANDOM 2010: 738-751 - 2009
- [c8]Mitsuru Ambai, Yuichi Yoshida:
Multiclass VisualRank: image ranking method in clustered subsets based on visual features. SIGIR 2009: 732-733 - [c7]Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
An improved constant-time approximation algorithm for maximum matchings. STOC 2009: 225-234 - 2008
- [c6]Yuichi Yoshida, Hiro Ito:
Property Testing on k-Vertex-Connectivity of Graphs. ICALP (1) 2008: 539-550 - 2007
- [c5]Yuichi Yoshida, Kento Miyaoku, Takashi Satou:
Mobile Magic Hand: Camera Phone Based Interaction Using Visual Code and Optical Flow. HCI (2) 2007: 513-521 - [c4]Eri Sato, Shoichiro Sakurai, Aika Nakajima, Yuichi Yoshida, Toru Yamaguchi:
Context-based interaction using pointing movements recognition for an intelligent home service robot. RO-MAN 2007: 854-859 - 2005
- [c3]Yuichi Yoshida, Kento Miyaoku, Takashi Satou, Suguru Higashino:
Mobile Reacher Interface for Intuitive Information Navigation. INTERACT 2005: 1091-1095 - 2002
- [c2]Yuichi Yoshida, Yasunori Yamagishi, Kazuki Kanamori, Naoki Saiwaki, Shogo Nishida:
The Musical Session System with the Visual Interface. ICMC 2002 - 1995
- [c1]Takayuki Arai, Keiko Okazaki, Setsuko Imatomi, Yuichi Yoshida:
Analysis for palatalized articulation of [s] sounds using synthetic speech. EUROSPEECH 1995: 1725-1728
Editorship
- 2023
- [e1]Olaf Hartig, Yuichi Yoshida:
Proceedings of the 6th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Seattle, WA, USA, 18 June 2023. ACM 2023 [contents]
Reference Works
- 2019
- [r1]Laks V. S. Lakshmanan, Panayiotis Tsaparas, Yuichi Yoshida:
Influence Analytics in Graphs. Encyclopedia of Big Data Technologies 2019
Informal and Other Publications
- 2024
- [i81]Yuta Kawachi, Mitsuru Ambai, Yuichi Yoshida, Gaku Takano:
PMSM transient response optimization by end-to-end optimal control. CoRR abs/2402.03820 (2024) - [i80]Junpei Komiyama, Shinji Ito, Yuichi Yoshida, Souta Koshino:
Replicability is Asymptotically Free in Multi-armed Bandits. CoRR abs/2402.07391 (2024) - [i79]Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida, Felix Zhou:
Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis. CoRR abs/2405.08938 (2024) - [i78]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Allocations for Optimization Games. CoRR abs/2405.11889 (2024) - [i77]Soh Kumabe, Yuichi Yoshida:
Average sensitivity of the Knapsack Problem. CoRR abs/2405.13343 (2024) - [i76]Uri Meir, Gregory Schwartzman, Yuichi Yoshida:
Stochastic Distance in Property Testing. CoRR abs/2407.14080 (2024) - 2023
- [i75]Yuri Kinoshita, Kenta Oono, Kenji Fukumizu, Yuichi Yoshida, Shin-ichi Maeda:
Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network. CoRR abs/2304.12770 (2023) - [i74]Jing Dong, Yuichi Yoshida:
General Transformation for Consistent Online Approximation Algorithms. CoRR abs/2306.07163 (2023) - [i73]Kaito Fujii, Yuichi Yoshida:
The Secretary Problem with Predictions. CoRR abs/2306.08340 (2023) - [i72]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Algorithms for Covering Problems. CoRR abs/2307.08213 (2023) - [i71]Augusto Modanese, Yuichi Yoshida:
Testing Spreading Behavior in Networks with Arbitrary Topologies. CoRR abs/2309.05442 (2023) - [i70]Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida:
Online Algorithms for Spectral Hypergraph Sparsification. CoRR abs/2310.02643 (2023) - 2022
- [i69]Akbar Rafiey, Yuichi Yoshida:
Sparsification of Decomposable Submodular Functions. CoRR abs/2201.07289 (2022) - [i68]Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. CoRR abs/2204.08404 (2022) - [i67]Pan Peng, Yuichi Yoshida:
Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders. CoRR abs/2210.12601 (2022) - [i66]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Algorithms for Graph Problems. CoRR abs/2211.04674 (2022) - [i65]Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i64]Danushka Bollegala, Huda Hakami, Yuichi Yoshida, Ken-ichi Kawarabayashi:
RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding. CoRR abs/2101.10070 (2021) - [i63]Tasuku Soma, Yuichi Yoshida:
Online Risk-Averse Submodular Maximization. CoRR abs/2105.09838 (2021) - [i62]Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida:
Spectral Hypergraph Sparsifiers of Nearly Linear Size. CoRR abs/2106.02353 (2021) - [i61]Pan Peng, Daniel Lopatta, Yuichi Yoshida, Gramoz Goranci:
Local Algorithms for Estimating Effective Resistance. CoRR abs/2106.03476 (2021) - [i60]Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of Dynamic Programming. CoRR abs/2111.02657 (2021) - 2020
- [i59]Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. CoRR abs/2002.05477 (2020) - [i58]Tasuku Soma, Yuichi Yoshida:
Statistical Learning with Conditional Value at Risk. CoRR abs/2002.05826 (2020) - [i57]Richard Santiago, Yuichi Yoshida:
Weakly Submodular Function Maximization Using Local Submodularity Ratio. CoRR abs/2004.14650 (2020) - [i56]Pan Peng, Yuichi Yoshida:
Average Sensitivity of Spectral Clustering. CoRR abs/2006.04094 (2020) - [i55]Yuuki Takai, Atsushi Miyauchi, Masahiro Ikeda, Yuichi Yoshida:
Hypergraph Clustering Based on PageRank. CoRR abs/2006.08302 (2020) - [i54]Akbar Rafiey, Yuichi Yoshida:
Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. CoRR abs/2006.15744 (2020) - [i53]Nathaniel Harms, Yuichi Yoshida:
Downsampling for Testing and Learning in Product Distributions. CoRR abs/2007.07449 (2020) - [i52]Yuichi Yoshida, Samson Zhou:
Sensitivity Analysis of the Maximum Matching Problem. CoRR abs/2009.04556 (2020) - [i51]Conor McMeel, Yuichi Yoshida:
Sensitivity Analysis of Submodular Function Maximization. CoRR abs/2010.04281 (2020) - [i50]Michael Kapralov, Robert Krauthgamer, Jakab Tardos, Yuichi Yoshida:
Towards Tight Bounds for Spectral Sparsification of Hypergraphs. CoRR abs/2011.06530 (2020) - [i49]Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i48]Kohei Hayashi, Masaaki Imaizumi, Yuichi Yoshida:
On Random Subsampling of Gaussian Process Regression: A Graphon-Based Analysis. CoRR abs/1901.09541 (2019) - [i47]Nithin Varma, Yuichi Yoshida:
Average Sensitivity of Graph Algorithms. CoRR abs/1904.03248 (2019) - [i46]Noah Fleming, Yuichi Yoshida:
Distribution-Free Testing of Linear Functions on R^n. CoRR abs/1909.03391 (2019) - 2018
- [i45]Takeru Miyato, Toshiki Kataoka, Masanori Koyama, Yuichi Yoshida:
Spectral Normalization for Generative Adversarial Networks. CoRR abs/1802.05957 (2018) - [i44]Fanhua Shang, Yuanyuan Liu, Kaiwen Zhou, James Cheng, Kelvin Kai Wing Ng, Yuichi Yoshida:
Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization. CoRR abs/1802.09933 (2018) - [i43]Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-Time Algorithms for Submodular Laplacian Systems. CoRR abs/1803.10923 (2018) - [i42]Amit Levi, Yuichi Yoshida:
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices. CoRR abs/1806.10626 (2018) - [i41]Tasuku Soma, Yuichi Yoshida:
Spectral Sparsification of Hypergraphs. CoRR abs/1807.04974 (2018) - [i40]Masahiro Ikeda, Atsushi Miyauchi, Yuuki Takai, Yuichi Yoshida:
Finding Cheeger Cuts in Hypergraphs via Heat Equation. CoRR abs/1809.04396 (2018) - [i39]Kent Fujiwara, Ikuro Sato, Mitsuru Ambai, Yuichi Yoshida, Yoshiaki Sakakura:
Canonical and Compact Point Cloud Representation for Shape Classification. CoRR abs/1809.04820 (2018) - [i38]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Limits of Ordered Graphs and Images. CoRR abs/1811.02023 (2018) - 2017
- [i37]Fanhua Shang, Yuanyuan Liu, James Cheng, Kelvin Kai Wing Ng, Yuichi Yoshida:
Variance Reduced Stochastic Gradient Descent with Sufficient Decrease. CoRR abs/1703.06807 (2017) - [i36]Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. CoRR abs/1704.02700 (2017) - [i35]Yuichi Yoshida, Takeru Miyato:
Spectral Norm Regularization for Improving the Generalizability of Deep Learning. CoRR abs/1705.10941 (2017) - [i34]Yuichi Yoshida:
Cheeger Inequalities for Submodular Transformations. CoRR abs/1708.08781 (2017) - [i33]Danushka Bollegala, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Using $k$-way Co-occurrences for Learning Word Embeddings. CoRR abs/1709.01199 (2017) - [i32]Tasuku Soma, Yuichi Yoshida:
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. CoRR abs/1709.02910 (2017) - 2016
- [i31]Taro Takaguchi, Yuichi Yoshida:
Cycle and flow trusses in directed networks. CoRR abs/1603.03519 (2016) - [i30]Yuichi Yoshida:
Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint. CoRR abs/1607.04527 (2016) - [i29]Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
Testing Assignments to Constraint Satisfaction Problems. CoRR abs/1608.03017 (2016) - [i28]Kohei Hayashi, Yuichi Yoshida:
Minimizing Quadratic Functions in Constant Time. CoRR abs/1608.07179 (2016) - [i27]Tasuku Soma, Yuichi Yoshida:
Non-monotone DR-Submodular Function Maximization. CoRR abs/1612.00960 (2016) - [i26]Eric Blais, Yuichi Yoshida:
A Characterization of Constant-Sample Testable Properties. CoRR abs/1612.06016 (2016) - [i25]Eric Blais, Yuichi Yoshida:
A Characterization of Constant-Sample Testable Properties. Electron. Colloquium Comput. Complex. TR16 (2016) - [i24]George H. L. Fletcher, Taro Takaguchi, Yuichi Yoshida:
Analytics on complex networks: scalable solutions for empirical questions (NII Shonan Meeting 2016-1). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [i23]Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida:
Improved Approximation Algorithms for k-Submodular Function Maximization. CoRR abs/1502.07406 (2015) - [i22]Tasuku Soma, Yuichi Yoshida:
Maximizing Submodular Functions with the Diminishing Return Property over the Integer Lattice. CoRR abs/1503.01218 (2015) - [i21]Taro Takaguchi, Yosuke Yano, Yuichi Yoshida:
Coverage centralities for temporal networks. CoRR abs/1506.07032 (2015) - [i20]Kenta Oono, Yuichi Yoshida:
Testing Properties of Functions on Finite Groups. CoRR abs/1509.00930 (2015) - [i19]Yoichi Iwata, Yuichi Yoshida:
On the Equivalence among Problems of Bounded Width. CoRR abs/1509.01014 (2015) - 2014
- [i18]Yuichi Yoshida:
A Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems. CoRR abs/1402.2175 (2014) - [i17]Mitsuru Kusumoto, Yuichi Yoshida:
Testing Forest-Isomorphism in the Adjacency List Model. CoRR abs/1404.7060 (2014) - [i16]Yuichi Yoshida:
Gowers Norm, Function Limits, and Parameter Estimation. CoRR abs/1410.5053 (2014) - [i15]Danushka Bollegala, Takanori Maehara, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Learning Word Representations from Relational Graphs. CoRR abs/1412.2378 (2014) - [i14]Suguru Tamaki, Yuichi Yoshida:
Robust Approximation of Temporal CSP. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i13]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. CoRR abs/1304.4661 (2013) - [i12]Yoichi Iwata, Keigo Oka, Yuichi Yoshida:
Linear-Time FPT Algorithms via Network Flow. CoRR abs/1307.4927 (2013) - [i11]Taro Takaguchi, Takehisa Hasegawa, Yuichi Yoshida:
Suppressing epidemics on networks by exploiting observer nodes. CoRR abs/1312.6468 (2013) - 2012
- [i10]Arnab Bhattacharyya, Yuichi Yoshida:
Testing Assignments of Boolean CSPs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i9]Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida:
Constant-Time Algorithms for Sparsity Matroids. CoRR abs/1103.2581 (2011) - [i8]François Le Gall, Yuichi Yoshida:
Property Testing for Cyclic Groups and Beyond. CoRR abs/1105.1842 (2011) - [i7]Yuichi Yoshida:
Testing List H-Homomorphisms. CoRR abs/1106.3126 (2011) - [i6]Gábor Ivanyos, François Le Gall, Yuichi Yoshida:
On the distance between non-isomorphic groups. CoRR abs/1107.0133 (2011) - [i5]Eric Blais, Amit Weinstein, Yuichi Yoshida:
Partially Symmetric Functions are Efficiently Isomorphism-Testable. CoRR abs/1112.5741 (2011) - 2010
- [i4]Yuichi Yoshida:
Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP. CoRR abs/1006.3368 (2010) - [i3]Yuichi Yoshida:
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs. CoRR abs/1007.3292 (2010) - [i2]Yuichi Yoshida:
Optimal Constant-Time Approximation Algorithms and (Unconditional) Inapproximability Results for Every Bounded-Degree CSP. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [i1]Suguru Tamaki, Yuichi Yoshida:
A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. Electron. Colloquium Comput. Complex. TR09 (2009)
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-10-07 22:17 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:
