default search action
Karel Culík II
Karel Čulík II
Person information
- unicode name: Karel Čulík II
- affiliation: University of South Carolina, Columbia, SC, USA
- affiliation (former): Wayne State University, Detroit, MI, USA
- affiliation (former): Pennsylvania State University, University Park, PA, USA
- affiliation (former): Academy of Sciences of the Czech Republic, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2004
- [c42]Karel Culík II, Juhani Karhumäki, Petri Salmela:
Fixed Point Approach to Commutation of Languages. Aspects of Molecular Computing 2004: 119-131 - 2002
- [j97]Karel Culík II, Juhani Karhumäki, Jarkko Kari
:
A Note on Synchronized Automata and Road Coloring Problem. Int. J. Found. Comput. Sci. 13(3): 459-471 (2002) - 2001
- [c41]Karel Culík II, Juhani Karhumäki, Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem. Developments in Language Theory 2001: 175-185
1990 – 1999
- 1999
- [j96]Karel Culík II, P. C. von Rosenberg:
Generalized Weighted Finite Automata Based Image Compression. J. Univers. Comput. Sci. 5(4): 227-242 (1999) - [c40]Karel Culík II:
Small Aperiodic Sets of Triangular and Hexagonal Tiles. Jewels are Forever 1999: 307-313 - [c39]Cezar Câmpeanu
State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70 - 1997
- [j95]Karel Culík II, Jarkko Kari:
Computational Fractal Geometry with WFA. Acta Informatica 34(2): 151-166 (1997) - [j94]Karel Culík II, Simant Dube:
Implementing Daubechies Wavelet Transform with Weighted Finite Automata. Acta Informatica 34(5): 347-366 (1997) - [j93]Karel Culík II, Vladimir Valenta:
Finite automata based compression of bi-level and simple color images. Comput. Graph. 21(1): 61-68 (1997) - [j92]Karel Culík II, Vladimir Valenta:
Generalized Finite Automata and Transducers. J. Autom. Lang. Comb. 2(1): 3-17 (1997) - [j91]Karel Culík II, Vladimir Valenta, Jarkko Kari:
Compression of Silhouette-like Images based on WFA. J. Univers. Comput. Sci. 3(10): 1100-1113 (1997) - [c38]Karel Culík II, Jarkko Kari:
On Aperiodic Sets of Wang Tiles. Foundations of Computer Science: Potential - Theory - Cognition 1997: 153-162 - [p2]Karel Culík II, Jarkko Kari:
Digital Images and Formal Languages. Handbook of Formal Languages (3) 1997: 599-616 - 1996
- [j90]Karel Culík II, Jarkko Kari
Finite state transformation of images. Comput. Graph. 20(1): 125-135 (1996) - [j89]Karel Culík II:
An aperiodic set of 13 Wang tiles. Discret. Math. 160(1-3): 245-251 (1996) - [c37]Karel Culík II, Vladimir Valenta:
Finite Automata Based Compression of Bi-level Images. Data Compression Conference 1996: 280-289 - [c36]Karel Culík II, Jarkko Kari:
An Aperiodic Set of Wang Cubes. STACS 1996: 137-146 - 1995
- [j88]Karel Culík II, Peter Rajcáni:
Iterative Weighted Finite Transductions. Acta Informatica 32(7): 681-703 (1995) - [j87]Karel Culík II:
Global Cellular Automata. Complex Syst. 9(4) (1995) - [j86]Karel Culík II, Ivan Fris:
Weighted Finite Transducers in Image Processing. Discret. Appl. Math. 58(3): 223-237 (1995) - [j85]Karel Culík II, Jarkko Kari:
An Aperiodic Set of Wang Cubes. J. Univers. Comput. Sci. 1(10): 675-686 (1995) - [c35]Karel Culík II, Jarkko Kari:
Finite State Methods for Compression and Manipulation of Images. Data Compression Conference 1995: 142-151 - [c34]Karel Culík II, Jarkko Kari
Finite State Transformations of Images. ICALP 1995: 51-62 - 1994
- [j84]Karel Culík II, Jarkko Kari
On the Power of L-Systems in Image Generation. Acta Informatica 31(8): 761-773 (1994) - [j83]Karel Culík II, Juhani Karhumäki:
Iterative Devices Generating Infinite Words. Int. J. Found. Comput. Sci. 5(1): 69-97 (1994) - [j82]Karel Culík II, Jarkko Kari
Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference. Inf. Process. Manag. 30(6): 829-838 (1994) - [j81]Karel Culík II, Juhani Karhumäki:
Finite Automata Computing Real Functions. SIAM J. Comput. 23(4): 789-814 (1994) - [c33]Karel Culík II, Jarkko Kari:
Parallel Pattern Generation with One-Way Communications. Results and Trends in Theoretical Computer Science 1994: 85-96 - 1993
- [j80]Karel Culík II, Simant Dube:
L-Systems and Mutually Recursive Function Systems. Acta Informatica 30(3): 279-302 (1993) - [j79]Karel Culík II, Jarkko Kari
Image compression using weighted finite automata. Comput. Graph. 17(3): 305-313 (1993) - [j78]Karel Culík II, Simant Dube:
Balancing order and chaos in image generation. Comput. Graph. 17(4): 465-486 (1993) - [j77]Karel Culík II, Jarkko Kari:
Mechanisms for Pattern Generation. Complex Syst. 7(5) (1993) - [j76]Karel Culík II, Simant Dube:
Rational and Affine Expressions for Image Description. Discret. Appl. Math. 41(2): 85-120 (1993) - [j75]Karel Culík II, Simant Dube:
Encoding Images as Words and Languages. Int. J. Algebra Comput. 3(2): 211-236 (1993) - [j74]Karel Culík II, Jarkko Kari
Parametrized Recurrent Systems for Image Generation. Inf. Process. Lett. 48(6): 267-274 (1993) - [j73]Karel Culík II, Simant Dube:
Affine automata and related techniques for generation of complex images. Theor. Comput. Sci. 116(2): 373-398 (1993) - [c32]Karel Culík II, Simant Dube, Peter Rajcáni:
Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data. Data Compression Conference 1993: 234-243 - [c31]Karel Culík II, Jarkko Kari:
On the Power of L-Systems in Image Generation. Developments in Language Theory 1993: 225-236 - [c30]Karel Culík II, Jarkko Kari:
Image Compression Using Weighted Finite Automata. MFCS 1993: 392-402 - [c29]Karel Culík II, Simant Dube:
Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data. STACS 1993: 343-353 - 1992
- [c28]Karel Culík II, Juhani Karhumäki:
Iterative Devices Generating Infinite Words. STACS 1992: 531-543 - 1991
- [j72]Karel Culík II, Tero Harju
Splicing semigroups of dominoes and DNA. Discret. Appl. Math. 31(3): 261-277 (1991) - [j71]Karel Culík II, Sheng Yu:
Cellular automata, omegaomega-regular sets, and sofic systems. Discret. Appl. Math. 32(2): 85-101 (1991) - [j70]Karel Culík II, Simant Dube:
An Efficient Solution of the Firing Mob Problem. Theor. Comput. Sci. 91(1): 57-69 (1991) - [c27]Karel Culík II, Simant Dube:
New Methods for Image Generation and Compression. New Results and New Trends in Computer Science 1991: 69-90 - [c26]Karel Culík II, Simant Dube:
Balancing Order and Chaos in Image Generation (Extended Abstract). ICALP 1991: 600-614 - 1990
- [j69]Karel Culík II, Juhani Karhumäki:
Loops in automata and HDTOL relations. RAIRO Theor. Informatics Appl. 24: 327-337 (1990) - [j68]Karel Culík II:
New Techniques for Proving the Decidability of Equivalence Problems. Theor. Comput. Sci. 71(1): 29-45 (1990) - [c25]Karel Culík II, Simant Dube:
Automata-Theoretic Techniques for Image Generation and Compression. FSTTCS 1990: 76-90 - [c24]Karel Culík II, Simant Dube:
Methods for Generating Deterministic Fractals and Image Compression. IMYCS 1990: 2-28 - [c23]Karel Culík II, Simant Dube:
Affine Automata: A Technique to Generate Complex Images. MFCS 1990: 224-231
1980 – 1989
- 1989
- [j67]Karel Culík II, Juhani Karhumäki:
HDTOL Matching of Computations of Multitape Automata. Acta Informatica 27(2): 179-191 (1989) - [j66]Karel Culík II, Simant Dube:
Fractal and Recurrent Behavior of Cellular Automata. Complex Syst. 3(3) (1989) - [j65]Karel Culík II:
Variations of the Firing Squad Problem and Applications. Inf. Process. Lett. 30(3): 153-157 (1989) - [j64]Karel Culík II, Jan K. Pachl
On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989) - [c22]Karel Culík II, Tero Harju
Dominoes and the Regularity of DNS Splicing Languages. ICALP 1989: 222-233 - [c21]Karel Culík II, Juhani Karhumäki:
On the Equivalence Problem for Deterministic Multitape Automata and Transducers. STACS 1989: 468-479 - [p1]Karel Culík II, Juhani Karhumäki:
A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers. A Perspective in Theoretical Computer Science 1989: 23-32 - 1988
- [j63]Karel Culík II, Sheng Yu:
Undecidability of CA Classification Schemes. Complex Syst. 2(2) (1988) - [j62]Karel Culík II, Juhani Karhumäki:
On Totalistic Systolic Networks. Inf. Process. Lett. 26(5): 231-236 (1988) - [c20]Karel Culík II:
New Techniques for Proving the Decidability of Equivalence Problems. ICALP 1988: 162-175 - 1987
- [j61]Jürgen Albert, Karel Culík II:
A Simple Universal Cellular Automaton and its One-Way and Totalistic Version. Complex Syst. 1(1) (1987) - [j60]Karel Culík II:
On Invertible Cellular Automata. Complex Syst. 1(6) (1987) - [j59]Karel Culík II, Juhani Karhumäki:
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable. SIAM J. Comput. 16(2): 221-230 (1987) - [c19]Karel Culík II, Matti Linna:
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. FSTTCS 1987: 15-25 - 1986
- [j58]Karel Culík II, Juhani Karhumäki:
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence. Acta Informatica 23(5): 597-605 (1986) - [j57]Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Trellis Automata: Stability, Decidability and Complexity. Inf. Control. 71(3): 218-230 (1986) - [j56]Karel Culík II, Juhani Karhumäki:
A Note on the Equivalence Problem of Rational Formal Power Series. Inf. Process. Lett. 23(1): 29-31 (1986) - [j55]Karel Culík II, Sheng Yu:
Real-Time, Pseudo Real-Time, and Linear-Time ITA. Theor. Comput. Sci. 47(3): 15-26 (1986) - [j54]Karel Culík II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. Theor. Comput. Sci. 47(3): 71-84 (1986) - [c18]Karel Culík II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. MFCS 1986: 264-272 - 1985
- [j53]Karel Culík II, Juhani Karhumäki:
Decision problems solved with the help of the Ehrenfeucht conjecture. Bull. EATCS 27: 30-34 (1985) - [j52]Karel Culík II, Ivan Fris:
Topological Transformations as a Tool in the Design of Systolic Networks. Theor. Comput. Sci. 37: 183-216 (1985) - [c17]Karel Culík II, Sheng Yu:
Translation of Systolic Algorithms between Systems of Different Topology. ICPP 1985: 756-763 - 1984
- [j51]Christian Choffrut, Karel Culík II:
On Real-Time Cellular Automata and Trellis Automata. Acta Informatica 21: 393-407 (1984) - [j50]Christian Choffrut, Karel Culík II:
On extendibility of unavoidable sets. Discret. Appl. Math. 9(2): 125-137 (1984) - [j49]Karel Culík II, Arto Salomaa, Derick Wood:
Systolic Tree Acceptors. RAIRO Theor. Informatics Appl. 18(1): 53-69 (1984) - [j48]Walter Bucher, Karel Culík II:
On Real Time and Linear Time Cellular Automata. RAIRO Theor. Informatics Appl. 18(4): 307-325 (1984) - [j47]Karel Culík II, Tero Harju
The omega-Sequence Problem for DOL Systems Is Decidable. J. ACM 31(2): 282-298 (1984) - [j46]Walter Bucher, Hermann A. Maurer, Karel Culík II:
Context-Free Complexity of Finite Languages. Theor. Comput. Sci. 28: 277-285 (1984) - [j45]Karel Culík II, Sheng Yu:
Iterative Tree Automata. Theor. Comput. Sci. 32: 227-247 (1984) - [c16]Christian Choffrut, Karel Culík II:
On Extendibility of Unavoidable Sets. STACS 1984: 326-338 - 1983
- [j44]Karel Culík II, Juhani Karhumäki:
Systems of equations over a free monoid and Ehrenfeucht's conjecture. Discret. Math. 43(2-3): 139-153 (1983) - [j43]Karel Culík II, Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems. Inf. Control. 56(3): 139-153 (1983) - [j42]Christian Choffrut, Karel Culík II:
Folding of the Plane and the Design of Systolic Arrays. Inf. Process. Lett. 17(3): 149-153 (1983) - [j41]Karel Culík II, Juhani Karhumäki:
On the Ehrenfeucht Conjecture for DOL Languages. RAIRO Theor. Informatics Appl. 17(3): 205-230 (1983) - [j40]Christian Choffrut, Karel Culík II:
Properties of Finite and Pushdown Transducers. SIAM J. Comput. 12(2): 300-315 (1983) - [j39]Karel Culík II, Jozef Gruska, Arto Salomaa:
On a Family of L Languages Resulting from Systolic Tree Automata. Theor. Comput. Sci. 23: 231-242 (1983) - [c15]Karel Culík II, Emo Welzl:
Two Way Finite State Generators. FCT 1983: 106-114 - [c14]Karel Culík II, Arto Salomaa:
Ambiguity and Decision Problems Concerning Number Systems. ICALP 1983: 137-146 - [c13]Karel Culík II, Mateen M. Rizki:
Logic versus mathematics in computer science education. SIGCSE 1983: 14-20 - 1982
- [j38]Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Automata for VLSI on Balanced Trees. Acta Informatica 18: 335-344 (1982) - [j37]Karel Culík II, Faith E. Fich, Arto Salomaa:
A homomorphic characterization of regular languages. Discret. Appl. Math. 4(2): 149-152 (1982) - [j36]Jürgen Albert, Karel Culík II, Juhani Karhumäki:
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid. Inf. Control. 52(2): 172-186 (1982) - [j35]Karel Culík II, Derick Wood:
A Note on Some Tree Similarity Measures. Inf. Process. Lett. 15(1): 39-42 (1982) - [j34]Jürgen Albert, Karel Culík II:
Tree Correspondence Problems. J. Comput. Syst. Sci. 24(2): 167-179 (1982) - [j33]Karel Culík II, Tero Harju
Dominoes Over a Free Monoid. Theor. Comput. Sci. 18: 279-300 (1982) - [j32]Karel Culík II, Arto Salomaa:
On Infinite Words Obtained by Iterating Morphisms. Theor. Comput. Sci. 19: 29-38 (1982) - [c12]Karel Culík II:
On Test Sets and the Ehrenfeucht Conjecture. ICALP 1982: 128-140 - [c11]Karel Culík II, Jan K. Pachl
Folding and Unrolling Systolic Arrays (Preliminary Version). PODC 1982: 254-261 - 1981
- [j31]Karel Culík II, Jan K. Pachl
Equivalence Problems for Mappings on Infinite Strings. Inf. Control. 49(1): 52-63 (1981) - [j30]Karel Culík II, Derick Wood:
A Note on Recurrent Words. Inf. Control. 51(1): 88-93 (1981) - [j29]Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke:
Concise Description of Finite Languages. Theor. Comput. Sci. 14: 227-246 (1981) - [j28]Karel Culík II, Thomas Ottmann, Derick Wood:
Dense Multiway Trees. ACM Trans. Database Syst. 6(3): 486-512 (1981) - [c10]Karel Culík II, Tero Harju
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable. STOC 1981: 1-6 - 1980
- [j27]Jürgen Albert, Karel Culík II:
Test Sets for Homomorphism Equivalence on Context Free Languages. Inf. Control. 45(3): 273-284 (1980) - [j26]Karel Culík II, Juhani Karhumäki:
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators. RAIRO Theor. Informatics Appl. 14(4): 349-369 (1980) - [j25]Karel Culík II, Arto Salomaa:
Test Sets and Checking Words for Homomorphism Equivalence. J. Comput. Syst. Sci. 20(3): 379-395 (1980) - [c9]Jürgen Albert, Karel Culík II:
Test Sets for Homomorphism Equivalence on Context Free Languages. ICALP 1980: 12-18
1970 – 1979
- 1979
- [j24]Karel Culík II, Derick Wood:
A Mathematical Investigation of Propagating Graph 0L Systems. Inf. Control. 43(1): 50-82 (1979) - [j23]Karel Culík II, Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour. Inf. Control. 43(1): 83-100 (1979) - [j22]Karel Culík II, Derek Wood:
Doubly deterministic tabled OL systems. Int. J. Parallel Program. 8(4): 335-347 (1979) - [j21]Karel Culík II:
Some Decidability Results About Regular and Pushdown Translations. Inf. Process. Lett. 8(1): 5-8 (1979) - [j20]Karel Culík II, Hermann A. Maurer:
Secure Information Storage and Retrieval Using New Results in Cryptography. Inf. Process. Lett. 8(4): 181-186 (1979) - [j19]Karel Culík II, Hermann A. Maurer:
On simple representations of language families. RAIRO Theor. Informatics Appl. 13(3): 241-250 (1979) - [j18]Karel Culík II:
A Purely Homomorphic Characterization of Recursively Enumerable Sets. J. ACM 26(2): 345-350 (1979) - [c8]Karel Culík II:
On the Homomorphic Characterizations of Families of Languages. ICALP 1979: 161-170 - [c7]Karel Culík II, Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour. MFCS 1979: 246-257 - 1978
- [j17]Karel Culík II:
The Ultimate Equivalence Problem for DOL Systems. Acta Informatica 10: 79-84 (1978) - [j16]Karel Culík II, Hermann A. Maurer:
Propagating Chain-Free Normal Forms for EOL Systems. Inf. Control. 36(3): 309-319 (1978) - [j15]Karel Culík II:
The Decidability of v-Local Catenativity and of Other Properties of D0L Systems. Inf. Process. Lett. 7(1): 33-35 (1978) - [j14]Karel Culík II, Derick Wood:
Speed-varying OL systems. Inf. Sci. 14(2): 161-170 (1978) - [j13]Karel Culík II, Arto Salomaa:
On the Decidability of Homomorphism Equivalence for Languages. J. Comput. Syst. Sci. 17(2): 163-175 (1978) - [j12]Karel Culík II, Hermann A. Maurer, Thomas Ottmann:
On Two-Symbol Complete E0L Forms. Theor. Comput. Sci. 6: 69-92 (1978) - [j11]Karel Culík II, Hermann A. Maurer, Thomas Ottmann, Keijo Ruohonen, Arto Salomaa:
Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms. Theor. Comput. Sci. 6: 143-173 (1978) - 1977
- [j10]Karel Culík II, Hermann A. Maurer:
Tree controlled grammars. Computing 19(2): 129-139 (1977) - [j9]Karel Culík II, Ivan Fris:
The Decidability of the Equivalence Problem for DOL-Systems. Inf. Control. 35(1): 20-39 (1977) - [c6]Karel Culík II, Ivan Fris:
The Sequence Equivalence Problem for D0L Systems is Decidable. ICALP 1977: 148-163 - 1976
- [j8]Karel Culík II:
On the Decidability of the Sequence Equivalence Problem for D0L-Systems. Theor. Comput. Sci. 3(1): 75-84 (1976) - 1975
- [c5]Jaroslav Opatrny, Karel Culík II:
Time Complexity of Recognition and Parsing of E0L-Languages. Automata, Languages, Development 1975: 243-250 - 1974
- [c4]Karel Culík II:
Structured 0L-Systems. L Systems 1974: 216-229 - [c3]Karel Culík II, Jaroslav Opatrny:
Context in Parallel Rewriting. L Systems 1974: 230-243 - [c2]Karel Culík II, T. S. E. Maibaum:
Parallel Rewriting Systems on terms. ICALP 1974: 495-510 - 1973
- [j7]Karel Culík II, Rina S. Cohen:
LR-Regular Grammars - an Extension of LR(k) Grammars. J. Comput. Syst. Sci. 7(1): 66-96 (1973) - 1971
- [j6]Janusz A. Brzozowski, Karel Culík II, Armen Gabrielian:
Classification of Noncounting Events. J. Comput. Syst. Sci. 5(1): 41-53 (1971) - [j5]Karel Culík II:
Abstract Families of Relations. J. Comput. Syst. Sci. 5(6): 596-606 (1971) - [c1]Rina S. Cohen, Karel Culík II:
LR-Regular Grammars-An Extension of LR(k) Grammars. SWAT 1971: 153-165 - 1970
- [j4]Karel Culík II:
n-ary grammars and the description of mapping of languages. Kybernetika 6(2): 99-117 (1970)
1960 – 1969
- 1968
- [j3]Karel Culík II:
Contribution to deterministic top-down analysis of context-free languages. Kybernetika 4(5): 422-431 (1968) - 1967
- [j2]Karel Culík II:
Relations defined by n-tape automata. Kybernetika 3(4): 321-345 (1967) - [j1]Karel Culík II:
Sequential machines with several input and output tapes. Kybernetika 3(6): 540-559 (1967)
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 22:58 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: