Search results for "CSR"

Hits ?▲	Authors	Title	Venue	Year	Link
35	Arshiya Khan, Chase Cotton	Detecting Attacks on IoT Devices using Featureless 1D-CNN.	CSR	2021	DBLP DOI BibTeX RDF
35	Oluwagbemiga Ajayi, Aryya Gangopadhyay	DAHID: Domain Adaptive Host-based Intrusion Detection.	CSR	2021	DBLP DOI BibTeX RDF
35	Kadir Burak Mavzer, Ewa Konieczna, Henrique Alves, Cagatay Yucel, Ioannis Chalkias, Dimitrios Mallis, Deniz Cetinkaya, Luis Angel Galindo Sánchez	Trust and Quality Computation for Cyber Threat Intelligence Sharing Platforms.	CSR	2021	DBLP DOI BibTeX RDF
35	Csaba Virág, Jakub Cegan, Tomás Lieskovan, Matteo Merialdo	The Current State of The Art and Future of European Cyber Range Ecosystem.	CSR	2021	DBLP DOI BibTeX RDF
35	Valentina Casola, Alessandra De Benedictis, Carlo Mazzocca, Rebecca Montanari	Toward Automated Threat Modeling of Edge Computing Systems.	CSR	2021	DBLP DOI BibTeX RDF
35	Josep Soler Garrido, Dominik Dold, Johannes Frank	Machine learning on knowledge graphs for context-aware security monitoring.	CSR	2021	DBLP DOI BibTeX RDF
35	Jingyi Liao, Sin G. Teo, Partha Pratim Kundu, Tram Truong-Huu	ENAD: An Ensemble Framework for Unsupervised Network Anomaly Detection.	CSR	2021	DBLP DOI BibTeX RDF
35	Aiden Hoyle, Thomas Powell, Beatrice Cadet, Judith van de Kuijt	Influence Pathways: Mapping the Narratives and Psychological Effects of Russian COVID-19 Disinformation.	CSR	2021	DBLP DOI BibTeX RDF
35	Jari Isohanni, Lorna Goulden, Kai M. Hermsen, Mirko Ross, Jef Vanbockryck	Disposable identities; enabling trust-by-design to build more sustainable data driven value.	CSR	2021	DBLP DOI BibTeX RDF
35	Jing Wen, Siu-Ming Yiu, Lucas C. K. Hui	Defending Against Model Inversion Attack by Adversarial Examples.	CSR	2021	DBLP DOI BibTeX RDF
35	Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith	Injective Colouring for H-Free Graphs.	CSR	2021	DBLP DOI BibTeX RDF
35	Olga G. Parshina, Svetlana Puzynina	On Closed-Rich Words.	CSR	2021	DBLP DOI BibTeX RDF
35	Xuangui Huang, Emanuele Viola	Average-Case Rigidity Lower Bounds.	CSR	2021	DBLP DOI BibTeX RDF
35	Nikolay V. Proskurin	On Separation Between the Degree of a Boolean Function and the Block Sensitivity.	CSR	2021	DBLP DOI BibTeX RDF
35	Manon Blanc, Kristoffer Arnsfelt Hansen	Computational Complexity of Multi-player Evolutionarily Stable Strategies.	CSR	2021	DBLP DOI BibTeX RDF
35	Markus Holzer 0001, Christian Rauch 0001	On the Computational Complexity of Reaction Systems, Revisited.	CSR	2021	DBLP DOI BibTeX RDF
35	Alexander Okhotin, Victor L. Selivanov	Input-Driven Pushdown Automata on Well-Nested Infinite Strings.	CSR	2021	DBLP DOI BibTeX RDF
35	Johan M. M. van Rooij	A Generic Convolution Algorithm for Join Operations on Tree Decompositions.	CSR	2021	DBLP DOI BibTeX RDF
35	Vladimir Shenmaier	Approximation and Complexity of the Capacitated Geometric Median Problem.	CSR	2021	DBLP DOI BibTeX RDF
35	Vaibhav Krishan	Upper Bound for Torus Polynomials.	CSR	2021	DBLP DOI BibTeX RDF
35	Shuo Pang	Large Clique is Hard on Average for Resolution.	CSR	2021	DBLP DOI BibTeX RDF
35	Klaus Meer	A PCP of Proximity for Real Algebraic Polynomials.	CSR	2021	DBLP DOI BibTeX RDF
35	Zeev Nutov	Approximation Algorithms for Connectivity Augmentation Problems.	CSR	2021	DBLP DOI BibTeX RDF
35	Anna Gál, Ridwan Syed	Upper Bounds on Communication in Terms of Approximate Rank.	CSR	2021	DBLP DOI BibTeX RDF
35	Pawel Parys	Shelah-Stupp's and Muchnik's Iterations Revisited.	CSR	2021	DBLP DOI BibTeX RDF
35	Pranjal Dutta	Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization.	CSR	2021	DBLP DOI BibTeX RDF
35	Zuguang Gao, John R. Birge, Varun Gupta 0004	Approximation Schemes for Multiperiod Binary Knapsack Problems.	CSR	2021	DBLP DOI BibTeX RDF
35	Prasad Chaugule, Nutan Limaye, Shourya Pandey	Variants of the Determinant Polynomial and the VP-Completeness.	CSR	2021	DBLP DOI BibTeX RDF
35	Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler 0001	Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations.	CSR	2021	DBLP DOI BibTeX RDF
35	Ning Xie 0002, Shuai Xu, Yekun Xu	A Generalization of a Theorem of Rothschild and van Lint.	CSR	2021	DBLP DOI BibTeX RDF
35	Austen Z. Fan, Jin-Yi Cai	Dichotomy Result on 3-Regular Bipartite Non-negative Functions.	CSR	2021	DBLP DOI BibTeX RDF
35	Purnata Ghosal, B. V. Raghavendra Rao	Limitations of Sums of Bounded Read Formulas and ABPs.	CSR	2021	DBLP DOI BibTeX RDF
35	Florent Koechlin, Pablo Rotondo	Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection.	CSR	2021	DBLP DOI BibTeX RDF
35	Augusto Modanese	Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata.	CSR	2021	DBLP DOI BibTeX RDF
35	Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone	A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards.	CSR	2021	DBLP DOI BibTeX RDF
35	Zeev Nutov	On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs.	CSR	2021	DBLP DOI BibTeX RDF
35	Samir Datta, Anuj Tawari, Yadu Vasudev	Dynamic Complexity of Expansion.	CSR	2021	DBLP DOI BibTeX RDF
35	Alexey Milovanov	Predictions and Algorithmic Statistics for Infinite Sequences.	CSR	2021	DBLP DOI BibTeX RDF
35	Henning Fernau (eds.)	Computer Science - Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 - July 3, 2020, Proceedings	CSR	2020	DBLP DOI BibTeX RDF
35	Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh	Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.	CSR	2020	DBLP DOI BibTeX RDF
35	Alexander Okhotin, Ilya Olkhovsky	On the Transformation of LL(k)-linear Grammars to LL(1)-linear.	CSR	2020	DBLP DOI BibTeX RDF
35	Ulrik Brandes	Central Positions in Social Networks.	CSR	2020	DBLP DOI BibTeX RDF
35	Onur Çagirici	On Embeddability of Unit Disk Graphs onto Straight Lines.	CSR	2020	DBLP DOI BibTeX RDF
35	Yaokun Wu, Yinfeng Zhu 0001	Weighted Rooted Trees: Fat or Tall?	CSR	2020	DBLP DOI BibTeX RDF
35	Dmitry Kosolobov, Oleg Merkurev	Optimal Skeleton Huffman Trees Revisited.	CSR	2020	DBLP DOI BibTeX RDF
35	Akihiro Yamamura, Riki Kase, Tatiana Baginová Jajcayová	Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals.	CSR	2020	DBLP DOI BibTeX RDF
35	Vladimir Gurvich, Mikhail N. Vyalyi	Computational Hardness of Multidimensional Subtraction Games.	CSR	2020	DBLP DOI BibTeX RDF
35	Fedor V. Fomin, Vijayaragunathan Ramamoorthi	On the Parameterized Complexity of the Expected Coverage Problem.	CSR	2020	DBLP DOI BibTeX RDF
35	Bruno Bauwens, Ilya Blinnikov	The Normalized Algorithmic Information Distance Can Not Be Approximated.	CSR	2020	DBLP DOI BibTeX RDF
35	Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka	An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter.	CSR	2020	DBLP DOI BibTeX RDF
35	Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh 0001	Parameterized Complexity of Fair Feedback Vertex Set Problem.	CSR	2020	DBLP DOI BibTeX RDF
35	Tobias Rupp, Stefan Funke	A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels.	CSR	2020	DBLP DOI BibTeX RDF
35	Piotr Faliszewski, Piotr Skowron 0001, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon	Isomorphic Distances Among Elections.	CSR	2020	DBLP DOI BibTeX RDF
35	Geevarghese Philip, M. R. Rani, R. Subashini	On Computing the Hamiltonian Index of Graphs.	CSR	2020	DBLP DOI BibTeX RDF
35	Jaeyoon Kim, Ilya Volkovich, Nelson Xuzhi Zhang	The Power of Leibniz-Like Functions as Oracles.	CSR	2020	DBLP DOI BibTeX RDF
35	Wolfgang Merkle, Ivan Titov	Speedable Left-c.e. Numbers.	CSR	2020	DBLP DOI BibTeX RDF
35	Marc Neveling, Jörg Rothe, Roman Zorn	The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters.	CSR	2020	DBLP DOI BibTeX RDF
35	Alexey L. Talambutsa	On Subquadratic Derivational Complexity of Semi-Thue Systems.	CSR	2020	DBLP DOI BibTeX RDF
35	Binhai Zhu	Tandem Duplications, Segmental Duplications and Deletions, and Their Applications.	CSR	2020	DBLP DOI BibTeX RDF
35	Dietrich Kuske	The Subtrace Order and Counting First-Order Logic.	CSR	2020	DBLP DOI BibTeX RDF
35	Iovka Boneva, Joachim Niehren, Momar Sakho	Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata.	CSR	2020	DBLP DOI BibTeX RDF
35	Abhishek Sahu, Saket Saurabh 0001	Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs.	CSR	2020	DBLP DOI BibTeX RDF
35	Akanksha Agrawal 0001, Meirav Zehavi	Parameterized Analysis of Art Gallery and Terrain Guarding.	CSR	2020	DBLP DOI BibTeX RDF
35	Nikolay Bazhenov 0001	Definable Subsets of Polynomial-Time Algebraic Structures.	CSR	2020	DBLP DOI BibTeX RDF
35	Anastasiya Chistopolskaya, Vladimir V. Podolskii	On the Decision Tree Complexity of Threshold Functions.	CSR	2020	DBLP DOI BibTeX RDF
35	Samir Datta, Chetan Gupta 0002, Rahul Jain 0015, Vimal Raj Sharma, Raghunath Tewari	Randomized and Symmetric Catalytic Computation.	CSR	2020	DBLP DOI BibTeX RDF
35	Ilya Volkovich	The Untold Story of SBP.	CSR	2020	DBLP DOI BibTeX RDF
35	Alexsander Andrade de Melo, Mateus de Oliveira Oliveira	Second-Order Finite Automata.	CSR	2020	DBLP DOI BibTeX RDF
35	Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev	Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations.	CSR	2020	DBLP DOI BibTeX RDF
35	Maxim Akhmedov	Faster 2-Disjoint-Shortest-Paths Algorithm.	CSR	2020	DBLP DOI BibTeX RDF
35	René van Bevern, Gregory Kucherov (eds.)	Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings	CSR	2019	DBLP DOI BibTeX RDF
35	Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot	Reconstructing a Convex Polygon from Its \omega ω -cloud.	CSR	2019	DBLP DOI BibTeX RDF
35	Shmuel Tomi Klein, Shoham Saadia, Dana Shapira	Forward Looking Huffman Coding.	CSR	2019	DBLP DOI BibTeX RDF
35	Denis K. Ponomaryov	A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs.	CSR	2019	DBLP DOI BibTeX RDF
35	Sergey M. Dudakov, Boris Karlov	On Decidability of Regular Languages Theories.	CSR	2019	DBLP DOI BibTeX RDF
35	Vladimir Braverman	Approximations of Schatten Norms via Taylor Expansions.	CSR	2019	DBLP DOI BibTeX RDF
35	Suthee Ruangwises, Toshiya Itoh	AND Protocols Using only Uniform Shuffles.	CSR	2019	DBLP DOI BibTeX RDF
35	Ivan Koswara, Svetlana Selivanova, Martin Ziegler 0001	Computational Complexity of Real Powering and Improved Solving Linear Differential Equations.	CSR	2019	DBLP DOI BibTeX RDF
35	Václav Blazej, Pavel Dvorák, Tomás Valla	On Induced Online Ramsey Number of Paths, Cycles, and Trees.	CSR	2019	DBLP DOI BibTeX RDF
35	Pierre Guillon 0001, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier	Undecidable Word Problem in Subshift Automorphism Groups.	CSR	2019	DBLP DOI BibTeX RDF
35	Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh 0001	On the Complexity of Mixed Dominating Set.	CSR	2019	DBLP DOI BibTeX RDF
35	Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman	Belga B-Trees.	CSR	2019	DBLP DOI BibTeX RDF
35	Ruhollah Majdoddin	Uniform CSP Parameterized by Solution Size is in W[1].	CSR	2019	DBLP DOI BibTeX RDF
35	Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001	On the Parameterized Complexity of Edge-Linked Paths.	CSR	2019	DBLP DOI BibTeX RDF
35	Kshitij Gajjar, Jaikumar Radhakrishnan	Minimizing Branching Vertices in Distance-Preserving Subgraphs.	CSR	2019	DBLP DOI BibTeX RDF
35	Yousef M. Alhamdan, Alexander V. Kononov	Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem.	CSR	2019	DBLP DOI BibTeX RDF
35	Francesco Dolce, Dominique Perrin	Eventually Dendric Shifts.	CSR	2019	DBLP DOI BibTeX RDF
35	Ludmila Glinskih, Dmitry Itsykson	On Tseitin Formulas, Read-Once Branching Programs and Treewidth.	CSR	2019	DBLP DOI BibTeX RDF
35	Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001	Parameterized Complexity of Conflict-Free Set Cover.	CSR	2019	DBLP DOI BibTeX RDF
35	Moses Ganardi, Danny Hucke, Markus Lohrey	Derandomization for Sliding Window Algorithms with Strict Correctness.	CSR	2019	DBLP DOI BibTeX RDF
35	Eric Allender, Rahul Ilango, Neekon Vafa	The Non-hardness of Approximating Circuit Size.	CSR	2019	DBLP DOI BibTeX RDF
35	Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon	Sybil-Resilient Conductance-Based Community Growth.	CSR	2019	DBLP DOI BibTeX RDF
35	Svyatoslav Gryaznov	Notes on Resolution over Linear Equations.	CSR	2019	DBLP DOI BibTeX RDF
35	Neeldhara Misra, Piyush Rathi	The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.	CSR	2019	DBLP DOI BibTeX RDF
35	Suthee Ruangwises, Toshiya Itoh	Unpopularity Factor in the Marriage and Roommates Problems.	CSR	2019	DBLP DOI BibTeX RDF
35	Bireswar Das, Shivdutt Sharma	Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes.	CSR	2019	DBLP DOI BibTeX RDF
35	Elena A. Petrova, Arseny M. Shur	Transition Property for Cube-Free Words.	CSR	2019	DBLP DOI BibTeX RDF
35	Aleksandrs Belovs	Quantum Algorithm for Distribution-Free Junta Testing.	CSR	2019	DBLP DOI BibTeX RDF
35	Andreas Goerdt	Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions.	CSR	2019	DBLP DOI BibTeX RDF
35	Dmitry Kravchenko, Kamil Khadiev, Danil Serov	On the Quantum and Classical Complexity of Solving Subtraction Games.	CSR	2019	DBLP DOI BibTeX RDF