default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuo Iwama
Person information
- affiliation: Kyoto University, Japan
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j111]Kazuo Iwama
, Shuichi Miyazaki:
Marriage and Roommate. Int. J. Found. Comput. Sci. 34(7): 853-873 (2023)- [i22]Kazuo Iwama, Shuichi Miyazaki:
Marriage and Roommate. CoRR abs/2305.12841 (2023) - 2022
- [j110]Kazuo Iwama, Mike Paterson:
Bounded Hanoi. Am. Math. Mon. 129(4): 303-319 (2022) - [j109]Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao:
Tight competitive analyses of online car-sharing problems. Theor. Comput. Sci. 938: 86-96 (2022) - [c118]Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao:
Improving the Bounds of the Online Dynamic Power Management Problem. ISAAC 2022: 28:1-28:16 - [i21]Ya-Chun Liang, Kazuo Iwama, Chung-Shou Liao:
Improving the Bounds of the Online Dynamic Power Management Problem. CoRR abs/2209.12021 (2022) - 2021
- [j108]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 133 (2021) - [c117]Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama:
Tight Competitive Analyses of Online Car-Sharing Problems. ISAAC 2021: 50:1-50:14 - [i20]Kuan-Yun Lai, Ya-Chun Liang, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao:
Randomized Scheduling for the Online Car-sharing Problem. CoRR abs/2103.07367 (2021) - 2020
- [j107]Kazuo Iwama:
Letter from the Editor. Bull. EATCS 130 (2020) - [j106]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 131 (2020) - [j105]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 132 (2020) - [j104]Kazuo Iwama, Junichi Teruyama:
Improved average complexity for comparison-based sorting. Theor. Comput. Sci. 807: 201-219 (2020)
2010 – 2019
- 2019
- [j103]Kazuo Iwama:
Letter from the Editor. Bull. EATCS 127 (2019) - [j102]Kazuo Iwama:
Letter from the Editor. Bull. EATCS 128 (2019) - [j101]Kazuo Iwama:
Letter from the Editor. Bull. EATCS 129 (2019) - [j100]Kazuo Iwama, Atsuki Nagao:
Read-Once Branching Programs for Tree Evaluation Problems. ACM Trans. Comput. Theory 11(1): 5:1-5:12 (2019) - 2018
- [j99]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 124 (2018) - [j98]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 125 (2018) - [j97]Kazuo Iwama:
Letter from the Editor. Bull. EATCS 126 (2018) - [j96]Kazuo Iwama, Yuichi Yoshida:
Parameterized Testability. ACM Trans. Comput. Theory 9(4): 16:1-16:16 (2018) - [c116]Shogo Ehara, Kazuo Iwama, Junichi Teruyama:
Small Complexity Gaps for Comparison-Based Sorting. Adventures Between Lower Bounds and Higher Altitudes 2018: 280-296 - [i19]Kazuo Iwama, Junichi Teruyama, Shuntaro Tsuyama:
Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms. CoRR abs/1808.00674 (2018) - 2017
- [j95]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 121 (2017) - [j94]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 122 (2017) - [j93]Tim Roughgarden, Kazuo Iwama:
Twenty Lectures on Algorithmic Game Theory. Bull. EATCS 122 (2017) - [j92]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 123 (2017) - [c115]Kazuo Iwama, Junichi Teruyama:
Improved Average Complexity for Comparison-Based Sorting. WADS 2017: 485-496 - [i18]Kazuo Iwama, Junichi Teruyama:
Improved Average Complexity for Comparison-Based Sorting. CoRR abs/1705.00849 (2017) - 2016
- [j91]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Lower Quotas. Algorithmica 74(1): 440-465 (2016) - [j90]Juris Borzovs, Kazuo Iwama, Solvita Zarina:
Preface. Balt. J. Mod. Comput. 4(4) (2016) - [j89]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Comput. Complex. 25(4): 723-735 (2016) - [j88]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 118 (2016) - [j87]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 119 (2016) - [j86]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 120 (2016) - [j85]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Approximate strip packing: Revisited. Inf. Comput. 249: 110-120 (2016) - [c114]Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Total Stability in Stable Matching Games. SWAT 2016: 23:1-23:12 - [r4]Kazuo Iwama:
Exact Algorithms for k SAT Based on Local Search. Encyclopedia of Algorithms 2016: 678-680 - [r3]Kazuo Iwama, Shuichi Miyazaki:
Stable Marriage with Ties and Incomplete Lists. Encyclopedia of Algorithms 2016: 2071-2075 - 2015
- [j84]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 115 (2015) - [j83]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 116 (2015) - [j82]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 117 (2015) - [j81]Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting:
Online bin packing with (1, 1) and (2, R) bins. J. Comb. Optim. 30(2): 276-298 (2015) - [j80]Minseon Lee, Shuichi Miyazaki, Kazuo Iwama:
Finding Witnesses for Stability in the Hospitals/Residents Problem. J. Inf. Process. 23(2): 202-209 (2015) - [c113]Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties. APPROX-RANDOM 2015: 361-380 - [e6]Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann:
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9134, Springer 2015, ISBN 978-3-662-47671-0 [contents] - [e5]Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann:
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9135, Springer 2015, ISBN 978-3-662-47665-9 [contents] - [i17]Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Stable Nash Equilibria in the Gale-Shapley Matching Game. CoRR abs/1509.04344 (2015) - 2014
- [j79]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. Algorithmica 68(3): 758-775 (2014) - [j78]Kazuo Iwama:
Correction: Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. Algorithms 2014, 7, 166-185. Algorithms 7(2): 188 (2014) - [j77]David Avis, Kazuo Iwama, Daichi Paku:
Reputation games for undirected graphs. Discret. Appl. Math. 166: 1-13 (2014) - [j76]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 112 (2014) - [j75]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 113 (2014) - [j74]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 114 (2014) - [c112]Kazuo Iwama, Yuichi Yoshida:
Parameterized testability. ITCS 2014: 507-516 - [c111]Kazuo Iwama, Atsuki Nagao:
Read-Once Branching Programs for Tree Evaluation Problems. STACS 2014: 409-420 - [e4]Cristian S. Calude, Rusins Freivalds, Kazuo Iwama:
Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. Lecture Notes in Computer Science 8808, Springer 2014, ISBN 978-3-319-13349-2 [contents] - 2013
- [j73]Takao Inoshita, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Takashi Nagase:
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists. Algorithms 6(2): 371-382 (2013) - [j72]Kazuo Iwama:
Letter from the Bulletin Editor. Bull. EATCS 111 (2013) - [j71]Kazuo Iwama, Harumichi Nishimura:
Recovering Strings in Oracles: Quantum and Classic. Int. J. Found. Comput. Sci. 24(7): 979-994 (2013) - [j70]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42(2): 579-592 (2013) - [c110]Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting:
Online Bin Packing with (1, 1) and (2, R) Bins. COCOA 2013: 387-401 - [c109]Jing Chen, He Guo, Xin Han, Kazuo Iwama:
The Train Delivery Problem Revisited. ISAAC 2013: 601-611 - [e3]Kazuo Iwama, Yasuhito Kawano, Mio Murao:
Theory of Quantum Computation, Communication, and Cryptography, 7th Conference, TQC 2012, Tokyo, Japan, May 17-19, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7582, Springer 2013, ISBN 978-3-642-35655-1 [contents] - [i16]Gregory Z. Gutin, Kazuo Iwama, Dimitrios M. Thilikos:
Parameterized Complexity and the Understanding, Design, and Analysis of Heuristics (NII Shonan Meeting 2013-2). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j69]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation bounds for the Student-Project Allocation problem with preferences over projects. J. Discrete Algorithms 13: 59-66 (2012) - [j68]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum counterfeit coin problems. Theor. Comput. Sci. 456: 51-64 (2012) - [c108]Kazuo Iwama:
Recovering Strings in Oracles: Quantum and Classic. Developments in Language Theory 2012: 23 - [c107]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 - [c106]Kazuo Iwama:
Approximability of Stable Matching Problems. WALCOM 2012: 2 - [i15]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) - [i14]David Avis, Kazuo Iwama, Daichi Paku:
Reputation Games for Undirected Graphs. CoRR abs/1205.6683 (2012) - 2011
- [j67]Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi:
Average-case competitive analyses for one-way trading. J. Comb. Optim. 21(1): 83-107 (2011) - [j66]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412(7): 563-572 (2011) - [c105]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
The Hospitals/Residents Problem with Quota Lower Bounds. ESA 2011: 180-191 - [c104]David Avis, Kazuo Iwama, Daichi Paku:
Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. ISAAC 2011: 415-424 - [c103]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. TAMC 2011: 440-451 - 2010
- [j65]David F. Manlove, Robert W. Irving, Kazuo Iwama:
Guest Editorial: Special Issue on Matching Under Preferences. Algorithmica 58(1): 1-4 (2010) - [j64]Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki:
The Planar Hajós Calculus for Bounded Degree Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1000-1007 (2010) - [j63]Kazuo Iwama, Guochuan Zhang:
Online knapsack with resource augmentation. Inf. Process. Lett. 110(22): 1016-1020 (2010) - [j62]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation algorithms for the sex-equal stable marriage problem. ACM Trans. Algorithms 7(1): 2:1-2:17 (2010) - [j61]Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki:
The complexity of the Hajós calculus for planar graphs. Theor. Comput. Sci. 411(7-9): 1182-1191 (2010) - [c102]Takayuki Ichiba, Kazuo Iwama:
Averaging Techniques for Competitive Auctions. ANALCO 2010: 74-81 - [c101]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. ESA (2) 2010: 135-146 - [c100]Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki:
Improved Randomized Algorithms for 3-SAT. ISAAC (1) 2010: 73-84 - [c99]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. ISAAC (1) 2010: 85-96 - [i13]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. CoRR abs/1009.0416 (2010)
2000 – 2009
- 2009
- [j60]Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
Negation-Limited Complexity of Parity and Inverters. Algorithmica 54(2): 256-267 (2009) - [j59]Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
An improved approximation lower bound for finding almost stable maximum matchings. Inf. Process. Lett. 109(18): 1036-1040 (2009) - [j58]Kazuo Iwama, Eiji Miyano, Hirotaka Ono:
Drawing Borders Efficiently. Theory Comput. Syst. 44(2): 230-244 (2009) - [j57]Hiro Ito, Kazuo Iwama:
Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms 5(4): 40:1-40:21 (2009) - [c98]Rusins Freivalds, Kazuo Iwama:
Quantum Queries on Permutations with a Promise. CIAA 2009: 208-216 - [i12]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size. CoRR abs/0908.2468 (2009) - 2008
- [j56]Kazuo Iwama, Andrzej Lingas, Masaki Okita:
Max-Stretch Reduction for Tree Spanners. Algorithmica 50(2): 223-235 (2008) - [j55]Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. Algorithmica 51(3): 342-356 (2008) - [j54]Kazuo Iwama:
Editor's Foreword. Algorithms 1(1): 1 (2008) - [j53]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two Server Problems. Algorithms 1(1): 30-42 (2008) - [j52]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2301-2307 (2008) - [j51]Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa:
Online chasing problems for regular polygons. Inf. Process. Lett. 108(3): 155-159 (2008) - [j50]Xin Han, Kazuo Iwama, Guochuan Zhang:
Online Removable Square Packing. Theory Comput. Syst. 43(1): 38-55 (2008) - [j49]Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
Reductions for monotone Boolean circuits. Theor. Comput. Sci. 408(2-3): 208-212 (2008) - [c97]Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi:
Average-Case Competitive Analyses for One-Way Trading. COCOON 2008: 41-51 - [c96]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara:
Randomized Competitive Analysis for Two-Server Problems. ESA 2008: 161-172 - [c95]Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282 - [c94]Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita:
Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918 - [c93]Kazuo Iwama:
SAT, UNSAT and Coloring. SAT 2008: 153 - [e2]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
Moderately Exponential Time Algorithms, 19.10. - 24.10.2008. Dagstuhl Seminar Proceedings 08431, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r2]Kazuo Iwama:
Local Search Algorithms for kSAT. Encyclopedia of Algorithms 2008 - [r1]Kazuo Iwama, Shuichi Miyazaki:
Stable Marriage with Ties and Incomplete Lists. Encyclopedia of Algorithms 2008 - [i11]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
08431 Abstracts Collection - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i10]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch:
08431 Executive Summary - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i9]Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams:
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms 2008 - [i8]Xin Han, Kazuo Iwama, Guochuan Zhang:
On Two Dimensional Orthogonal Knapsack Problem. CoRR abs/0803.4260 (2008) - [i7]Kazuo Iwama, Suguru Tamaki:
The Complexity of the Hajos Calculus for Planar Graphs. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j48]Kazuo Iwama, Suguru Tamaki:
Exploiting partial knowledge of satisfying assignments. Discret. Appl. Math. 155(12): 1596-1603 (2007) - [j47]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3): 30 (2007) - [j46]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita:
Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1): 41-53 (2007) - [c92]Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM 2007: 337-345 - [c91]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. AAIM 2007: 358-367 - [c90]Kazuo Iwama, Guochuan Zhang:
Optimal Resource Augmentations for Online Knapsack. APPROX-RANDOM 2007: 180-188 - [c89]Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu:
Flow Time Minimization under Energy Constraints. ASP-DAC 2007: 866-871 - [c88]Kazuo Iwama, Takuya Nakashima:
An Improved Exact Algorithm for Cubic Graph TSP. COCOON 2007: 108-117 - [c87]Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka:
Properties of Symmetric Incentive Compatible Auctions. COCOON 2007: 264-273 - [c86]Kazuo Iwama, Eiji Miyano, Hirotaka Ono:
Drawing Borders Efficiently. FUN 2007: 213-226 - [c85]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121 - [c84]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Unbounded-Error Classical and Quantum Communication Complexity. ISAAC 2007: 100-111 - [c83]Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa:
Online Chasing Problems for Regular n-Gons. RIVF 2007: 36-41 - [c82]Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A 1.875: approximation algorithm for the stable marriage problem. SODA 2007: 288-297 - [c81]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206 - [c80]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita:
Quantum Network Coding. STACS 2007: 610-621 - [c79]Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation Algorithms for the Sex-Equal Stable Marriage Problem. WADS 2007: 201-213 - [c78]Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA 2007: 246-259 - 2006
- [j45]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama:
Density condensation of Boolean formulas. Discret. Appl. Math. 154(16): 2263-2270 (2006) - [j44]Hiro Ito, Kazuo Iwama, Takeyuki Tamura:
Efficient Methods for Determining DNA Probe Orders. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1292-1298 (2006) - [j43]Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto:
A (2 - clog N/N)-Approximation Algorithm for the Stable Marriage Problem. IEICE Trans. Inf. Syst. 89-D(8): 2380-2387 (2006) - [j42]Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings. IEICE Trans. Inf. Syst. 89-D(8): 2405-2410 (2006) - [j41]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita:
Quantum Biased Oracles. Inf. Media Technol. 1(1): 169-177 (2006) - [j40]Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006) - [c77]Kazuo Iwama:
Stable Matching Problems. ISAAC 2006: 1 - [c76]Takashi Horiyama, Kazuo Iwama, Jun Kawahara:
Finite-State Online Algorithms and Their Automated Competitive Analysis. ISAAC 2006: 71-80 - [c75]Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
Negation-Limited Complexity of Parity and Inverters. ISAAC 2006: 223-232 - [c74]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
(4, 1)-Quantum Random Access Coding Does Not Exist. ISIT 2006: 446-450 - [c73]Kazuo Iwama, Hiroki Morizumi:
Reductions for Monotone Boolean Circuits. MFCS 2006: 540-548 - [c72]Kazuo Iwama:
Classic and Quantum Network Coding. SWAT 2006: 3-4 - [c71]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita:
Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT 2006: 280-291 - [i6]Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita:
Quantum Network Coding. Complexity of Boolean Functions 2006 - [i5]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. CoRR abs/cs/0607046 (2006) - [i4]Xin Han, Kazuo Iwama, Guochuan Zhang:
New Upper Bounds on The Approximability of 3D Strip Packing. CoRR abs/cs/0607100 (2006) - [i3]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j39]Hiroshi Fujiwara, Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems. Algorithmica 42(1): 95-107 (2005) - [j38]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita:
Quantum Sampling for Balanced Allocations. IEICE Trans. Inf. Syst. 88-D(1): 39-46 (2005) - [j37]Kazuo Iwama, Akinori Kawachi:
Compact Routing with Stretch Factor of Less Than Three. IEICE Trans. Inf. Syst. 88-D(1): 47-52 (2005) - [j36]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333(3): 347-353 (2005) - [c70]Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi:
Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130 - [c69]Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga:
The Delayed k-Server Problem. FCT 2005: 281-292 - [c68]Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. ISAAC 2005: 902-914 - [c67]Kazuo Iwama:
Classic and Quantum Network Coding. ISPAN 2005: 10 - [c66]Tomokazu Imamura, Kazuo Iwama:
Approximating vertex cover on dense graphs. SODA 2005: 582-589 - [c65]Kazuo Iwama, Andrzej Lingas, Masaki Okita:
Max-stretch Reduction for Tree Spanners. WADS 2005: 122-133 - [c64]Xin Han, Kazuo Iwama, Guochuan Zhang:
Online Removable Square Packing. WAOA 2005: 216-229 - [i2]Hiroshi Fujiwara, Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j35]Kazuo Iwama:
Worst-Case Upper Bounds for kSAT (Column: Algorithmics). Bull. EATCS 82: 61-71 (2004) - [j34]Kazuo Iwama, Kouki Yonezawa:
The orthogonal CNN problem. Inf. Process. Lett. 90(3): 115-120 (2004) - [j33]Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto:
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs. J. Parallel Distributed Comput. 64(3): 319-326 (2004) - [j32]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325(3): 439-465 (2004) - [c63]Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji:
Approximated Vertex Cover for Graphs with Perfect Matchings. COCOON 2004: 132-142 - [c62]Hiro Ito, Kazuo Iwama, Takeyuki Tamura:
Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292 - [c61]Kazuo Iwama, Akinori Kawachi:
Approximated Two Choices in Randomized Load Balancing. ISAAC 2004: 545-557 - [c60]Kazuo Iwama, Suguru Tamaki:
Improved upper bounds for 3-SAT. SODA 2004: 328 - [c59]Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita:
Quantum Identification of Boolean Oracles. STACS 2004: 105-116 - [c58]Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto:
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. SWAT 2004: 349-361 - 2003
- [j31]Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura:
Inclusion-exclusion for k-CNF formulas. Inf. Process. Lett. 87(2): 111-117 (2003) - [j30]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36(6): 597-609 (2003) - [j29]Kazuo Iwama, Shigeru Yamashita:
Transformation Rules for CNOT-based Quantum Circuits and Their Applications. New Gener. Comput. 21(4): 297-317 (2003) - [j28]Kazuo Iwama, Akinori Kawachi:
A New Quantum Claw-finding Algorithm for Three Functions. New Gener. Comput. 21(4): 319-327 (2003) - [j27]Kazuo Iwama, Akihiro Matsuura, Mike Paterson:
A family of NFAs which need 2n- deterministic states. Theor. Comput. Sci. 301(1-3): 451-462 (2003) - [j26]Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott:
Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3): 431-447 (2003) - [c57]Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita:
Quantum Sampling for Balanced Allocations. COCOON 2003: 304-318 - [c56]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Randomized Approximation of the Stable Marriage Problem. COCOON 2003: 339-350 - [c55]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Improved Approximation of the Stable Marriage Problem. ESA 2003: 266-277 - [c54]Youichi Hanatani, Takashi Horiyama, Kazuo Iwama:
Density Condensation of Boolean Formulas. SAT 2003: 69-77 - [c53]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO 2003: 163-177 - [c52]Kazuo Iwama, Masaki Okita:
Compact Routing for Flat Networks. DISC 2003: 196-210 - [i1]Kazuo Iwama, Suguru Tamaki:
Improved Upper Bounds for 3-SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j25]Yuichi Asahiro, Refael Hassin, Kazuo Iwama:
Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1-3): 15-26 (2002) - [j24]Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. ACM J. Exp. Algorithmics 7: 2 (2002) - [j23]David F. Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Hard variants of stable marriage. Theor. Comput. Sci. 276(1-2): 261-279 (2002) - [j22]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online independent sets. Theor. Comput. Sci. 289(2): 953-962 (2002) - [c51]Kazuo Iwama, Yahiko Kambayashi, Shigeru Yamashita:
Transformation rules for designing CNOT-based quantum circuits. DAC 2002: 419-424 - [c50]Kazuo Iwama, Shiro Taketomi:
Removable Online Knapsack Problems. ICALP 2002: 293-305 - [c49]Hiroshi Fujiwara, Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems. ISAAC 2002: 476-488 - [c48]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
Inapproximability Results on Stable Marriage Problems. LATIN 2002: 554-568 - [c47]Kazuo Iwama, Hiroki Morizumi:
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. MFCS 2002: 353-364 - [c46]Kazuo Iwama, Masaki Okita:
Compact routing for average-case networks. PODC 2002: 255 - [c45]Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
Avoiding Routing Loops on the Internet. SIROCCO 2002: 197-210 - [c44]Masami Amano, Kazuo Iwama, Raymond H. Putra:
Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations. UMC 2002: 100-114 - 2001
- [j21]Kazuo Iwama, Eiji Miyano:
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. J. Algorithms 39(2): 145-161 (2001) - [j20]Kazuo Iwama, Eiji Miyano:
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41(2): 262-279 (2001) - [j19]Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano:
New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. 5(5): 17-38 (2001) - [j18]Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki:
Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. 261(2): 227-239 (2001) - [c43]Kazuo Iwama, Yasuo Okabe, Toshiro Takase:
Separating Oblivious and Non-oblivious BPs. COCOON 2001: 28-38 - [c42]Kazuo Iwama, Suguru Tamaki:
Exploiting Partial Knowledge of Satisfying Assignments. WAE 2001: 118-128 - 2000
- [j17]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000) - [j16]Kazuo Iwama, Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses. J. Parallel Distributed Comput. 60(2): 137-149 (2000) - [j15]Kazuo Iwama, Yahiko Kambayashi, Kazuya Takaki:
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theor. Comput. Sci. 237(1-2): 485-494 (2000) - [c41]Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online Independent Sets. COCOON 2000: 202-209 - [c40]Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda:
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC 2000: 204-215 - [c39]Kazuo Iwama, Akihiro Matsuura, Mike Paterson:
A Family of NFA's Which Need 2n -alpha Deterministic States. MFCS 2000: 436-445 - [c38]Kazuo Iwama, Akinori Kawachi:
Compact routing with stretch factor of less than three (brief announcement). PODC 2000: 337 - [c37]Kazuo Iwama, Eiji Miyano:
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. SPAA 2000: 186-195 - [c36]Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. WAE 2000: 123-134
1990 – 1999
- 1999
- [j14]Shuichi Miyazaki, Kazuo Iwama:
Approximation of coNP sets by NP-complete sets and its applications. Syst. Comput. Jpn. 30(7): 47-54 (1999) - [c35]Kazuo Iwama, Kouki Yonezawa:
Using Generalized Forecasts for Online Currency Conversion. COCOON 1999: 409-421 - [c34]Kazuo Iwama, Eiji Miyano:
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA 1999: 53-64 - [c33]Kazuo Iwama, David F. Manlove, Shuichi Miyazaki, Yasufumi Morita:
Stable Marriage with Incomplete Lists and Ties. ICALP 1999: 443-452 - [c32]Kazuo Iwama, Shuichi Miyazaki:
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. ISAAC 1999: 133-142 - [c31]Kazuo Iwama, Eiji Miyano:
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA 1999: 466-475 - [c30]Masami Amano, Kazuo Iwama:
Undecidability on Quantum Finite Automata. STOC 1999: 368-375 - 1998
- [j13]Kazuo Iwama, Eiji Miyano:
Better Approximations of Non-Hamiltonian Graphs. Discret. Appl. Math. 81(1-3): 239-261 (1998) - [j12]Kazuo Iwama, Chuzo Iwamoto:
A Canonical Form of Vector Machines. Inf. Comput. 141(1): 37-65 (1998) - [c29]Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki:
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON 1998: 229-240 - [c28]Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano:
New Bounds for Oblivious Mesh Routing. ESA 1998: 295-306 - [c27]Kazuo Iwama, Chuzo Iwamoto:
Improved Time and Space Hierarchies of One-Tape Off-Line TMs. MFCS 1998: 580-588 - [c26]Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima:
Optimizing OBDDs Is Still Intractable for Monotone Functions. MFCS 1998: 625-635 - 1997
- [j11]Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa:
A Faster Parallel Algorithm for k-Connectivity. Inf. Process. Lett. 61(5): 265-269 (1997) - [c25]Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki:
Local Search Algorithms for Partial MAXSAT. AAAI/IAAI 1997: 263-268 - [c24]Kazuo Iwama, Kensuke Hino, Hiroyuki Kurokawa, Sunao Sawada:
Random benchmark circuits with controlled attributes. ED&TC 1997: 90-97 - [c23]Kazuo Iwama, Kazuya Takaki:
Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's. Developments in Language Theory 1997: 147-154 - [c22]Kazuo Iwama, Eiji Miyano:
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. ESA 1997: 284-295 - [c21]Kazuo Iwama, Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses. IPPS 1997: 721-727 - [c20]Kazuo Iwama:
Complexity of Finding Short Resolution Proofs. MFCS 1997: 309-318 - 1996
- [j10]Kazuo Iwama, Chuzo Iwamoto:
alpha-Connectivity: A Gradually Nonparallel Graph Problem. J. Algorithms 20(3): 526-544 (1996) - [j9]Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi:
Routing Problems on the Mesh of Buses. J. Algorithms 20(3): 613-631 (1996) - [j8]Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed:
Time Lower Bounds do not Exist for CRCW PRAMs. Theor. Comput. Sci. 155(2): 411-424 (1996) - [c19]Byungki Cha, Kazuo Iwama:
Adding New Clauses for Faster Local Search. AAAI/IAAI, Vol. 1 1996: 332-337 - [c18]Kazuo Iwama, Chuzo Iwamoto:
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. CCC 1996: 24-32 - [c17]Shuichi Miyazaki, Kazuo Iwama, Yahiko Kambayashi:
Database Queries as Combinatorial Optimization Problems. CODAS 1996: 477-483 - [c16]Kazuo Iwama, Kazuya Takaki:
Satisfiability of 3CNF formulas with small clause/variable-ratio. Satisfiability Problem: Theory and Applications 1996: 315-333 - [c15]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. SWAT 1996: 136-148 - 1995
- [j7]Kazuo Iwama, Toniann Pitassi:
Exponential Lower Bounds for the Tree-Like Hajós Calculus. Inf. Process. Lett. 54(5): 289-294 (1995) - [c14]Kazuo Iwama, Eiji Miyano:
Intractability of Read-Once Resolution. SCT 1995: 29-36 - [c13]Kazuo Iwama, Shuichi Miyazaki:
Approximation of coNP Sets by NP-complete Sets. COCOON 1995: 11-20 - [c12]Byungki Cha, Kazuo Iwama:
Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. IJCAI 1995: 304-311 - [c11]Yuichi Asahiro, Kazuo Iwama:
Finding Dense Subgraphs. ISAAC 1995: 102-111 - 1994
- [j6]Kazuo Iwama, Yahiko Kambayashi:
A Simpler Parallel Algorithm for Graph Conectivity. J. Algorithms 16(2): 190-217 (1994) - [c10]Kazuo Iwama, Kensuke Hino:
Random Generation of Test Instances for Logic Optimizers. DAC 1994: 430-434 - [c9]Kazuo Iwama, Shuichi Miyazaki:
SAT-Varible Complexity of Hard Combinatorial Problems. IFIP Congress (1) 1994: 253-258 - [c8]Chuzo Iwamoto, Kazuo Iwama:
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. ISAAC 1994: 478-486 - 1993
- [j5]Chuzo Iwamoto, Kazuo Iwama:
Rs-vector algorithms for combinational problems. Syst. Comput. Jpn. 24(7): 41-51 (1993) - [j4]Kazuo Iwama:
ASPACE(o(log log n)) is Regular. SIAM J. Comput. 22(1): 136-146 (1993) - [c7]Yuichi Asahiro, Kazuo Iwama, Eiji Miyano:
Random generation of test instances with controlled attributes. Cliques, Coloring, and Satisfiability 1993: 377-393 - [c6]Kazuo Iwama:
Low-Level Tradeoffs between Reversals and Alternations. Developments in Language Theory 1993: 326-341 - 1992
- [c5]Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano:
Random Generation of Satisfiable and Unsatisfiable CNF Predicates. IFIP Congress (1) 1992: 322-328 - [c4]Kazuo Iwama, Eiji Miyano:
Routing Problems on the Mesh of Buses. ISAAC 1992: 155-164 - [e1]Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita:
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings. Lecture Notes in Computer Science 650, Springer 1992, ISBN 3-540-56279-6 [contents]
1980 – 1989
- 1989
- [j3]Kazuo Iwama:
CNF Satisfiability Test by Counting and Polynomial Average Time. SIAM J. Comput. 18(2): 385-391 (1989) - [c3]Kazuo Iwama, Yahiko Kambayashi:
An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses. IFIP Congress 1989: 305-310 - 1983
- [j2]Kazuo Iwama:
The Universe Problem for Unrestricted Flow Languages. Acta Informatica 19: 85-96 (1983) - [c2]Kazuo Iwama:
Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication. STOC 1983: 374-381 - 1982
- [c1]Kazuo Iwama:
On Equations Including String Variables. FOCS 1982: 226-235
1970 – 1979
- 1977
- [j1]Shuzo Yajima, Yahiko Kambayashi, Susumu Yoshida, Kazuo Iwama:
Labolink: An Optically Linked Laboratory Computer Network. Computer 10(11): 52-59 (1977)
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-08-27 22:53 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:
