The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Maciej Liskiewicz" ( http://dblp.L3S.de/Authors/Maciej_Liskiewicz )

URL (Homepage):  http://www.tcs.uni-luebeck.de/en/mitarbeiter/liskiewi/  Author page on DBLP  Author page in RDF  Community of Maciej Liskiewicz in ASPL-2

Publication years (Num. hits)
1987-1997 (15) 1999-2003 (15) 2004-2006 (15) 2007-2011 (15) 2012-2016 (18) 2017-2019 (15)
Publication types (Num. hits)
article(44) inproceedings(48) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords

Results
Found 94 publication records. Showing 93 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Benito van der Zander, Maciej Liskiewicz, Johannes Textor Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework. Search on Bibsonomy Artif. Intell. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk Proper learning of k-term DNF formulas from satisfying assignments. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benito van der Zander, Maciej Liskiewicz Finding Minimal d-separators in Linear Time and Applications. Search on Bibsonomy UAI The full citation details ... 2019 DBLP  BibTeX  RDF
1Benito van der Zander, Maciej Liskiewicz, Johannes Textor Separators and Adjustment Sets in Causal Graphs: Complete Criteria and an Algorithmic Framework. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz On the Gold Standard for Security of Universal Steganography. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz On the Gold Standard for Security of Universal Steganography. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2018 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz On the Gold Standard for Security of Universal Steganography. Search on Bibsonomy EUROCRYPT (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel Security levels in steganography - Insecurity does not imply detectability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk Learning Residual Alternating Automata. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2017 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk Proper Learning of k-term DNF Formulas from Satisfying Assignments. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2017 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz Algorithm Substitution Attacks from a Steganographic Perspective. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Martin R. Schuster, Maciej Liskiewicz Abilities and Limitations of Spectral Graph Bisection. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz Algorithm Substitution Attacks from a Steganographic Perspective. Search on Bibsonomy ACM Conference on Computer and Communications Security The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Martin R. Schuster, Maciej Liskiewicz New Abilities and Limitations of Spectral Graph Bisection. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk Learning Residual Alternating Automata. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz Hard Communication Channels for Steganography. Search on Bibsonomy ISAAC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Benito van der Zander, Maciej Liskiewicz Separators and Adjustment Sets in Markov Equivalent DAGs. Search on Bibsonomy AAAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Sebastian Berndt, Maciej Liskiewicz Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. Search on Bibsonomy IH&MMSec The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Benito van der Zander, Maciej Liskiewicz On Searching for Generalized Instrumental Variables. Search on Bibsonomy AISTATS The full citation details ... 2016 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel Security Levels in Steganography - Insecurity does not Imply Detectability. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2015 DBLP  BibTeX  RDF
1Johannes Textor, Alexander Idelberger, Maciej Liskiewicz Learning from Pairwise Marginal Independencies. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. Search on Bibsonomy ISAAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Johannes Textor, Alexander Idelberger, Maciej Liskiewicz Learning from Pairwise Marginal Independencies. Search on Bibsonomy UAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Benito van der Zander, Johannes Textor, Maciej Liskiewicz Efficiently Finding Conditional Instruments for Causal Inference. Search on Bibsonomy IJCAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Martin R. Schuster A new upper bound for the traveling salesman problem in cubic graphs. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benito van der Zander, Maciej Liskiewicz, Johannes Textor Constructing Separators and Adjustment Sets in Ancestral Graphs. Search on Bibsonomy UAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Benito van der Zander, Maciej Liskiewicz, Johannes Textor Constructing Separators and Adjustment Sets in Ancestral Graphs. Search on Bibsonomy CI@UAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Johannes Textor, Katharina Dannenberg, Maciej Liskiewicz A generic finite automata based approach to implementing lymphocyte repertoire models. Search on Bibsonomy GECCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Alexander Idelberger, Maciej Liskiewicz On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals. Search on Bibsonomy CCCG The full citation details ... 2014 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel Grey-box steganography. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Martin R. Schuster A new upper bound for the traveling salesman problem in cubic graphs. Search on Bibsonomy CTW The full citation details ... 2013 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Martin R. Schuster Improved Analysis of an Exact Algorithm for Cubic Graph TSP Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Johannes Textor, Maciej Liskiewicz Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Christian Hundt 0001, Maciej Liskiewicz New complexity bounds for image matching under rotation and scaling. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey Privacy in Non-private Environments. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel Grey-Box Steganography. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Johannes Textor, Maciej Liskiewicz Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective. Search on Bibsonomy UAI The full citation details ... 2011 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Johannes Textor Negative selection algorithms without generating detectors. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF consistent learning, artificial immune systems, negative selection
1Christian Hundt 0001, Maciej Liskiewicz, Ragnar Nevries A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer Improving the average delay of sorting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christian Hundt 0001, Maciej Liskiewicz New Complexity Bounds for Image Matching under Rotation and Scaling. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry Susceptible Two-Party Quantum Computations. Search on Bibsonomy ICITS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Hundt 0001, Maciej Liskiewicz Two-Dimensional Pattern Matching with Combined Scaling and Rotation. Search on Bibsonomy CPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF combinatorial pattern matching, digital image matching, discrete rotations and scalings, discrete algorithms
1Christian Hundt 0001, Maciej Liskiewicz Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Hundt 0001, Maciej Liskiewicz A Combinatorial Geometric Approach to Linear Image Matching. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk Preface. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer Improving the Average Delay of Sorting. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christian Hundt 0001, Maciej Liskiewicz On the Complexity of Affine Image Matching. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey Private Computation: k-Connected versus 1-Connected Networks. Search on Bibsonomy J. Cryptology The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Connectivity, Randomness, Secure multi-party computation, Secure function evaluation, Parity, Private computation
1Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry Using quantum oblivious transfer to cheat sensitive quantum bit commitment Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Space efficient algorithms for directed series-parallel graphs. Search on Bibsonomy J. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christian Hundt 0001, Maciej Liskiewicz, Ulrich Wölfel Provably Secure Steganography and the Complexity of Sampling. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz Multiparty Computations in Non-private Environments. Search on Bibsonomy GTIT-C The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Jan Arpe, Andreas Jakoby, Maciej Liskiewicz One-way communication complexity of symmetric Boolean functions. Search on Bibsonomy ITA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz Revealing Additional Information in Two-Party Computations. Search on Bibsonomy ASIACRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk (eds.) Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Ulrich Wölfel On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. Search on Bibsonomy Information Hiding The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Bodo Manthey New lower and upper bounds for the competitive ratio of transmission protocols. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Approximating schedules for dynamic process graphs efficiently. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey Privacy in Non-private Environments. Search on Bibsonomy ASIACRYPT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Hemant J. Purohit, Dhananjay V. Raje Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity. Search on Bibsonomy WABI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jan Arpe, Andreas Jakoby, Maciej Liskiewicz One-Way Communication Complexity of Symmetric Boolean Functions Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey Private Computation - k-connected versus 1-connected Networks Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey Privacy in Non-Private Environments Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2003 DBLP  BibTeX  RDF
1Jan Arpe, Andreas Jakoby, Maciej Liskiewicz One-Way Communication Complexity of Symmetric Boolean Functions. Search on Bibsonomy FCT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Private Computations in Networks: Topology versus Randomness. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Space Efficient Algorithms for Directed Series-Parallel Graphs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz Paths Problems in Symmetric Logarithmic Space. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert Private Computation - k-Connected versus 1-Connected Networks. Search on Bibsonomy CRYPTO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Dynamic Process Graphs and the Complexity of Scheduling Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz The Complexity of Some Basic Problems for Dynamic Process Graphs. Search on Bibsonomy ISAAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Space Efficient Algorithms for Series-Parallel Graphs. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk The Expressive Power and Complexity of Dynamic Process Graphs. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Search on Bibsonomy Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Scheduling Dynamic Graphs. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. Search on Bibsonomy MFCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. Search on Bibsonomy STACS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk The Sublogarithmic Alternating Space World. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk The Sublogarithmic Alternating Space World Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1995 DBLP  BibTeX  RDF
1Maciej Liskiewicz On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk The Complexity World below Logarithmic Space. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz On the Relationship Between Deterministic Time and Deterministic Reversal. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Rüdiger Reischuk Separating the Lower Levels of the Sublogarithmic Space Hierarchy. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Krzysztof Lorys Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys Reversal Complexity Classes for Alternating Turing Machines. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Krzysztof Lorys On Reversal Complexity for Alternating Turing Machines (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF reversal complexity, nonregular languages, ATM, space complexities, alternating Turing machines
1Maciej Liskiewicz, Krzysztof Lorys Some Time-Space Bounds for One-Tape Deterministic Turing Machines. Search on Bibsonomy FCT The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Krzysztof Lorys Alternating Real-Time Computations. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Krzysztof Lorys, Maciej Liskiewicz Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. Search on Bibsonomy MFCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów On Reversal Bounded Alternating Turing Machines. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #93 of 93 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license