default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaciej Liskiewicz
Maciej Liśkiewicz
Person information
- unicode name: Maciej Liśkiewicz
- affiliation: University of Lübeck, Germany
SPARQL queries 
🛈 Please note that only 68% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Marcel Wienöbst, Benito van der Zander, Maciej Liskiewicz:
Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs. AAAI 2024: 20577-20584- [c58]Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander:
The Existential Theory of the Reals with Summation Operators. ISAAC 2024: 13:1-13:19 - [i35]Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander:
The Existential Theory of the Reals with Summation Operators. CoRR abs/2405.04697 (2024) - [i34]Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz:
Probabilistic and Causal Satisfiability: the Impact of Marginalization. CoRR abs/2405.07373 (2024) - [i33]Julian Dörfler, Benito van der Zander, Markus Bläser, Maciej Liskiewicz:
On the Complexity of Identification in Linear Structural Causal Models. CoRR abs/2407.12528 (2024) - 2023
- [j30]Benito van der Zander, Maciej Liskiewicz, Johannes Textor:
Corrigendum to "Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework" [Artif. Intell. 270 (2019) 1-40]. Artif. Intell. 321: 103938 (2023) - [j29]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. J. Mach. Learn. Res. 24: 213:1-213:45 (2023) - [c57]Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz:
Efficient Enumeration of Markov Equivalent DAGs. AAAI 2023: 12313-12320 - [c56]Malte Luttermann, Marcel Wienöbst, Maciej Liskiewicz:
Practical Algorithms for Orientations of Partially Directed Graphical Models. CLeaR 2023: 259-280 - [c55]Thore Tiemann
, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz:
"Act natural!": Exchanging Private Messages on Public Blockchains. EuroS&P 2023: 292-308 - [c54]Benito van der Zander, Markus Bläser, Maciej Liskiewicz:
The Hardness of Reasoning about Probabilities and Causality. IJCAI 2023: 5730-5738 - [i32]Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz:
Efficient Enumeration of Markov Equivalent DAGs. CoRR abs/2301.12212 (2023) - [i31]Malte Luttermann, Marcel Wienöbst, Maciej Liskiewicz:
Practical Algorithms for Orientations of Partially Directed Graphical Models. CoRR abs/2302.14386 (2023) - [i30]Benito van der Zander, Markus Bläser, Maciej Liskiewicz:
The Hardness of Reasoning about Probabilities and Causality. CoRR abs/2305.09508 (2023) - 2022
- [j28]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning residual alternating automata. Inf. Comput. 289(Part): 104981 (2022) - [c53]Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz:
Identification in Tree-shaped Linear Structural Causal Models. AISTATS 2022: 6770-6792 - [c52]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
A new constructive criterion for Markov equivalence of MAGs. UAI 2022: 2107-2116 - [i29]Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz:
Identification in Tree-shaped Linear Structural Causal Models. CoRR abs/2203.01852 (2022) - [i28]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. CoRR abs/2205.02654 (2022) - [i27]Marcel Wienöbst, Benito van der Zander, Maciej Liskiewicz:
Finding Front-Door Adjustment Sets in Linear Time. CoRR abs/2211.16468 (2022) - 2021
- [j27]Okan Seker, Thomas Eisenbarth, Maciej Liskiewicz:
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2): 61-105 (2021) - [c51]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. AAAI 2021: 12198-12206 - [c50]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Recent Advances in Counting and Sampling Markov Equivalent DAGs. KI 2021: 271-275 - [c49]Marcel Wienöbst, Maciej Liskiewicz:
An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm. KI 2021: 276-288 - [c48]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Extendability of causal graphical models: Algorithms and computational complexity. UAI 2021: 1248-1257 - [i26]Thore Tiemann, Sebastian Berndt, Thomas Eisenbarth, Maciej Liskiewicz:
"Act natural!": Having a Private Chat on a Public Blockchain. IACR Cryptol. ePrint Arch. 2021: 1073 (2021) - 2020
- [j26]Christian Rosenke, Maciej Liskiewicz:
The generic combinatorial algorithm for image matching with classes of projective transformations. Inf. Comput. 275: 104550 (2020) - [j25]Sebastian Berndt, Maciej Liskiewicz:
On the universal steganography of optimal rate. Inf. Comput. 275: 104632 (2020) - [c47]Marcel Wienöbst, Maciej Liskiewicz:
Recovering Causal Structures from Low-Order Conditional Independencies. AAAI 2020: 10302-10309 - [i25]Marcel Wienöbst, Maciej Liskiewicz:
Recovering Causal Structures from Low-Order Conditional Independencies. CoRR abs/2010.02675 (2020) - [i24]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. CoRR abs/2012.09679 (2020) - [i23]Okan Seker, Thomas Eisenbarth, Maciej Liskiewicz:
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks. IACR Cryptol. ePrint Arch. 2020: 443 (2020)
2010 – 2019
- 2019
- [j24]Benito van der Zander, Maciej Liskiewicz, Johannes Textor:
Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework. Artif. Intell. 270: 1-40 (2019) - [j23]Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Proper learning of k-term DNF formulas from satisfying assignments. J. Comput. Syst. Sci. 106: 129-144 (2019) - [c46]Benito van der Zander, Maciej Liskiewicz:
Finding Minimal d-separators in Linear Time and Applications. UAI 2019: 637-647 - 2018
- [c45]Sebastian Berndt, Maciej Liskiewicz:
On the Gold Standard for Security of Universal Steganography. EUROCRYPT (1) 2018: 29-60 - [i22]Sebastian Berndt, Maciej Liskiewicz:
On the Gold Standard for Security of Universal Steganography. CoRR abs/1801.08154 (2018) - [i21]Benito van der Zander, Maciej Liskiewicz, Johannes Textor:
Separators and Adjustment Sets in Causal Graphs: Complete Criteria and an Algorithmic Framework. CoRR abs/1803.00116 (2018) - [i20]Sebastian Berndt, Maciej Liskiewicz:
On the Gold Standard for Security of Universal Steganography. IACR Cryptol. ePrint Arch. 2018: 106 (2018) - 2017
- [j22]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Security levels in steganography - Insecurity does not imply detectability. Theor. Comput. Sci. 692: 25-45 (2017) - [c44]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning Residual Alternating Automata. AAAI 2017: 1749-1755 - [c43]Sebastian Berndt, Maciej Liskiewicz:
Algorithm Substitution Attacks from a Steganographic Perspective. CCS 2017: 1649-1660 - [c42]Martin R. Schuster, Maciej Liskiewicz:
New Abilities and Limitations of Spectral Graph Bisection. ESA 2017: 66:1-66:15 - [i19]Martin R. Schuster, Maciej Liskiewicz:
Abilities and Limitations of Spectral Graph Bisection. CoRR abs/1701.01337 (2017) - [i18]Sebastian Berndt, Maciej Liskiewicz:
Algorithm Substitution Attacks from a Steganographic Perspective. CoRR abs/1708.06199 (2017) - [i17]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. TR17 (2017) - [i16]Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Proper Learning of k-term DNF Formulas from Satisfying Assignments. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c41]Benito van der Zander, Maciej Liskiewicz:
Separators and Adjustment Sets in Markov Equivalent DAGs. AAAI 2016: 3315-3321 - [c40]Benito van der Zander, Maciej Liskiewicz:
On Searching for Generalized Instrumental Variables. AISTATS 2016: 1214-1222 - [c39]Sebastian Berndt, Maciej Liskiewicz:
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. IH&MMSec 2016: 81-92 - [c38]Sebastian Berndt, Maciej Liskiewicz:
Hard Communication Channels for Steganography. ISAAC 2016: 16:1-16:13 - 2015
- [c37]Benito van der Zander, Johannes Textor, Maciej Liskiewicz:
Efficiently Finding Conditional Instruments for Causal Inference. IJCAI 2015: 3243-3249 - [c36]Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk:
Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. ISAAC 2015: 151-162 - [c35]Johannes Textor, Alexander Idelberger, Maciej Liskiewicz:
Learning from Pairwise Marginal Independencies. UAI 2015: 882-891 - [i15]Johannes Textor, Alexander Idelberger, Maciej Liskiewicz:
Learning from Pairwise Marginal Independencies. CoRR abs/1508.00280 (2015) - [i14]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Security Levels in Steganography - Insecurity does not Imply Detectability. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j21]Maciej Liskiewicz, Martin R. Schuster:
A new upper bound for the traveling salesman problem in cubic graphs. J. Discrete Algorithms 27: 1-20 (2014) - [c34]Alexander Idelberger, Maciej Liskiewicz:
On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals. CCCG 2014 - [c33]Johannes Textor, Katharina Dannenberg, Maciej Liskiewicz:
A generic finite automata based approach to implementing lymphocyte repertoire models. GECCO 2014: 129-136 - [c32]Benito van der Zander, Maciej Liskiewicz, Johannes Textor:
Constructing Separators and Adjustment Sets in Ancestral Graphs. CI@UAI 2014: 11-24 - [c31]Benito van der Zander, Maciej Liskiewicz, Johannes Textor:
Constructing Separators and Adjustment Sets in Ancestral Graphs. UAI 2014: 907-916 - 2013
- [j20]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Grey-box steganography. Theor. Comput. Sci. 505: 27-41 (2013) - [i13]Maciej Liskiewicz, Martin R. Schuster:
A new upper bound for the traveling salesman problem in cubic graphs. CTW 2013: 159-162 - 2012
- [i12]Johannes Textor, Maciej Liskiewicz:
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. CoRR abs/1202.3764 (2012) - [i11]Maciej Liskiewicz, Martin R. Schuster:
Improved Analysis of an Exact Algorithm for Cubic Graph TSP. CoRR abs/1207.4694 (2012) - 2011
- [j19]Christian Hundt, Maciej Liskiewicz:
New complexity bounds for image matching under rotation and scaling. J. Discrete Algorithms 9(1): 122-136 (2011) - [j18]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-private Environments. Theory Comput. Syst. 48(1): 211-245 (2011) - [c30]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Grey-Box Steganography. TAMC 2011: 390-402 - [c29]Johannes Textor, Maciej Liskiewicz:
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. UAI 2011: 681-688 - 2010
- [c28]Maciej Liskiewicz, Johannes Textor:
Negative selection algorithms without generating detectors. GECCO 2010: 1047-1054
2000 – 2009
- 2009
- [j17]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
Improving the average delay of sorting. Theor. Comput. Sci. 410(11): 1030-1041 (2009) - [j16]Christian Hundt, Maciej Liskiewicz, Ragnar Nevries:
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. Theor. Comput. Sci. 410(51): 5317-5333 (2009) - [c27]Christian Hundt, Maciej Liskiewicz:
New Complexity Bounds for Image Matching under Rotation and Scaling. CPM 2009: 127-141 - 2008
- [c26]Christian Hundt, Maciej Liskiewicz:
Two-Dimensional Pattern Matching with Combined Scaling and Rotation. CPM 2008: 5-17 - [c25]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Susceptible Two-Party Quantum Computations. ICITS 2008: 121-136 - [c24]Christian Hundt, Maciej Liskiewicz:
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. MFCS 2008: 395-406 - 2007
- [j15]Maciej Liskiewicz, Rüdiger Reischuk:
Preface. Theory Comput. Syst. 41(2): 209-210 (2007) - [c23]Christian Hundt, Maciej Liskiewicz:
On the Complexity of Affine Image Matching. STACS 2007: 284-295 - [c22]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
Improving the Average Delay of Sorting. TAMC 2007: 330-341 - [i10]Christian Hundt, Maciej Liskiewicz:
A Combinatorial Geometric Approach to Linear Image Matching. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j14]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2): 85-114 (2006) - [j13]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. 19(3): 341-357 (2006) - [c21]Maciej Liskiewicz:
Multiparty Computations in Non-private Environments. GTIT-C 2006: 1097-1099 - [c20]Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel:
Provably Secure Steganography and the Complexity of Sampling. ISAAC 2006: 754-763 - [i9]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions 2006 - [i8]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using quantum oblivious transfer to cheat sensitive quantum bit commitment. CoRR abs/quant-ph/0605150 (2006) - [i7]Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j12]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. 39(4): 687-706 (2005) - [c19]Andreas Jakoby, Maciej Liskiewicz:
Revealing Additional Information in Two-Party Computations. ASIACRYPT 2005: 121-135 - [c18]Maciej Liskiewicz, Ulrich Wölfel:
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. Information Hiding 2005: 176-188 - [e1]Maciej Liskiewicz, Rüdiger Reischuk:
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings. Lecture Notes in Computer Science 3623, Springer 2005, ISBN 3-540-28193-2 [contents] - 2004
- [j11]Maciej Liskiewicz, Bodo Manthey:
New lower and upper bounds for the competitive ratio of transmission protocols. Inf. Process. Lett. 89(6): 297-301 (2004) - [j10]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2(4): 471-500 (2004) - [c17]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-private Environments. ASIACRYPT 2004: 137-151 - [c16]Maciej Liskiewicz, Hemant J. Purohit, Dhananjay V. Raje:
Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity. WABI 2004: 362-373 - 2003
- [j9]Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda:
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304(1-3): 129-156 (2003) - [c15]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. FCT 2003: 158-170 - [c14]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Private Computations in Networks: Topology versus Randomness. STACS 2003: 121-132 - [i6]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Private Computation - k-connected versus 1-connected Networks. Electron. Colloquium Comput. Complex. TR03 (2003) - [i5]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-Private Environments. Electron. Colloquium Comput. Complex. TR03 (2003) - [i4]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c13]Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert:
Private Computation - k-Connected versus 1-Connected Networks. CRYPTO 2002: 194-209 - [c12]Andreas Jakoby, Maciej Liskiewicz:
Paths Problems in Symmetric Logarithmic Space. ICALP 2002: 269-280 - [i3]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space Efficient Algorithms for Directed Series-Parallel Graphs. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c11]Andreas Jakoby, Maciej Liskiewicz:
The Complexity of Some Basic Problems for Dynamic Process Graphs. ISAAC 2001: 562-574 - [c10]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space Efficient Algorithms for Series-Parallel Graphs. STACS 2001: 339-352 - [i2]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c9]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs. WG 2000: 230-242
1990 – 1999
- 1999
- [j8]Maciej Liskiewicz, Rüdiger Reischuk:
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Comput. Complex. 8(3): 273-307 (1999) - [c8]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Scheduling Dynamic Graphs. STACS 1999: 383-392 - 1997
- [c7]Maciej Liskiewicz, Rüdiger Reischuk:
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. MFCS 1997: 91-107 - [c6]Maciej Liskiewicz:
Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. STACS 1997: 129-140 - 1996
- [j7]Maciej Liskiewicz, Rüdiger Reischuk:
The Sublogarithmic Alternating Space World. SIAM J. Comput. 25(4): 828-861 (1996) - 1995
- [j6]Maciej Liskiewicz:
On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. Math. Syst. Theory 28(4): 329-339 (1995) - [i1]Maciej Liskiewicz, Rüdiger Reischuk:
The Sublogarithmic Alternating Space World. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c5]Maciej Liskiewicz, Rüdiger Reischuk:
The Complexity World below Logarithmic Space. SCT 1994: 64-78 - 1993
- [j5]Maciej Liskiewicz:
On the Relationship Between Deterministic Time and Deterministic Reversal. Inf. Process. Lett. 45(3): 143-146 (1993) - [c4]Maciej Liskiewicz, Rüdiger Reischuk:
Separating the Lower Levels of the Sublogarithmic Space Hierarchy. STACS 1993: 16-27 - 1990
- [j4]Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys:
Reversal Complexity Classes for Alternating Turing Machines. SIAM J. Comput. 19(2): 207-221 (1990) - [j3]Maciej Liskiewicz, Krzysztof Lorys:
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones. SIAM J. Comput. 19(3): 511-521 (1990)
1980 – 1989
- 1989
- [c3]Maciej Liskiewicz, Krzysztof Lorys:
Some Time-Space Bounds for One-Tape Deterministic Turing Machines. FCT 1989: 297-307 - [c2]Maciej Liskiewicz, Krzysztof Lorys:
On Reversal Complexity for Alternating Turing Machines (Extended Abstract). FOCS 1989: 618-623 - 1988
- [j2]Maciej Liskiewicz, Krzysztof Lorys:
Alternating Real-Time Computations. Inf. Process. Lett. 28(6): 311-316 (1988) - [c1]Krzysztof Lorys, Maciej Liskiewicz:
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. MFCS 1988: 445-453 - 1987
- [j1]Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów:
On Reversal Bounded Alternating Turing Machines. Theor. Comput. Sci. 54: 331-339 (1987)
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-12-05 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
