![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Markus Bläser
Saarland University, Saarbrücken, Germany
Likely matches
- Markus Blaser
Albis Optoelectronics AG, Switzerland
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 128 matches
- 2024
- Aaryan Gupta, Markus Bläser:
Identification for Tree-Shaped Structural Causal Models in Polynomial Time. AAAI 2024: 20404-20411 - Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta, Saswata Mukherjee:
Exponential Lower Bounds via Exponential Sums. ICALP 2024: 24:1-24:20 - Markus Bläser, Zhili Chen, Dung Hoang Duong, Antoine Joux, Tuong Ngoc Nguyen, Thomas Plantard, Youming Qiao, Willy Susilo, Gang Tang:
On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures. PQCrypto (1) 2024: 227-261 - Markus Bläser, Julian Dörfler, Gorav Jindal:
PosSLP and Sum of Squares. CoRR abs/2403.00115 (2024) - Sanyam Agarwal, Markus Bläser:
Probabilistic Generating Circuits - Demystified. CoRR abs/2404.02912 (2024) - 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) - 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) - 2023
- Christophe Paul, Markus Bläser:
Preface of STACS 2020 Special Issue. Theory Comput. Syst. 67(1): 1-3 (2023) - Markus Bläser:
Not all Strongly Rayleigh Distributions Have Small Probabilistic Generating Circuits. ICML 2023: 2592-2602 - Benito van der Zander, Markus Bläser, Maciej Liskiewicz:
The Hardness of Reasoning about Probabilities and Causality. IJCAI 2023: 5730-5738 - Markus Bläser, Hendrik Mayer, Devansh Shringi
:
On the Multilinear Complexity of Associative Algebras. STACS 2023: 12:1-12:18 - Benito van der Zander, Markus Bläser, Maciej Liskiewicz:
The Hardness of Reasoning about Probabilities and Causality. CoRR abs/2305.09508 (2023) - Aaryan Gupta, Markus Bläser:
Identification for Tree-shaped Structural Causal Models in Polynomial Time. CoRR abs/2311.14058 (2023) - 2022
- Benito van der Zander, Marcel Wienöbst, Markus Bläser, Maciej Liskiewicz:
Identification in Tree-shaped Linear Structural Causal Models. AISTATS 2022: 6770-6792 - Alberto Ciarrocchi, Wei Quan, Markus Blaser, Maria Hämmerli, Hektor Meier:
Optical Damage Threshold Screening Methodology for 28 GBd, Long Wavelength Avalanche Photodiodes. OFC 2022: 1-3 - 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) - Markus Bläser, Valentine Kabanets, Ronen Shaltiel, Jacobo Torán:
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371). Dagstuhl Reports 12(9): 41-59 (2022) - 2021
- Markus Bläser, Julian Dörfler
, Christian Ikenmeyer:
On the Complexity of Evaluating Highest Weight Vectors. CCC 2021: 29:1-29:36 - Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov
, Anurag Pandey, Frank-Olaf Schreyer:
On the Orbit Closure Containment Problem and Slice Rank of Tensors. SODA 2021: 2565-2584 - Markus Bläser, Benjamin Monmege
:
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). LIPIcs 187, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-180-1 [contents] - 2020
- Markus Bläser, Anurag Pandey:
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. APPROX-RANDOM 2020: 8:1-8:13 - Markus Bläser, Christian Ikenmeyer, Meena Mahajan
, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CCC 2020: 21:1-21:24 - Markus Bläser, Vladimir Lysikov
:
Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras. MFCS 2020: 17:1-17:15 - Christophe Paul
, Markus Bläser:
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. LIPIcs 154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-140-5 [contents] - Markus Bläser, Julian Dörfler, Christian Ikenmeyer:
On the complexity of evaluating highest weight vectors. CoRR abs/2002.11594 (2020) - Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CoRR abs/2003.04834 (2020) - Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- Markus Bläser, Gorav Jindal
:
On the Complexity of Symmetric Polynomials. ITCS 2019: 47:1-47:14 - Markus Bläser, Christian Engels
:
Parameterized Valiant's Classes. IPEC 2019: 3:1-3:14 - Vishwas Bhargava
, Markus Bläser, Gorav Jindal
, Anurag Pandey:
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. SODA 2019: 647-661
skipping 98 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 10:25 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint