default search action
Abuzer Yakaryilmaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c39]Aliya Khadieva
, Özlem Salehi
A Representative Framework for Implementing Quantum Finite Automata on Real Devices. UCNC 2024: 163-177 - [i66]Aliya Khadieva, Özlem Salehi, Abuzer Yakaryilmaz:
A Representative Framework for Implementing Quantum Finite Automata on Real Devices. CoRR abs/2406.11360 (2024) - 2023
- [c38]Mansur Ziiatdinov
GAPs for Shallow Implementation of Quantum Finite Automata. AFL 2023: 269-280 - 2022
- [j38]Marija Scekic, Abuzer Yakaryilmaz:
Comparing Quantum Software Development Kits for Introductory Level Education. Balt. J. Mod. Comput. 10(1) (2022) - [j37]Abuzer Yakaryilmaz:
Exclusive Affine Languages. Balt. J. Mod. Comput. 10(3) (2022) - [j36]Masaki Nakanishi, Kamil Khadiev
Exact Affine Counter Automata. Int. J. Found. Comput. Sci. 33(3&4): 349-370 (2022) - [j35]Stephen Z. D. Plachta, Markus Hiekkamäki
Quantum advantage using high-dimensional twisted photons as quantum finite automata. Quantum 6: 752 (2022) - [i65]Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryilmaz, Robert Fickler:
Quantum advantage using high-dimensional twisted photons as quantum finite automata. CoRR abs/2202.04915 (2022) - [i64]Abuzer Yakaryilmaz:
Real-valued affine automata compute beyond Turing machines. CoRR abs/2212.11834 (2022) - [i63]Abuzer Yakaryilmaz:
Classical and quantum Merlin-Arthur automata. CoRR abs/2212.13801 (2022) - [i62]Dandison C. Ukpabi, Heikki Karjaluoto, Astrid Bötticher, Anastasija Nikiforova
Framework for understanding quantum computing use cases from a multidisciplinary perspective and future research directions. CoRR abs/2212.13909 (2022) - 2021
- [j34]Rishat Ibrahimov, Kamil Khadiev
Error-Free Affine, Unitary, and Probabilistic OBDDs. Int. J. Found. Comput. Sci. 32(7): 827-847 (2021) - [j33]Mika Hirvensalo
Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20(2): 259-270 (2021) - [j32]Mika Hirvensalo
Correction to: Computational limitations of affine automata and generalized affine automata. Nat. Comput. 20(2): 271 (2021) - [c37]Abuzer Yakaryilmaz
Improved Constructions for Succinct Affine Automata. DCFS 2021: 188-199 - [c36]Utku Birkan, Özlem Salehi
Implementing Quantum Finite Automata Algorithms on Noisy Devices. ICCS (6) 2021: 3-16 - [c35]François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz:
Quantum Logarithmic Space and Post-Selection. TQC 2021: 10:1-10:17 - [c34]Aliya Khadieva, Abuzer Yakaryilmaz
Affine Automata Verifiers. UCNC 2021: 84-100 - [p1]Andris Ambainis, Abuzer Yakaryilmaz:
Automata and quantum computing. Handbook of Automata Theory (II.) 2021: 1457-1493 - [i61]Aliya Khadieva, Abuzer Yakaryilmaz:
Affine automata verifiers. CoRR abs/2104.11192 (2021) - [i60]François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz:
Quantum Logarithmic Space and Post-selection. CoRR abs/2105.02681 (2021) - [i59]Utku Birkan, Özlem Salehi, Viktor Olejár, Cem Nurlu, Abuzer Yakaryilmaz:
Implementing Quantum Finite Automata Algorithms on Noisy Devices. CoRR abs/2105.06184 (2021) - [i58]Abuzer Yakaryilmaz:
Improved constructions for succinct affine automata. CoRR abs/2106.16197 (2021) - [i57]Özlem Salehi, Abuzer Yakaryilmaz:
State-efficient QFA Algorithm for Quantum Computers. CoRR abs/2107.02262 (2021) - 2020
- [j31]Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz:
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. Discret. Math. Theor. Comput. Sci. 22(1) (2020)
2010 – 2019
- 2019
- [j30]Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova:
New results on classical and quantum counter automata. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j29]Maksims Dimitrijevs
Uncountable Realtime Probabilistic Classes. Int. J. Found. Comput. Sci. 30(8): 1317-1333 (2019) - [j28]Özlem Salehi
New Results on Vector and Homing Vector Automata. Int. J. Found. Comput. Sci. 30(8): 1335-1361 (2019) - [j27]Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say
Alternating, private alternating, and quantum alternating realtime automata. Log. Methods Comput. Sci. 15(3) (2019) - [c33]Mika Hirvensalo, Etienne Moutot
Computational Limitations of Affine Automata. UCNC 2019: 108-121 - [i56]Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz:
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. CoRR abs/1904.01381 (2019) - [i55]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
Computational Limitations of Affine Automata. CoRR abs/1904.02428 (2019) - [i54]Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
New Results on Vector and Homing Vector Automata. CoRR abs/1905.11857 (2019) - 2018
- [j26]Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable classical and quantum complexity classes. RAIRO Theor. Informatics Appl. 52(2-3-4): 111-126 (2018) - [j25]Marcos Villagra
Language recognition power and succinctness of affine automata. Nat. Comput. 17(2): 283-293 (2018) - [j24]Aida Gainutdinova, Abuzer Yakaryilmaz
Unary probabilistic and quantum automata on promise problems. Quantum Inf. Process. 17(2): 28 (2018) - [c32]Rishat Ibrahimov, Kamil Khadiev
Error-Free Affine, Unitary, and Probabilistic OBDDs. DCFS 2018: 175-187 - [c31]Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Postselecting probabilistic finite state recognizers and verifiers. NCMA 2018: 65-81 - [i53]Kamil Khadiev, Rishat Ibrahimov, Abuzer Yakaryilmaz:
New Size Hierarchies for Two Way Automata. CoRR abs/1801.10483 (2018) - [i52]Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Probabilistic verification of all languages. CoRR abs/1807.04735 (2018) - [i51]Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Postselecting probabilistic finite state recognizers and verifiers. CoRR abs/1807.05169 (2018) - 2017
- [j23]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Inkdots as advice for finite automata. Discret. Math. Theor. Comput. Sci. 19(3) (2017) - [j22]Aleksandrs Belovs, J. Andres Montoya
On a Conjecture by Christian Choffrut. Int. J. Found. Comput. Sci. 28(5): 483-502 (2017) - [j21]A. C. Cem Say, Abuzer Yakaryilmaz:
Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. 17(11&12): 1027-1043 (2017) - [c30]Aida Gainutdinova, Abuzer Yakaryilmaz
Nondeterministic Unitary OBDDs. CSR 2017: 126-140 - [c29]Maksims Dimitrijevs, Abuzer Yakaryilmaz
Uncountable Realtime Probabilistic Classes. DCFS 2017: 102-113 - [c28]Mika Hirvensalo, Etienne Moutot
On the Computational Power of Affine Automata. LATA 2017: 405-417 - [c27]Masaki Nakanishi, Abuzer Yakaryilmaz
Affine counter automata. AFL 2017: 205-218 - [i50]Rishat Ibrahimov, Kamil Khadiev, Abuzer Yakaryilmaz:
Exact Affine OBDDs. CoRR abs/1703.07184 (2017) - [i49]Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable realtime probabilistic classes. CoRR abs/1705.01773 (2017) - 2016
- [j20]Mika Hirvensalo, Abuzer Yakaryilmaz:
Decision Problems on Unary Probabilistic and Quantum Automata. Balt. J. Mod. Comput. 4(4) (2016) - [j19]Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz
New Results on the Minimum Amount of Useful Space. Int. J. Found. Comput. Sci. 27(2): 259-282 (2016) - [j18]Abuzer Yakaryilmaz
Debates with Small Transparent Quantum Verifiers. Int. J. Found. Comput. Sci. 27(2): 283- (2016) - [j17]Arseny M. Shur, Abuzer Yakaryilmaz
More on quantum, stochastic, and pseudo stochastic languages with few states. Nat. Comput. 15(1): 129-141 (2016) - [c26]Alejandro Díaz-Caro
Affine Computation and Affine Automaton. CSR 2016: 146-160 - [c25]Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Two-way frequency finite automata. NCMA 2016: 75-88 - [c24]Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable classical and quantum complexity classes. NCMA 2016: 131-146 - [c23]Marcos Villagra
Language Recognition Power and Succinctness of Affine Automata. UCNC 2016: 116-129 - [c22]Aleksandrs Belovs, J. Andres Montoya
Looking for Pairs that Hard to Separate: A Quantum Approach. CIAA 2016: 213-223 - [i48]Alejandro Díaz-Caro, Abuzer Yakaryilmaz:
Affine computation and affine automaton. CoRR abs/1602.04732 (2016) - [i47]Marcos Villagra, Abuzer Yakaryilmaz:
Language recognition power and succintness of affine automata. CoRR abs/1602.05432 (2016) - [i46]Aleksandrs Belovs, Juan Andrés Montoya, Abuzer Yakaryilmaz:
Can one quantum bit separate any pair of words with zero-error? CoRR abs/1602.07967 (2016) - [i45]Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable classical and quantum complexity classes. CoRR abs/1608.00417 (2016) - [i44]Mika Hirvensalo, Abuzer Yakaryilmaz:
Decision problems on unary probabilistic and quantum automata. CoRR abs/1610.01397 (2016) - [i43]Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
On the computational power of affine automata. CoRR abs/1612.01870 (2016) - [i42]Aida Gainutdinova, Abuzer Yakaryilmaz:
Nondeterministic unitary OBDDs. CoRR abs/1612.07015 (2016) - 2015
- [j16]Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. Discret. Math. Theor. Comput. Sci. 17(2): 157-180 (2015) - [j15]H. Gökalp Demirci, A. C. Cem Say
The Complexity of Debate Checking. Theory Comput. Syst. 57(1): 36-80 (2015) - [c21]Abuzer Yakaryilmaz
On discerning strings with finite automata. CLEI 2015: 1-5 - [c20]Aida Gainutdinova
Unary Probabilistic and Quantum Automata on Promise Problems. DLT 2015: 252-263 - [c19]Masaki Nakanishi, Abuzer Yakaryilmaz
Classical and Quantum Counter Automata on Promise Problems. CIAA 2015: 224-237 - [i41]Aida Gainutdinova, Abuzer Yakaryilmaz:
Unary probabilistic and quantum automata on promise problems. CoRR abs/1502.01462 (2015) - [i40]Andris Ambainis, Abuzer Yakaryilmaz:
Automata and Quantum Computing. CoRR abs/1507.01988 (2015) - [i39]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Inkdots as advice to small-space machines. CoRR abs/1509.03712 (2015) - 2014
- [j14]A. C. Cem Say
Finite state verifiers with constant randomness. Log. Methods Comput. Sci. 10(3) (2014) - [j13]Ugur Küçük, A. C. Cem Say
Finite Automata with Advice Tapes. Int. J. Found. Comput. Sci. 25(8): 987-1000 (2014) - [c18]A. C. Cem Say
Quantum Finite Automata: A Modern Introduction. Computing with New Resources 2014: 208-222 - [c17]Farid M. Ablayev
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. DCFS 2014: 53-64 - [c16]Viliam Geffert, Abuzer Yakaryilmaz
Classical Automata on Promise Problems. DCFS 2014: 126-137 - [c15]Klaus Reinhardt, Abuzer Yakaryilmaz
The Minimum Amount of Useful Space: New Results and New Directions. Developments in Language Theory 2014: 315-326 - [c14]Abuzer Yakaryilmaz
Debates with Small Transparent Quantum Verifiers. Developments in Language Theory 2014: 327-338 - [c13]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. NCMA 2014: 101-114 - [c12]Arseny M. Shur, Abuzer Yakaryilmaz
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. UCNC 2014: 327-339 - [c11]Marzio De Biasi, Abuzer Yakaryilmaz
Unary Languages Recognized by Two-Way One-Counter Automata. CIAA 2014: 148-161 - [c10]Jibran Rashid, Abuzer Yakaryilmaz
Implications of Quantum Automata for Contextuality. CIAA 2014: 318-331 - [i38]Jibran Rashid, Abuzer Yakaryilmaz:
Implications of quantum automata for contextuality. CoRR abs/1404.2761 (2014) - [i37]Arseny M. Shur, Abuzer Yakaryilmaz:
Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. CoRR abs/1405.0055 (2014) - [i36]Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci:
Debates with small transparent quantum verifiers. CoRR abs/1405.1655 (2014) - [i35]Klaus Reinhardt, Abuzer Yakaryilmaz:
The minimum amount of useful space: New results and new directions. CoRR abs/1405.2892 (2014) - [i34]Viliam Geffert, Abuzer Yakaryilmaz:
Classical automata on promise problems. CoRR abs/1405.6671 (2014) - [i33]Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz:
Very narrow quantum OBDDs and width hierarchies for classical OBDDs. CoRR abs/1405.7849 (2014) - [i32]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum finite automata: A modern introduction. CoRR abs/1406.4048 (2014) - [i31]H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. CoRR abs/1407.0334 (2014) - [i30]A. C. Cem Say, Abuzer Yakaryilmaz:
Magic coins are useful for small-space quantum machines. CoRR abs/1411.7647 (2014) - [i29]Masaki Nakanishi, Abuzer Yakaryilmaz:
Classical and quantum counter automata on promise problems. CoRR abs/1412.6761 (2014) - [i28]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
The Complexity of Debate Checking. Electron. Colloquium Comput. Complex. TR14 (2014) - [i27]Viliam Geffert, Abuzer Yakaryilmaz:
Classical Automata on Promise Problems. Electron. Colloquium Comput. Complex. TR14 (2014) - [i26]A. C. Cem Say, Abuzer Yakaryilmaz:
Magic coins are useful for small-space quantum machines. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j12]Abuzer Yakaryilmaz
Proving the Power of Postselection. Fundam. Informaticae 123(1): 107-134 (2013) - [j11]Abuzer Yakaryilmaz
Tight Bounds for the Space Complexity of Nonregular Language Recognition by Real-Time Machines. Int. J. Found. Comput. Sci. 24(8): 1243-1254 (2013) - [c9]Abuzer Yakaryilmaz:
Quantum Alternation. CSR 2013: 334-346 - [c8]Abuzer Yakaryilmaz:
One-Counter Verifiers for Decidable Languages. CSR 2013: 366-377 - [c7]Ugur Küçük, A. C. Cem Say
Finite Automata with Advice Tapes. Developments in Language Theory 2013: 301-312 - [c6]Özlem Salehi
Real-Time Vector Automata. FCT 2013: 293-304 - [i25]Özlem Salehi, Abuzer Yakaryilmaz, A. C. Cem Say:
Real-Time Vector Automata. CoRR abs/1303.6129 (2013) - [i24]Abuzer Yakaryilmaz:
Log-space counter is useful for unary languages by help of a constant-size quantum register. CoRR abs/1309.4767 (2013) - [i23]Marzio De Biasi, Abuzer Yakaryilmaz:
Non-trivial unary languages recognized by two-way one-counter machines. CoRR abs/1311.0849 (2013) - [i22]Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Finite automata with advice tapes. CoRR abs/1312.2268 (2013) - [i21]A. C. Cem Say, Abuzer Yakaryilmaz:
Finite state verifiers with constant randomness. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j10]A. C. Cem Say
Quantum Counter Automata. Int. J. Found. Comput. Sci. 23(5): 1099-1116 (2012) - [j9]Andris Ambainis, Abuzer Yakaryilmaz
Superiority of exact quantum automata for promise problems. Inf. Process. Lett. 112(7): 289-291 (2012) - [j8]Abuzer Yakaryilmaz
Superiority of one-way and realtime quantum machines. RAIRO Theor. Informatics Appl. 46(4): 615-641 (2012) - [j7]Abuzer Yakaryilmaz
Quantum computation with write-only memory. Nat. Comput. 11(1): 81-94 (2012) - [j6]A. C. Cem Say
Computation with multiple CTCs of fixed length and width. Nat. Comput. 11(4): 579-594 (2012) - [c5]A. C. Cem Say
Finite State Verifiers with Constant Randomness. CiE 2012: 646-654 - [i20]Abuzer Yakaryilmaz:
Turing-equivalent automata using a fixed-size quantum memory. CoRR abs/1205.5395 (2012) - [i19]Abuzer Yakaryilmaz:
One-counter verifiers for decidable languages. CoRR abs/1207.3880 (2012) - [i18]H. Gökalp Demirci, A. C. Cem Say, Abuzer Yakaryilmaz:
Probabilistic verifiers for asymmetric debates. CoRR abs/1209.5192 (2012) - [i17]Abuzer Yakaryilmaz:
One-counter verifiers for decidable languages. Electron. Colloquium Comput. Complex. TR12 (2012) - [i16]Abuzer Yakaryilmaz:
Public-qubits versus private-coins. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [b1]Abuzer Yakaryilmaz:
Classical and quantum computation with small space bounds (Az belleğe sahip klasik ve kuantum hesaplama). Boğaziçi University, Turkey, 2011 - [j5]Abuzer Yakaryilmaz
Unbounded-error quantum computation with small space bounds. Inf. Comput. 209(6): 873-892 (2011) - [c4]Abuzer Yakaryilmaz:
Superiority of One-Way and Realtime Quantum Machines and New Directions. NCMA 2011: 209-224 - [c3]A. C. Cem Say
Computation with Narrow CTCs. UC 2011: 201-211 - [i15]Abuzer Yakaryilmaz:
Exact quantum algorithms for promise problems in automata theory. CoRR abs/1101.3837 (2011) - [i14]Abuzer Yakaryilmaz, A. C. Cem Say:
NP has log-space verifiers with fixed-size public quantum registers. CoRR abs/1101.5227 (2011) - [i13]Abuzer Yakaryilmaz:
Classical and quantum computation with small space bounds (PhD thesis). CoRR abs/1102.0378 (2011) - [i12]Abuzer Yakaryilmaz, A. C. Cem Say:
Probabilistic and quantum finite automata with postselection. CoRR abs/1102.0666 (2011) - [i11]A. C. Cem Say, Abuzer Yakaryilmaz:
Computation with narrow CTCs. CoRR abs/1102.1199 (2011) - [i10]Abuzer Yakaryilmaz:
Superiority of one-way and realtime quantum machines and new directions (extended abstract). CoRR abs/1102.3093 (2011) - [i9]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum counter automata. CoRR abs/1105.0165 (2011) - [i8]Abuzer Yakaryilmaz, A. C. Cem Say:
Tight bounds for the space complexity of nonregular language recognition by real-time machines. CoRR abs/1108.2613 (2011) - [i7]Abuzer Yakaryilmaz, A. C. Cem Say:
Proving the power of postselection. CoRR abs/1111.3125 (2011) - 2010
- [j4]Abuzer Yakaryilmaz, A. C. Cem Say:
Succinctness of two-way probabilistic and quantum finite automata. Discret. Math. Theor. Comput. Sci. 12(4): 19-40 (2010) - [j3]Rusins Freivalds, Abuzer Yakaryilmaz
A new family of nonstochastic languages. Inf. Process. Lett. 110(10): 410-413 (2010) - [j2]Abuzer Yakaryilmaz, A. C. Cem Say:
Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. 10(9&10): 747-770 (2010) - [c2]Abuzer Yakaryilmaz
Quantum Computation with Devices Whose Contents Are Never Read. UC 2010: 164-174 - [i6]Abuzer Yakaryilmaz, A. C. Cem Say:
Unbounded-error quantum computation with small space bounds. CoRR abs/1007.3624 (2010) - [i5]A. C. Cem Say, Abuzer Yakaryilmaz:
Quantum function computation using sublogarithmic space (abstract & poster). CoRR abs/1009.3124 (2010) - [i4]Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say, Ruben Agadzanyan:
Quantum computation with devices whose contents are never read. CoRR abs/1011.1201 (2010)
2000 – 2009
- 2009
- [j1]Abuzer Yakaryilmaz
Efficient probability amplification in two-way quantum finite automata. Theor. Comput. Sci. 410(20): 1932-1941 (2009) - [c1]Abuzer Yakaryilmaz
Languages Recognized with Unbounded Error by Quantum Finite Automata. CSR 2009: 356-367 - [i3]Abuzer Yakaryilmaz, A. C. Cem Say:
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error. CoRR abs/0901.2703 (2009) - [i2]Abuzer Yakaryilmaz, A. C. Cem Say:
Quantum Finite Automata with One-Sided Unbounded Error. CoRR abs/0902.2081 (2009) - [i1]Abuzer Yakaryilmaz, A. C. Cem Say:
Succinctness of two-way probabilistic and quantum finite automata. CoRR abs/0903.0050 (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-07-25 19:27 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: