| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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 |
|
| 1 | Zeev Nutov |
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs. |
CSR |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Anuj Tawari, Yadu Vasudev |
Dynamic Complexity of Expansion. |
CSR |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexey Milovanov |
Predictions and Algorithmic Statistics for Infinite Sequences. |
CSR |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh |
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Ilya Olkhovsky |
On the Transformation of LL(k)-linear Grammars to LL(1)-linear. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrik Brandes |
Central Positions in Social Networks. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Onur Çagirici |
On Embeddability of Unit Disk Graphs onto Straight Lines. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaokun Wu, Yinfeng Zhu 0001 |
Weighted Rooted Trees: Fat or Tall? |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Kosolobov, Oleg Merkurev |
Optimal Skeleton Huffman Trees Revisited. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Akihiro Yamamura, Riki Kase, Tatiana Baginová Jajcayová |
Groupoid Action and Rearrangement Problem of Bicolor Arrays by Prefix Reversals. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Gurvich, Mikhail N. Vyalyi |
Computational Hardness of Multidimensional Subtraction Games. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Vijayaragunathan Ramamoorthi |
On the Parameterized Complexity of the Expected Coverage Problem. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Bauwens, Ilya Blinnikov |
The Normalized Algorithmic Information Distance Can Not Be Approximated. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
|
| 1 | Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh 0001 |
Parameterized Complexity of Fair Feedback Vertex Set Problem. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
|
| 1 | Tobias Rupp, Stefan Funke |
A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Piotr Skowron 0001, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon |
Isomorphic Distances Among Elections. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, M. R. Rani, R. Subashini |
On Computing the Hamiltonian Index of Graphs. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaeyoon Kim, Ilya Volkovich, Nelson Xuzhi Zhang |
The Power of Leibniz-Like Functions as Oracles. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Merkle, Ivan Titov |
Speedable Left-c.e. Numbers. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
|
| 1 | Alexey L. Talambutsa |
On Subquadratic Derivational Complexity of Semi-Thue Systems. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Binhai Zhu |
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske |
The Subtrace Order and Counting First-Order Logic. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Iovka Boneva, Joachim Niehren, Momar Sakho |
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhishek Sahu, Saket Saurabh 0001 |
Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Meirav Zehavi |
Parameterized Analysis of Art Gallery and Terrain Guarding. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolay Bazhenov 0001 |
Definable Subsets of Polynomial-Time Algebraic Structures. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anastasiya Chistopolskaya, Vladimir V. Podolskii |
On the Decision Tree Complexity of Threshold Functions. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Chetan Gupta 0002, Rahul Jain 0015, Vimal Raj Sharma, Raghunath Tewari |
Randomized and Symmetric Catalytic Computation. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Volkovich |
The Untold Story of SBP. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexsander Andrade de Melo, Mateus de Oliveira Oliveira |
Second-Order Finite Automata. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Farid M. Ablayev, Marat Ablayev, Alexander Vasiliev |
Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Akhmedov |
Faster 2-Disjoint-Shortest-Paths Algorithm. |
CSR |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot |
Reconstructing a Convex Polygon from Its \omega ω -cloud. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Tomi Klein, Shoham Saadia, Dana Shapira |
Forward Looking Huffman Coding. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis K. Ponomaryov |
A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
|
| 1 | Sergey M. Dudakov, Boris Karlov |
On Decidability of Regular Languages Theories. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman |
Approximations of Schatten Norms via Taylor Expansions. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Suthee Ruangwises, Toshiya Itoh |
AND Protocols Using only Uniform Shuffles. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Koswara, Svetlana Selivanova, Martin Ziegler 0001 |
Computational Complexity of Real Powering and Improved Solving Linear Differential Equations. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
|
| 1 | Pierre Guillon 0001, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier |
Undecidable Word Problem in Subshift Automorphism Groups. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh 0001 |
On the Complexity of Mixed Dominating Set. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
Belga B-Trees. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruhollah Majdoddin |
Uniform CSP Parameterized by Solution Size is in W[1]. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Fahad Panolan, Saket Saurabh 0001 |
On the Parameterized Complexity of Edge-Linked Paths. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kshitij Gajjar, Jaikumar Radhakrishnan |
Minimizing Branching Vertices in Distance-Preserving Subgraphs. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Yousef M. Alhamdan, Alexander V. Kononov |
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Dolce, Dominique Perrin |
Eventually Dendric Shifts. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludmila Glinskih, Dmitry Itsykson |
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001 |
Parameterized Complexity of Conflict-Free Set Cover. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Ganardi, Danny Hucke, Markus Lohrey |
Derandomization for Sliding Window Algorithms with Strict Correctness. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Rahul Ilango, Neekon Vafa |
The Non-hardness of Approximating Circuit Size. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon |
Sybil-Resilient Conductance-Based Community Growth. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Svyatoslav Gryaznov |
Notes on Resolution over Linear Equations. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Piyush Rathi |
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Suthee Ruangwises, Toshiya Itoh |
Unpopularity Factor in the Marriage and Roommates Problems. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Shivdutt Sharma |
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena A. Petrova, Arseny M. Shur |
Transition Property for Cube-Free Words. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksandrs Belovs |
Quantum Algorithm for Distribution-Free Junta Testing. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Goerdt |
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Kravchenko, Kamil Khadiev, Danil Serov |
On the Quantum and Classical Complexity of Solving Subtraction Games. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan-Hendrik Lorenz |
On the Complexity of Restarting. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdi Belbasi, Martin Fürer |
A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. |
CSR |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Riazanov |
On the Decision Trees with Symmetries. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou |
Periodicity in Data Streams with Wildcards. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe F. Italiano, Yannis Manoussakis, Kim Thang Nguyen, Hong Phong Pham |
Maximum Colorful Cycles in Vertex-Colored Graphs. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Genkin, Michael Kaminski, Liat Peterfreund |
Closure Under Reversal of Languages over Infinite Alphabets. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Rubtsov, Mikhail N. Vyalyi |
On Emptiness and Membership Problems for Set Automata. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Niranka Banerjee, Venkatesh Raman 0001, Srinivasa Rao Satti |
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Wojtczak |
On Strong NP-Completeness of Rational Problems. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ning Xie 0002, Shuai Xu, Yekun Xu |
A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract). |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain 0001, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs |
Quadratically Tight Relations for Randomized Query Complexity. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander S. Kulikov |
Lower Bounds for Unrestricted Boolean Circuits: Open Problems. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Etienne Moutot, Pascal Vanier |
Slopes of 3-Dimensional Subshifts of Finite Type. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje |
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman 0001 |
Structural Parameterizations of Dominating Set Variants. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber |
Grammar-Based Compression of Unranked Trees. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette |
The Clever Shopper Problem. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Chitnis, Nimrod Talmon |
Can We Create Large k-Cores by Adding Few Edges? |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pallavi Jain 0001, Lawqueen Kanesh, Pranabendu Misra |
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Karpinski, Krzysztof Piecuch |
On Vertex Coloring Without Monochromatic Triangles. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan |
Facility Location on Planar Graphs with Unreliable Links. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert |
Complement for Two-Way Alternating Automata. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Vladimir V. Podolskii (eds.) |
Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Chitnis, Andreas Emil Feldmann |
A Tight Lower Bound for Steiner Orientation. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Hospodár, Galina Jirásková, Ivana Krajnáková |
Operations on Boolean and Alternating Finite Automata. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kozachinskiy |
Recognizing Read-Once Functions from Depth-Three Formulas. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi |
Max-Cut Above Spanning Tree is Fixed-Parameter Tractable. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael E. Saks |
Online Labeling: Algorithms, Lower Bounds and Open Questions. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Gurvich |
Complexity of Generation. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonid Barenboim, Victor Khazanov |
Distributed Symmetry-Breaking Algorithms for Congested Cliques. |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi |
Verification of Quantum Computation and the Price of Trust. |
CSR |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Place, Marc Zeitoun |
Concatenation Hierarchies: New Bottle, Old Wine. |
CSR |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Aida Gainutdinova, Abuzer Yakaryilmaz |
Nondeterministic Unitary OBDDs. |
CSR |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Khramtcova, Maarten Löffler |
Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals. |
CSR |
2017 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license