default search action
Atsushi Iwasaki
岩崎敦
Person information
- unicode name: 岩崎敦
- affiliation: University of Electro-Communications, Department of Informatics, Tokyo, Japan
- affiliation: Kyushu University, Department of Intelligent Systems, Fukuoka, Japan
- affiliation: Ericsson Research, Tokyo, Japan
- affiliation: NTT Communication Science Laboratories, Kyoto, Japan
- affiliation: Kobe University, Graduate School of Science and Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c73]Hakuei Yamada, Junpei Komiyama, Kenshi Abe, Atsushi Iwasaki:
Learning Fair Division from Bandit Feedback. AISTATS 2024: 3106-3114 - [c72]Kenshi Abe, Kaito Ariu, Mitsuki Sakamoto, Atsushi Iwasaki:
Adaptively Perturbed Mirror Descent for Learning in Games. ICML 2024 - [i16]Kenshi Abe, Mitsuki Sakamoto, Kaito Ariu, Atsushi Iwasaki:
Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games. CoRR abs/2410.02388 (2024) - 2023
- [c71]Kenshi Abe, Kaito Ariu, Mitsuki Sakamoto, Kentaro Toyoshima, Atsushi Iwasaki:
Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games. AISTATS 2023: 7999-8028 - [i15]Kenshi Abe, Kaito Ariu
, Mitsuki Sakamoto, Atsushi Iwasaki:
A Slingshot Approach to Learning in Monotone Games. CoRR abs/2305.16610 (2023) - [i14]Hakuei Yamada, Junpei Komiyama, Kenshi Abe, Atsushi Iwasaki:
Learning Fair Division from Bandit Feedback. CoRR abs/2311.09068 (2023) - 2022
- [j14]Yasunari Hikima, Atsushi Iwasaki
The Reference Distributions of Maurer's Universal Statistical Test and Its Improved Tests. IEEE Trans. Inf. Theory 68(4): 2674-2683 (2022) - [c70]Kenshi Abe, Junpei Komiyama, Atsushi Iwasaki:
Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search. IJCAI 2022: 3-9 - [c69]Kenshi Abe, Mitsuki Sakamoto, Atsushi Iwasaki:
Mutation-driven follow the regularized leader for last-iterate convergence in zero-sum games. UAI 2022: 1-10 - [i13]Kenshi Abe, Junpei Komiyama, Atsushi Iwasaki:
Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search. CoRR abs/2202.06570 (2022) - [i12]Akira Matsushita, Kei Ikegami, Kyohei Okumura, Yoji Tomita, Atsushi Iwasaki:
Regulating Matching Markets with Constraints: Data-driven Taxation. CoRR abs/2205.14387 (2022) - [i11]Kenshi Abe, Mitsuki Sakamoto, Atsushi Iwasaki:
Mutation-Driven Follow the Regularized Leader for Last-Iterate Convergence in Zero-Sum Games. CoRR abs/2206.09254 (2022) - [i10]Kenshi Abe, Kaito Ariu
Last-Iterate Convergence with Full- and Noisy-Information Feedback in Two-Player Zero-Sum Games. CoRR abs/2208.09855 (2022) - 2020
- [j13]Atsushi Iwasaki
Deriving the Variance of the Discrete Fourier Transform Test Using Parseval's Theorem. IEEE Trans. Inf. Theory 66(2): 1164-1170 (2020) - [c68]Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo:
Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach. AAAI 2020: 2038-2045 - [c67]Atsushi Iwasaki:
The relation between Proportion test and Uniformity test in NIST SP800-22. ISITA 2020: 372-376
2010 – 2019
- 2019
- [c66]Taiki Todo
Competitive Auctions and Envy-Freeness for Group of Agents. COCOON 2019: 541-553 - [i9]Yasushi Kawase, Atsushi Iwasaki:
Approximately Stable Matchings with General Constraints. CoRR abs/1907.04163 (2019) - 2018
- [j12]Suguru Ueda
Coalition structure generation in cooperative games with compact representations. Auton. Agents Multi Agent Syst. 32(4): 503-533 (2018) - [j11]Atsushi Iwasaki
Randomness Test to Solve Discrete Fourier Transform Test Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(8): 1204-1214 (2018) - [j10]Atsushi Iwasaki
Analysis of NIST SP800-22 focusing on randomness of each sequence. JSIAM Lett. 10: 1-4 (2018) - [c65]Yasushi Kawase, Atsushi Iwasaki:
Approximately Stable Matchings With Budget Constraints. AAAI 2018: 1113-1120 - [c64]Kota Shigedomi, Tadashi Sekiguchi, Atsushi Iwasaki, Makoto Yokoo
Repeated Triangular Trade: Sustaining Circular Cooperation with Observation Errors. PRIMA 2018: 242-257 - 2017
- [b1]Atsushi Iwasaki:
Study on permutation polynomials over a ring of modulo 2w and their applications to cryptography. Kyoto University, Japan, 2017 - [j9]Ryoji Kurata, Naoto Hamada, Atsushi Iwasaki, Makoto Yokoo
Controlled School Choice with Soft Bounds and Overlapping Types. J. Artif. Intell. Res. 58: 153-184 (2017) - [j8]Atsushi Iwasaki
One-stroke polynomials over a ring of modulo $2^w$. JSIAM Lett. 9: 5-8 (2017) - [c63]Fuuki Shigenaka, Tadashi Sekiguchi, Atsushi Iwasaki, Makoto Yokoo:
Achieving Sustainable Cooperation in Generalized Prisoner's Dilemma with Observation Errors. AAAI 2017: 677-683 - [c62]Yasushi Kawase, Atsushi Iwasaki:
Near-Feasible Stable Matchings with Budget Constraints. IJCAI 2017: 242-248 - [i8]Yasushi Kawase, Atsushi Iwasaki:
Near-feasible stable matchings with budget constraints. CoRR abs/1705.07643 (2017) - [i7]Yasushi Kawase, Atsushi Iwasaki:
Approximately Stable Matchings with Budget Constraints. CoRR abs/1711.07359 (2017) - 2016
- [j7]Masahiro Goto, Atsushi Iwasaki, Yujiro Kawasaki, Ryoji Kurata, Yosuke Yasuda
Strategyproof matching with regional minimum and maximum quotas. Artif. Intell. 235: 40-57 (2016) - [c61]Hiroaki Iwashita, Kotaro Ohori, Hirokazu Anai, Atsushi Iwasaki:
Simplifying Urban Network Security Games with Cut-Based Graph Contraction. AAMAS 2016: 205-213 - [c60]Fuuki Shigenaka, Shun Yamamoto, Motohide Seki, Tadashi Sekiguchi, Atsushi Iwasaki, Makoto Yokoo:
Achieving Sustainable Cooperation in Generalized Prisoner's Dilemma with Observation Errors: (Extended Abstract). AAMAS 2016: 1323-1324 - [c59]Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo:
How is Cooperation/collusion Sustained in Repeated Multimarket Contact with Observation Errors?: (Extended Abstract). AAMAS 2016: 1369-1370 - [i6]Atsushi Iwasaki, Ken Umeno:
Periodicity of odd degree Chebyshev polynomials over a ring of modulo $2^w$. CoRR abs/1602.08238 (2016) - [i5]Atsushi Iwasaki, Ken Umeno:
One-stroke polynomials over a ring of modulo $2^w$. CoRR abs/1605.03449 (2016) - [i4]Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo:
Repeated multimarket contact with observation errors. CoRR abs/1607.03583 (2016) - [i3]Atsushi Iwasaki, Ken Umeno:
Further improving security of Vector Stream Cipher. CoRR abs/1607.08311 (2016) - 2015
- [j6]Atsushi Iwasaki, Suguru Ueda, Naoyuki Hashimoto, Makoto Yokoo
Finding core for coalition structure utilizing dual solution. Artif. Intell. 222: 49-66 (2015) - [j5]Daniel Fragiadakis, Atsushi Iwasaki, Peter Troyan
Strategyproof Matching with Minimum Quotas. ACM Trans. Economics and Comput. 4(1): 6:1-6:40 (2015) - [c58]Ryoji Kurata, Masahiro Goto, Atsushi Iwasaki, Makoto Yokoo:
Controlled School Choice with Soft Bounds and Overlapping Types. AAAI 2015: 951-957 - [c57]Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo:
How Is Cooperation/Collusion Sustained in Repeated Multimarket Contact with Observation Errors? AAAI Fall Symposia 2015: 46-53 - [c56]Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Hidenao Iwane, Hirokazu Anai, Mingyu Guo, Makoto Yokoo:
Parametric Mechanism Design via Quantifier Elimination. AAMAS 2015: 1885-1886 - [c55]Masahiro Goto, Ryoji Kurata, Naoto Hamada, Atsushi Iwasaki, Makoto Yokoo:
Improving Fairness in Nonwasteful Matching with Hierarchical Regional Minimum Quotas. AAMAS 2015: 1887-1888 - 2014
- [c54]Masahiro Goto, Naoyuki Hashimoto, Atsushi Iwasaki, Yujiro Kawasaki, Suguru Ueda, Yosuke Yasuda, Makoto Yokoo:
Strategy-proof matching with regional minimum quotas. AAMAS 2014: 1225-1232 - [c53]Takashi Nishide, Mitsugu Iwamoto, Atsushi Iwasaki, Kazuo Ohta:
Secure (M+1) st-Price Auction with Automatic Tie-Break. INTRUST 2014: 422-437 - [c52]Katsutoshi Hirayama, Kenta Hanada, Suguru Ueda, Makoto Yokoo
Computing a Payoff Division in the Least Core for MC-nets Coalitional Games. PRIMA 2014: 319-332 - 2013
- [c51]Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Miao Yao, Makoto Yokoo:
VCG-equivalent in expectation mechanism: general framework for constructing iterative combinatorial auction mechanisms. AAMAS 2013: 699-706 - [c50]Atsushi Iwasaki, Suguru Ueda, Makoto Yokoo
Finding the Core for Coalition Structure Utilizing Dual Solution. IAT 2013: 114-121 - 2012
- [j4]Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo
Effect of DisCSP variable-ordering heuristics in scale-free networks. Multiagent Grid Syst. 8(2): 127-141 (2012) - [c49]Taiki Todo, Takayuki Mouri, Atsushi Iwasaki, Makoto Yokoo:
False-name-proofness in online mechanisms. AAMAS 2012: 753-762 - [c48]Suguru Ueda, Takato Hasegawa, Naoyuki Hashimoto, Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo:
Handling negative value rules in MC-net-based coalition structure generation. AAMAS 2012: 795-804 - [c47]Yongjoon Joe, Atsushi Iwasaki, Michihiro Kandori, Ichiro Obara, Makoto Yokoo:
Automated equilibrium analysis of repeated games with private monitoring: a POMDP approach. AAMAS 2012: 1305-1306 - [c46]Suguru Ueda, Daniel Fragiadakis, Atsushi Iwasaki, Peter Troyan, Makoto Yokoo:
Strategy-proof mechanisms for two-sided matching with minimum and maximum quotas. AAMAS 2012: 1327-1328 - [c45]Tenda Okimoto, Yongjoon Joe
Interactive Algorithm for Multi-Objective Constraint Optimization. CP 2012: 561-576 - [c44]Dong Hao, Atsushi Iwasaki, Makoto Yokoo
A differential game theoretic model for real-time spectrum pricing in cognitive radio networks. LCN 2012: 236-239 - 2011
- [c43]Atsushi Iwasaki, Atsushi Katsuragi, Makoto Yokoo:
False-name bidding in first-price combinatorial auctions with incomplete information. AAMAS 2011: 541-548 - [c42]Taiki Todo, Atsushi Iwasaki, Makoto Yokoo:
False-name-proof mechanism design without money. AAMAS 2011: 651-658 - [c41]Ryo Ichimura, Takato Hasegawa, Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo:
Extension of MC-net-based coalition structure generation: handling negative rules and externalities. AAMAS 2011: 1173-1174 - [c40]Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo:
Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds. AAMAS 2011: 1269-1270 - [c39]Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makoto Yokoo:
Concise characteristic function representations in coalitional games based on agent types. AAMAS 2011: 1271-1272 - [c38]Tenda Okimoto, Yongjoon Joe
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds. CP 2011: 660-674 - [c37]Taiki Todo
Generalizing Envy-Freeness toward Group of Agents. IJCAI 2011: 386-392 - [c36]Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makoto Yokoo
Concise Characteristic Function Representations in Coalitional Games Based on Agent Types. IJCAI 2011: 393-399 - [c35]Satomi Baba, Yongjoon Joe
Real-Time Solving of Quantified CSPs Based on Monte-Carlo Game Tree Search. IJCAI 2011: 655-661 - [c34]Yuko Sakurai, Suguru Ueda, Atsushi Iwasaki, Shin-ichi Minato, Makoto Yokoo
A Compact Representation Scheme of Coalitional Games Based on Multi-Terminal Zero-Suppressed Binary Decision Diagrams. PRIMA 2011: 4-18 - [i2]Atsushi Iwasaki, David Kempe, Mahyar Salek, Makoto Yokoo:
False-name-proof Mechanisms for Hiring a Team. CoRR abs/1106.2378 (2011) - 2010
- [j3]Yuko Sakurai, Atsushi Iwasaki, Makoto Yokoo
Keyword auction protocol for dynamically adjusting the number of advertisements. Web Intell. Agent Syst. 8(4): 331-341 (2010) - [c33]Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius-Calin Silaghi, Katsutoshi Hirayama, Toshihiro Matsui:
Coalition Structure Generation based on Distributed Constraint Optimization. AAAI 2010: 197-203 - [c32]Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori, Yuko Sakurai, Taiki Todo, Mingyu Guo, Makoto Yokoo:
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms. AAMAS 2010: 633-640 - [c31]Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius-Calin Silaghi, Katsutoshi Hirayama, Toshihiro Matsui:
Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem. AAMAS 2010: 781-788 - [c30]Taiki Todo
Characterization of Revenue Monotonicity in Combinatorial Auctions. IAT 2010: 383-390 - [c29]Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo
Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks. PRIMA 2010: 166-180 - [c28]Taiki Todo
False-Name-Proofness in Facility Location Problem on the Real Line. WINE 2010: 559-562
2000 – 2009
- 2009
- [c27]Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sakurai:
Characterizing false-name-proof allocation rules in combinatorial auctions. AAMAS (1) 2009: 265-272 - [c26]Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Makoto Yokoo:
Sequential partition mechanism for strongly budget-balanced redistribution. AAMAS (2) 2009: 1285-1286 - [c25]Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko Sakurai, Atsushi Iwasaki, Makoto Yokoo
Coalition Structure Generation Utilizing Compact Characteristic Function Representations. CP 2009: 623-638 - [c24]Yuki Iwanari, Makoto Tasaki, Makoto Yokoo
Introducing Communication in Dis-POMDPs with Finite State Machines. IAT 2009: 267-270 - [c23]Yuko Sakurai, Makoto Yokoo
Secure Keyword Auction: Preserving Privacy of Bidding Prices and CTRs. IAT 2009: 419-422 - [c22]Taiki Todo
Characterization of Strategy-Proof, Revenue Monotone Combinatorial Auction Mechanisms and Connection with False-Name-Proofness. WINE 2009: 561-568 - 2008
- [c21]Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsushi Iwasaki, Makoto Yokoo:
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments. AAMAS (2) 2008: 927-934 - [c20]Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Makoto Yokoo:
Beyond quasi-linear utility: strategy/false-name-proof multi-unit auction protocols. AAMAS (3) 2008: 1609-1612 - [c19]Yuko Sakurai, Atsushi Iwasaki, Makoto Yokoo
Keyword Auction Protocol for Dynamically Adjusting the Number of Advertisements. IAT 2008: 410-416 - [c18]Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Makoto Yokoo:
Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols. IAT 2008: 417-423 - [c17]Yuko Sakurai, Atsushi Iwasaki, Yasumasa Saito, Makoto Yokoo
Gsp-exr: gsp protocol with an exclusive right for keyword auctions. WWW 2008: 1089-1090 - 2007
- [j2]Takayuki Ito, Makoto Yokoo, Shigeo Matsubara, Atsushi Iwasaki:
Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction. Syst. Comput. Jpn. 38(9): 44-51 (2007) - [c16]Makoto Yokoo, Atsushi Iwasaki:
Making VCG More Robust in Combinatorial Auctions via Submodular Approximation. AAAI 2007: 1679-1683 - [c15]Yuichi Yabu, Makoto Yokoo
Multiagent Planning with Trembling-Hand Perfect Equilibrium in Multiagent POMDPs. PRIMA 2007: 13-24 - [c14]Atsushi Iwasaki, David Kempe, Yasumasa Saito, Mahyar Salek, Makoto Yokoo:
False-Name-Proof Mechanisms for Hiring a Team. WINE 2007: 245-256 - 2006
- [c13]Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki Maruono, Vincent Conitzer, Tuomas Sandholm:
A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments. AAAI 2006: 697-702 - [c12]Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki:
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation. AAMAS 2006: 1135-1142 - [i1]Nicholas Feltovich, Atsushi Iwasaki, Sobei H. Oda:
Payoff levels, loss avoidance, and equilibrium selection in the Stag Hunt: an experimental study. Negotiation and Market Engineering 2006 - 2005
- [j1]Atsushi Iwasaki, Makoto Yokoo, Kenji Terada:
A robust open ascending-price multi-unit auction protocol against false-name bids. Decis. Support Syst. 39(1): 23-39 (2005) - [c11]Takayuki Ito, Makoto Yokoo, Atsushi Iwasaki, Shigeo Matsubara:
A New Strategy-Proof Greedy-Allocation Combinatorial Auction Protocol and Its Extension to Open Ascending Auction Protocol. AAAI 2005: 261-268 - [c10]Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki:
Coalitional Games in Open Anonymous Environments. AAAI 2005: 509-515 - [c9]Shinta Suigimoto, Masayuki Ariyoshi, Csaba Keszei, Zoltán Richard Turányi, András Gergely Valkó, Yoshinori Hayashi, Katsutoshi Nishida, Shin-ichi Isobe, Atsushi Iwasaki:
Experimental evaluations of feasibility and bottlenecks of IP2 mobility management. ICC 2005: 1407-1412 - [c8]Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki:
Coalitional Games in Open Anonymous Environments. IJCAI 2005: 1668-1669 - [c7]Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, Atsushi Iwasaki:
A New Solution Concept for Coalitional Games in Open Anonymous Environments. JSAI Workshops 2005: 53-64 - 2004
- [c6]Atsushi Iwasaki, Makoto Yokoo, Masafumi Matsuda:
Stability of the Truth-Telling Strategy in Multi-Unit Option Allocation Auctions: Laboratory Experimentation. AAMAS 2004: 1282-1283 - 2003
- [c5]Atsushi Iwasaki, Makoto Yokoo, Kenji Terada:
A robust open ascending-price multi-unit auction protocol against false-name bids. EC 2003: 85-92 - 2002
- [c4]Atsushi Iwasaki, Nobuhiro Kimura, Hikaru Seshake, Takehisa Ichijo, Masakazu Aso, Yuji Hibino:
Distributed adapter technology for enterprise network operations support. NOMS 2002: 875-877
1990 – 1999
- 1999
- [c3]Katsutoshi Ohtsuki, Sadaoki Furui, Atsushi Iwasaki, Naoyuki Sakurai:
Message-driven speech recognition and topic-word extraction. ICASSP 1999: 625-628 - [c2]Katsutoshi Ohtsuki, Sadaoki Furui, Naoyuki Sakurai, Atsushi Iwasaki, Zhipeng Zhang:
Recent advances in Japanese broadcast news transcription. EUROSPEECH 1999 - 1998
- [c1]Atsushi Iwasaki, Sobei H. Oda, Kanji Ueda:
Simulating a N-person Multi-stage Game for Making a State. SEAL 1998: 309-316
Coauthor Index
[c68] [c66] [j12] [c64] [j9] [c63] [j7] [c60] [c59] [i4] [j6] [j5] [c58] [c57] [c56] [c55] [c54] [c52] [c51] [c50] [j4] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [i2] [j3] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [j2] [c16] [c15] [c14] [c13] [c12] [j1] [c11] [c10] [c8] [c7] [c6] [c5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:32 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: