default search action
Katsushi Inoue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [c11]Katsushi Inoue, Akira Ito, Atsuyuki Inoue:
Sublogarithmically Space-Bounded Alternating One-Pebble Turing Machines with only Universal States. Formal Models, Languages and Applications 2007: 160-175 - 2006
- [j94]Makoto Saito, Makoto Sakamoto, Youichirou Nakama, Takao Ito, Katsushi Inoue, Hiroshi Furutani, Susumu Katayama:
Some properties of four-dimensional multicounter automata. Artif. Life Robotics 10(2): 166-170 (2006) - [j93]Tsunehiro Yoshinaga, Jianliang Xu, Katsushi Inoue:
Sublogarithmic Space-Bounded Multi-Inkdot Alternating Turing Machines with Only Existential (Universal) States. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1417-1420 (2006) - [j92]Hisao Hirakawa, Katsushi Inoue, Akira Ito:
Three-way two-dimensional alternating finite automata with rotated inputs. Inf. Sci. 176(11): 1546-1569 (2006) - [c10]Katsushi Inoue, Akira Ito, Yue Wang:
Matrix L-System and Paper Folding with Scissors. FCS 2006: 130-134 - 2005
- [j91]Tadayuki Makino, Hidenobu Okabe, Shinya Taniguchi, Makoto Sakamoto, Katsushi Inoue:
Three-dimensional multiinkdot automata. Artif. Life Robotics 9(2): 99-101 (2005) - [j90]Hisao Hirakawa, Katsushi Inoue, Akira Ito:
Three-Way Two-Dimensional Deterministic Finite Automata with Rotated Inputs. IEICE Trans. Inf. Syst. 88-D(1): 31-38 (2005) - [j89]Satoshi Inoue, Katsushi Inoue, Akira Ito, Yue Wang:
Path-Bounded One-Way Multihead Finite Automata. IEICE Trans. Inf. Syst. 88-D(1): 96-99 (2005) - [j88]Atsuyuki Inoue, Akira Ito, Kunihiko Hiraishi, Katsushi Inoue:
Inkdot versus Pebble over Two-Dimensional Languages. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1173-1180 (2005) - [j87]Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki:
Some properties of one-pebble Turing machines with sublogarithmic space. Theor. Comput. Sci. 341(1-3): 138-149 (2005) - 2004
- [j86]Katsushi Inoue, Akira Ito, Takashi Kamiura, Holger Petersen, Lan Zhang:
A Note On Rebound Turing Machines. Int. J. Found. Comput. Sci. 15(5): 791-807 (2004) - [j85]Atsuyuki Inoue, Katsushi Inoue, Akira Ito, Yue Wang, Tokio Okazaki:
A note on one-pebble two-dimensional Turing machines. Inf. Sci. 162(3-4): 295-314 (2004) - [j84]Pavol Duris, Juraj Hromkovic, Katsushi Inoue:
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. J. Comput. Syst. Sci. 68(3): 675-699 (2004) - 2003
- [j83]Atsuyuki Inoue, Katsushi Inoue, Akira Ito, Yue Wang, Tokio Okazaki:
A note on one-pebble two-dimensional Turing machines. Electron. Notes Discret. Math. 12: 360-371 (2003) - [j82]Tsunehiro Yoshinaga, Katsushi Inoue:
Las Vegas, Self-Verifying Nondeterministic and Deterministic One-Way Multi-Counter Automata with Bounded Time. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1207-1212 (2003) - [c9]Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki:
Some Properties of One-Pebble Turing Machines with Sublogarithmic Space. ISAAC 2003: 635-644 - 2002
- [j81]Tokio Okazaki, Atsuyuki Inoue, Katsushi Inoue, Akira Ito, Yue Wang:
Non-closure property of space-bounded two-dimensional alternating Turing machines. Inf. Sci. 146(1-4): 151-170 (2002) - [j80]Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang:
A Leaf-Size Hierarchy of Alternating Rebound Turing Machines. J. Autom. Lang. Comb. 7(3): 395-410 (2002) - [j79]Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang:
Probabilistic rebound Turing machines. Theor. Comput. Sci. 270(1-2): 739-760 (2002) - [c8]Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang:
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines. Developments in Language Theory 2002: 185-196 - 2001
- [j78]V. Uma Maheswari, Arul Siromoney, K. M. Mehata, Katsushi Inoue:
The Variable Precision Rough Set Inductive Logic Programming Model and Strings. Comput. Intell. 17(3): 460-471 (2001) - [j77]Géza Harváth, Katsushi Inoue, Akira Ito, Yue Wang:
Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces. Int. J. Found. Comput. Sci. 12(3): 397-409 (2001) - [j76]Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang:
Closure Property of Space-Bounded Two-Dimensional Alternating Turing Machines, Pushdown Automata, and Counter Automata. Int. J. Pattern Recognit. Artif. Intell. 15(7): 1143-1165 (2001) - [j75]Jianliang Xu, Tsunehiro Yoshinaga, Katsushi Inoue, Yue Wang, Akira Ito:
Alternation for sublogarithmic space-bounded alternating pushdown automata. Theor. Comput. Sci. 259(1-2): 475-492 (2001) - 2000
- [j74]Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang:
A Note on Three-Way Two-Dimensional Probabilistic Turing Machines. Int. J. Pattern Recognit. Artif. Intell. 14(4): 477-500 (2000) - [j73]Arul Siromoney, Katsushi Inoue:
Elementary sets and declarative biases in a restricted gRS-ILP model. Informatica (Slovenia) 24(1) (2000) - [j72]Arul Siromoney, Katsushi Inoue:
Consistency and Completeness in Rough Sets. J. Intell. Inf. Syst. 15(3): 207-220 (2000) - [c7]Pavol Duris, Juraj Hromkovic, Katsushi Inoue:
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. CCC 2000: 214-228 - [i1]Pavol Duris, Juraj Hromkovic, Katsushi Inoue:
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j71]Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang:
Space Hierarchies of Two-Dimensional Alternating Turing Machines, Pushdown Automata and Counter Automata. Int. J. Pattern Recognit. Artif. Intell. 13(4): 503-521 (1999) - [j70]Akira Ito, Katsushi Inoue, Yue Wang:
Decomposition Principle for Analyzing Region Quadtrees. Int. J. Pattern Recognit. Artif. Intell. 13(4): 555-571 (1999) - [j69]Yue Wang, Katsushi Inoue, Akira Ito, Tokio Okazaki:
A Note on Self-Modifying Finite Automata. Inf. Process. Lett. 72(1-2): 19-24 (1999) - [j68]Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang:
A Note on Two-Dimensional Probabilistic Turing Machines. Inf. Sci. 113(3-4): 205-220 (1999) - [j67]Tokio Okazaki, Katsushi Inoue, Akira Ito, Yue Wang:
Closure Properties of the Classes of Sets Recognized by Space-Bounded Two-Dimensional Probabilistic Turing Machines. Inf. Sci. 115(1-4): 61-81 (1999) - [c6]Arul Siromoney, Katsushi Inoue:
The Generic Rough Set Inductive Logic Programming Model and Motifs in Strings. RSFDGrC 1999: 158-167 - 1998
- [j66]Tokio Okazaki, Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang:
A Note on Two-Dimensional Probabilistic Finite Automata. Inf. Sci. 110(3-4): 303-314 (1998) - 1997
- [j65]Akira Ito, Katsushi Inoue, Yue Wang:
Nonclosure Properties of Two-Dimensional One-Marker Automata. Int. J. Pattern Recognit. Artif. Intell. 11(7): 1025-1050 (1997) - 1996
- [j64]Makoto Sakamoto, Katsushi Inoue:
Three-Dimensional Alternating Turing Machines with Only Universal States. Inf. Sci. 95(3): 155-190 (1996) - 1995
- [j63]Yue Wang, Jianliang Xu, Katsushi Inoue, Akira Ito:
A Note on One-way Auxiliary Pushdown Automata. IEICE Trans. Inf. Syst. 78-D(6): 778-782 (1995) - [j62]Tsunehiro Yoshinaga, Katsushi Inoue:
Alternating Finite Automata with Counters and Stack-Counters Operating in Realtime. IEICE Trans. Inf. Syst. 78-D(8): 929-938 (1995) - [j61]Akira Ito, Katsushi Inoue, Itsuo Takanami, Yue Wang:
The Effect of Inkdots for Two-Dimensional Automata. Int. J. Pattern Recognit. Artif. Intell. 9(5): 777-796 (1995) - [j60]Yue Wang, Katsushi Inoue, Itsuo Takanami:
Cooperating Systems of Three-Way, Two-Dimensional Finite Automata. Int. J. Pattern Recognit. Artif. Intell. 9(5): 797-811 (1995) - [j59]Akira Ito, Katsushi Inoue, Itsuo Takanami, Yue Wang:
Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines. Theor. Comput. Sci. 143(1): 123-135 (1995) - 1994
- [j58]Katsushi Inoue, Itsuo Takanami:
A Characterization of Recognizable Picture Languages. Int. J. Pattern Recognit. Artif. Intell. 8(2): 501-508 (1994) - [j57]Akira Ito, Katsushi Inoue, Itsuo Takanami, Yasuyoshi Inagaki:
Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. Int. J. Pattern Recognit. Artif. Intell. 8(2): 509-524 (1994) - [j56]Makoto Sakamoto, Akira Ito, Katsushi Inoue, Itsuo Takanami:
Simulation of Three-Dimensional One-Marker Automata by Five-Way Turing Machines. Inf. Sci. 77(1-2): 77-99 (1994) - [j55]Katsushi Inoue, Akira Ito, Itsuo Takanami:
On 1-inkdot Alternating Turing Machines with Small Space. Theor. Comput. Sci. 127(1): 171-179 (1994) - 1993
- [j54]Katsushi Inoue, Akira Ito, Itsuo Takanami, Tsunehiro Yoshinaga:
A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space. Inf. Process. Lett. 48(6): 285-288 (1993) - [j53]Makoto Sakamoto, Katsushi Inoue, Itsuo Takanami:
A note on three-dimensional alternating Turing machines with space smaller than log m. Inf. Sci. 72(3): 225-249 (1993) - [j52]Itsuo Takanami, Katsushi Inoue, Takahiro Watanabe, Minoru Oka:
Construction of fault-tolerant mesh-connected highly parallel computer and its performance analysis. Syst. Comput. Jpn. 24(8): 11-24 (1993) - [j51]Juraj Hromkovic, Katsushi Inoue:
A Note on Realtime One-Way Synchronized Alternating One-Counter Automata. Theor. Comput. Sci. 108(2): 393-400 (1993) - 1992
- [j50]Juraj Hromkovic, Katsushi Inoue, Branislav Rovan, Anna Slobodová, Itsuo Takanami, Klaus W. Wagner:
On the Power of One-Way Synchronized Alternating Machines with Small Space. Int. J. Found. Comput. Sci. 3(1): 65-79 (1992) - [j49]Katsushi Inoue, Itsuo Sakuramoto, Makoto Sakamoto, Itsuo Takanami:
Two Topics Concerning Two-Dimensional Automata Operating in Parallel. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 211-225 (1992) - [j48]Katsushi Inoue, Akira Ito, Itsuo Takanami:
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space. Inf. Process. Lett. 43(4): 225-227 (1992) - [c5]Katsushi Inoue, Itsuo Takanami:
A Characterization of Recognizable Picture Languages. ICPIA 1992: 133-143 - [c4]Akira Ito, Katsushi Inoue, Itsuo Takanami:
Constant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. ICPIA 1992: 144-158 - [e1]Akira Nakamura, Maurice Nivat, Ahmed Saoudi, Patrick Shen-Pei Wang, Katsushi Inoue:
Parallel Image Analysis, Second International Conference, ICPIA '92, Ube, Japan, December 21-23, 1992, Proceedings. Lecture Notes in Computer Science 654, Springer 1992, ISBN 3-540-56346-6 [contents] - 1991
- [j47]Katsushi Inoue, Akira Ito, Itsuo Takanami:
Alternating Turing Machines with Modified Accepting Structure. Int. J. Found. Comput. Sci. 2(4): 401-417 (1991) - [j46]Katsushi Inoue, Itsuo Takanami:
A survey of two-dimensional automata theory. Inf. Sci. 55(1-3): 99-121 (1991) - [j45]Katsushi Inoue, Akira Ito, Itsuo Takanami:
A Note on Real-Time One-Way Alternating Multicounter Machines. Theor. Comput. Sci. 88(2): 287-296 (1991) - 1990
- [j44]Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
A note on time-bounded bottom-up pyramid cellular acceptors. Inf. Sci. 51(2): 121-133 (1990)
1980 – 1989
- 1989
- [j43]Akira Ito, Katsushi Inoue, Itsuo Takanami:
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 393-404 (1989) - [j42]Juraj Hromkovic, Katsushi Inoue, Itsuo Takanami:
Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. J. Comput. Syst. Sci. 38(3): 431-451 (1989) - [j41]Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami:
One-Dimensional Bounded Cellular Acceptor with Rotated Inputs. A Relationship between ∧ and ∨ Types. Syst. Comput. Jpn. 20(3): 1-12 (1989) - [j40]Akira Ito, Katsushi Inoue, Itsuo Takanami:
Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation. Theor. Comput. Sci. 66(3): 273-287 (1989) - [j39]Katsushi Inoue, Itsuo Takanami, Juraj Hromkovic:
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines. Theor. Comput. Sci. 67(1): 99-110 (1989) - [p2]Akira Ito, Katsushi Inoue, Itsuo Takanami:
Complexity of Acceptance Problems for Two-Dimensional Automata. A Perspective in Theoretical Computer Science 1989: 70-94 - [p1]Akira Ito, Katsushi Inoue, Itsuo Takanami:
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. Array Grammars, Patterns and Recognizers 1989: 115-126 - 1988
- [j38]Katsushi Inoue, Itsuo Takanami:
Some Considerations About NPRIORITY(1) Without ROM. Inf. Process. Lett. 28(4): 215-219 (1988) - [j37]Akira Ito, Katsushi Inoue, Itsuo Takanami:
A note on three-way two-dimensional alternating Turing machines. Inf. Sci. 45(1): 1-22 (1988) - [c3]Katsushi Inoue, Itsuo Takanami:
A Survey of Two-Dimensional Automata Theory. IMYCS 1988: 72-91 - [c2]Akira Ito, Katsushi Inoue, Itsuo Takanami:
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. IMYCS 1988: 92-101 - 1987
- [j36]Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami:
Hierarchical properties of the κ -neighborhood template A-type 2-dimensional bounded cellular acceptor. Syst. Comput. Jpn. 18(5): 79-90 (1987) - [j35]Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami:
One-dimensional bounded cellular acceptor with rotated inputs. Syst. Comput. Jpn. 18(9): 52-63 (1987) - 1986
- [j34]Katsushi Inoue, Itsuo Takanami, Roland Vollmar:
Three-way two-dimensional finite automata with rotated inputs. Inf. Sci. 38(3): 271-282 (1986) - [j33]Akira Ito, Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Relationships of accepting powers between cellular space with bounded number of state-changes and other automata. Syst. Comput. Jpn. 17(7): 63-72 (1986) - [j32]Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami, Shigeko Seki:
Relationship between the accepting powers of (k, l)-neighborhood template δ-type one-dimensional bounded cellular acceptors and other types of two-dimensional automata. Syst. Comput. Jpn. 17(9): 20-28 (1986) - 1985
- [j31]Katsushi Inoue, Akira Ito, Itsuo Takanami, Hiroshi Taniguchi:
A space-hierarchy result on two-dimensional alternating Turing machines with only universal states. Inf. Sci. 35(1): 79-90 (1985) - [j30]Hiroshi Matsuno, Katsushi Inoue, Hiroshi Taniguchi, Itsuo Takanami:
Alternating Simple Multihead Finite Automata. Theor. Comput. Sci. 36: 291-308 (1985) - [j29]Katsushi Inoue, Itsuo Takanami, Roland Vollmar:
Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds. Theor. Comput. Sci. 41: 331-339 (1985) - 1984
- [j28]Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors. Comput. Vis. Graph. Image Process. 26(1): 126-129 (1984) - 1983
- [j27]Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors. Comput. Vis. Graph. Image Process. 22(2): 310-311 (1983) - [j26]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-dimensional automata with rotated inputs (projection-type). Inf. Sci. 30(1): 11-36 (1983) - [j25]Manabu Toda, Katsushi Inoue, Itsuo Takanami:
Two-Dimensional Pattern Matching by Two-Dimensional on-Line Tessellation Acceptors. Theor. Comput. Sci. 24: 179-194 (1983) - [j24]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines. Theor. Comput. Sci. 24: 331-336 (1983) - [j23]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-Dimensional Alternating Turing Machines. Theor. Comput. Sci. 27: 61-83 (1983) - 1982
- [j22]Akira Ito, Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-Dimensional Alternating Turing Machines with Only Universal States. Inf. Control. 55(1-3): 193-221 (1982) - [j21]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
A Note on Alternating On-Line Turing Machines. Inf. Process. Lett. 15(4): 164-168 (1982) - [j20]Hiroshi Taniguchi, Katsushi Inoue, Itsuo Takanami:
A note on three-dimensional finite automata. Inf. Sci. 26(1): 65-85 (1982) - [j19]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
A note on rebound automata. Inf. Sci. 26(1): 87-93 (1982) - [c1]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-Dimensional Alternating Turing Machines. STOC 1982: 37-46 - 1980
- [j18]Akira Nakamura, Katsushi Inoue:
A Remark on Two-Dimensional Finite Automata. Inf. Process. Lett. 10(4/5): 219-222 (1980) - [j17]Katsushi Inoue, Itsuo Takanami:
A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata. Inf. Process. Lett. 10(4/5): 245-248 (1980) - [j16]Katsushi Inoue, Itsuo Takanami:
A note on deterministic three-way tape-bounded two-dimensional Turing machines. Inf. Sci. 20(1): 41-55 (1980) - [j15]Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
Two-dimensional automata with rotated inputs. Inf. Sci. 21(3): 221-240 (1980) - [j14]Katsushi Inoue, Itsuo Takanami:
Errata: Corrections to two papers. Inf. Sci. 21(3): 261-262 (1980) - [j13]Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
Nonclosure property of nondeterministic two-dimensional finite automata under cyclic closure. Inf. Sci. 22(1): 45-50 (1980)
1970 – 1979
- 1979
- [j12]Katsushi Inoue, Akira Nakamura:
Two-Dimensional Multipass On-Line Tessellation Acceptors. Inf. Control. 41(3): 305-323 (1979) - [j11]Katsushi Inoue, Itsuo Takanami:
A Note on Cyclic Closure Operations. Inf. Process. Lett. 8(1): 15-16 (1979) - [j10]Katsushi Inoue, Itsuo Takanami:
A Note on Bottom-Up Pyramid Acceptors. Inf. Process. Lett. 8(1): 34-37 (1979) - [j9]Katsushi Inoue, Itsuo Takanami:
Three-way tape-bounded two-dimensional turing machines. Inf. Sci. 17(3): 195-220 (1979) - [j8]Katsushi Inoue, Itsuo Takanami:
On-line n-bounded multicounter automata. Inf. Sci. 17(3): 239-251 (1979) - [j7]Katsushi Inoue, Itsuo Takanami:
Closure properties of three-way and four-way tape-bounded two-dimensional turing machines. Inf. Sci. 18(3): 247-265 (1979) - [j6]Katsushi Inoue, Itsuo Takanami:
Three-way two-dimensional multicounter automata. Inf. Sci. 19(1): 1-20 (1979) - [j5]Katsushi Inoue, Itsuo Takanami, Akira Nakamura, Tadashi Ae:
One-Way Simple Multihead Finite Automata. Theor. Comput. Sci. 9: 311-328 (1979) - 1978
- [j4]Katsushi Inoue, Itsuo Takanami, Akira Nakamura:
A Note on Two-Dimensional Finite Automata. Inf. Process. Lett. 7(1): 49-52 (1978) - [j3]Katsushi Inoue, Itsuo Takanami:
A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines. Inf. Sci. 15(2): 143-158 (1978) - [j2]Katsushi Inoue, Itsuo Takanami:
Cyclic closure properties of automata on a two-dimensional tape. Inf. Sci. 15(3): 229-242 (1978) - 1977
- [j1]Katsushi Inoue, Akira Nakamura:
Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci. 13(2): 95-121 (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-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint