| Publication | Date of Publication | Type |
|---|
| Simple deterministic approximation for submodular multiple knapsack problem | 2025-01-06 | Paper |
| A DSC approach to adaptive dynamic region-based tracking control for strict-feedback non-linear systems | 2024-08-29 | Paper |
| New distinguishers for negation-limited weak pseudorandom functions | 2024-08-20 | Paper |
| Search algorithm on strongly regular graph by lackadaisical quantum walk | 2024-06-25 | Paper |
| Moser-Tardos algorithm: beyond Shearer's bound | 2024-05-14 | Paper |
| Lackadaisical discrete-time quantum walk on Johnson graph | 2024-03-20 | Paper |
| On the generalized shuffle-exchange problem | 2023-04-05 | Paper |
| From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces. | 2023-02-03 | Paper |
| Querying a Matrix Through Matrix-Vector Products. | 2022-07-21 | Paper |
| On the relationship between energy complexity and other Boolean function measures | 2022-07-18 | Paper |
| Higher order monotonicity and submodularity of influence in social networks: from local to global | 2022-06-08 | Paper |
| Null-free false discovery rate control using decoy permutations | 2022-04-14 | Paper |
| Discouraging pool block withholding attacks in bitcoin | 2022-04-13 | Paper |
| On the Sensitivity Complexity of k -Uniform Hypergraph Properties | 2022-03-22 | Paper |
| Weights of exact threshold functions | 2022-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5033699 | 2022-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5033700 | 2022-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5033738 | 2022-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5033749 | 2022-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5033763 | 2022-02-23 | Paper |
| Querying a Matrix through Matrix-Vector Products | 2022-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009608 | 2021-08-04 | Paper |
| Perfect Sampling for (Atomic) Lov\'asz Local Lemma | 2021-07-08 | Paper |
| From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces | 2021-06-22 | Paper |
| The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes | 2021-05-12 | Paper |
| The formation of social network assortativity: a cultural trait-matching mechanism | 2021-02-08 | Paper |
| Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis | 2021-02-02 | Paper |
| The one-round multi-player discrete Voronoi game on grids and trees | 2020-09-01 | Paper |
| Better Upper Bounds for Searching on a Line with Byzantine Robots | 2020-07-20 | Paper |
| Coreness of cooperative games with truncated submodular profit functions | 2020-05-23 | Paper |
| On the optimality of tape merge of two lists with similar size | 2020-05-21 | Paper |
| On the modulo degree complexity of Boolean functions | 2020-04-07 | Paper |
| On the relationship between energy complexity and other Boolean function measures | 2020-02-24 | Paper |
| The one-round multi-player discrete Voronoi game on grids and trees | 2020-02-24 | Paper |
| Quantum Lovász local lemma: Shearer’s bound is tight | 2020-01-30 | Paper |
| The complexity of optimization on grids | 2019-08-20 | Paper |
| From independent sets and vertex colorings to isotropic spaces and isotropic decompositions | 2019-04-08 | Paper |
| A tighter relation between sensitivity complexity and certificate complexity | 2019-02-28 | Paper |
| Coreness of cooperative games with truncated submodular profit functions | 2018-11-08 | Paper |
| Path cooperative games | 2018-07-26 | Paper |
| On the Optimality of Tape Merge of Two Lists with Similar Size. | 2018-04-19 | Paper |
| On the Sensitivity Complexity of k-Uniform Hypergraph Properties | 2018-04-19 | Paper |
| On the Decision Tree Complexity of String Matching | 2017-12-27 | Paper |
| Partial sorting problem on evolving data | 2017-11-09 | Paper |
| On the modulo degree complexity of Boolean functions | 2017-10-23 | Paper |
| A tighter relation between sensitivity complexity and certificate complexity | 2017-10-23 | Paper |
| Tight Bounds for Graph Problems in Insertion Streams | 2017-08-31 | Paper |
| Space-bounded communication complexity | 2017-05-16 | Paper |
| The Routing of Complex Contagion in Kleinberg’s Small-World Networks | 2016-09-02 | Paper |
| How to Select the Top k Elements from Evolving Data? | 2016-01-11 | Paper |
| The Least-Core and Nucleolus of Path Cooperative Games | 2015-10-29 | Paper |
| On the Power of Parity Queries in Boolean Decision Trees | 2015-09-30 | Paper |
| Any monotone property of 3-uniform hypergraphs is weakly evasive | 2015-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934612 | 2014-12-18 | Paper |
| Tighter Relations between Sensitivity and Other Complexity Measures | 2014-07-01 | Paper |
| Determinantal Complexities and Field Extensions | 2014-01-14 | Paper |
| On a conjecture of Butler and Graham | 2013-09-24 | Paper |
| Streaming and Communication Complexity of Clique Approximation | 2013-08-12 | Paper |
| Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive | 2013-05-28 | Paper |
| Bounds and trade-offs for double-base number systems | 2013-03-28 | Paper |
| On the sensitivity complexity of bipartite graph properties | 2013-02-19 | Paper |
| Graph coloring applied to secure computation in non-abelian groups | 2013-01-04 | Paper |
| Stam’s Conjecture and Threshold Phenomena in Collision Resistance | 2012-09-25 | Paper |
| Randomized communication complexity for linear algebra problems over finite fields | 2012-08-23 | Paper |
| Space-Efficient Approximation Scheme for Circular Earth Mover Distance | 2012-06-29 | Paper |
| The relationship between inner product and counting cycles | 2012-06-29 | Paper |
| A New Variation of Hat Guessing Games | 2011-08-17 | Paper |
| An improved lower bound on the sensitivity complexity of graph properties | 2011-07-14 | Paper |
| A better upper bound on weights of exact threshold functions | 2011-07-01 | Paper |
| The complexity of word circuits | 2011-03-25 | Paper |
| Effect of clustering in the scale-free networks on cooperative behavior | 2011-02-05 | Paper |
| More efficient algorithms for closest string and substring problems | 2010-09-06 | Paper |
| Weights of exact threshold functions | 2010-09-03 | Paper |
| The complexity of word circuits | 2010-07-20 | Paper |
| Quantum separation of local search and fixed point computation | 2010-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3640540 | 2009-11-11 | Paper |
| On the quantum query complexity of local search in two and three dimensions | 2009-08-31 | Paper |
| The antimagicness of the Cartesian product of graphs | 2009-03-17 | Paper |
| A heuristic algorithm for three-dimensional container loading problem with non-identical items | 2009-03-06 | Paper |
| Graph Design for Secure Multiparty Computation over Non-Abelian Groups | 2009-02-10 | Paper |
| The existence of quantum entanglement catalysts | 2008-12-21 | Paper |
| GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM | 2008-08-26 | Paper |
| Quantum Separation of Local Search and Fixed Point Computation | 2008-07-10 | Paper |
| Searching monotone multi-dimensional arrays | 2008-04-28 | Paper |
| Block sensitivity of weakly symmetric functions | 2007-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755321 | 2007-08-20 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| On complexity of single-minded auction | 2005-02-23 | Paper |
| Performance evaluation for energy efficient topologic control in ad hoc wireless networks | 2005-01-11 | Paper |
| A 3-party simultaneous protocol for SUM-INDEX | 2003-08-19 | Paper |
| Universal and original-preserving quantum copying is impossible | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3488854 | 1989-01-01 | Paper |
