| Publication | Date of Publication | Type |
|---|
| Improving the bounds of the online dynamic power management problem | 2024-09-11 | Paper |
| Tight competitive analyses of online car-sharing problems | 2024-01-15 | Paper |
Approximation of coNP sets by NP-complete sets
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Marriage and Roommate
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
Small Complexity Gaps for Comparison-Based Sorting
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
| Finding dense subgraphs | 2023-03-21 | Paper |
Greedily finding a dense subgraph
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Tight competitive analyses of online car-sharing problems
Theoretical Computer Science | 2022-10-24 | Paper |
Bounded Hanoi
The American Mathematical Monthly | 2022-04-22 | Paper |
| Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing | 2021-12-20 | Paper |
Improved average complexity for comparison-based sorting
Theoretical Computer Science | 2020-01-22 | Paper |
Read-Once Branching Programs for Tree Evaluation Problems
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Parameterized testability
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Averaging techniques for competitive auctions
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Improving man-optimal stable matchings by minimum change of preference lists
Algorithms | 2019-03-26 | Paper |
Correction to: ``Pareto optimization or cascaded weighted sum: a comparison of concepts
Algorithms | 2019-03-26 | Paper |
Randomized competitive analysis for two server problems
Algorithms | 2018-08-20 | Paper |
Online knapsack with resource augmentation
Information Processing Letters | 2017-11-03 | Paper |
| Total stability in stable matching games | 2017-10-17 | Paper |
Improved average complexity for comparison-based sorting
Lecture Notes in Computer Science | 2017-09-22 | Paper |
| A tight approximation bound for the stable marriage problem with restricted ties | 2017-08-31 | Paper |
Parameterized testability
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
Algorithmica | 2017-05-17 | Paper |
| Read-once branching programs for tree evaluation problems | 2017-03-03 | Paper |
Quantum query complexity of almost all functions with fixed on-set size
Computational Complexity | 2016-11-30 | Paper |
Undecidability on quantum finite automata
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Approximate strip packing: revisited
Information and Computation | 2016-07-07 | Paper |
A faster parallel algorithm for \(k\)-connectivity
Information Processing Letters | 2016-05-26 | Paper |
The hospitals/residents problem with lower quotas
Algorithmica | 2016-03-23 | Paper |
| scientific article; zbMATH DE number 6469161 (Why is no real title available?) | 2015-08-03 | Paper |
Online bin packing with \((1,1)\) and \((2,R)\) bins
Journal of Combinatorial Optimization | 2015-07-28 | Paper |
| Harmonic algorithm for \(3\)-dimensional strip packing problem | 2014-12-18 | Paper |
| A \(1.875\)-approximation algorithm for the stable marriage problem | 2014-12-18 | Paper |
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Approximating vertex cover on dense graphs | 2014-10-13 | Paper |
Approximation algorithms for the sex-equal stable marriage problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Reputation games for undirected graphs
Discrete Applied Mathematics | 2014-02-18 | Paper |
The Train Delivery Problem Revisited
Algorithms and Computation | 2014-01-14 | Paper |
Online Bin Packing with (1,1) and (2,R) Bins
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
A harmonic algorithm for the 3D strip packing problem
SIAM Journal on Computing | 2013-07-24 | Paper |
Recovering strings in oracles: quantum and classic
Developments in Language Theory | 2012-11-02 | Paper |
Quantum counterfeit coin problems
Theoretical Computer Science | 2012-10-11 | Paper |
Improved approximation bounds for the student-project allocation problem with preferences over projects
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Reconstructing strings from substrings with quantum queries
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Verifying Nash equilibria in PageRank games on undirected web graphs
Algorithms and Computation | 2011-12-16 | Paper |
The Hospitals/Residents Problem with Quota Lower Bounds
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Improved approximation bounds for the student-project allocation problem with preferences over projects
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Quantum sampling for balanced allocations
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Randomized approximation of the stable marriage problem
Lecture Notes in Computer Science | 2011-03-18 | Paper |
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science | 2011-02-21 | Paper |
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Improved randomized algorithms for 3-SAT
Algorithms and Computation | 2010-12-09 | Paper |
Quantum counterfeit coin problems
Algorithms and Computation | 2010-12-09 | Paper |
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties
Algorithms – ESA 2010 | 2010-09-06 | Paper |
An improved approximation lower bound for finding almost stable maximum matchings
Information Processing Letters | 2010-08-20 | Paper |
Improved approximation results for the stable marriage problem
ACM Transactions on Algorithms | 2010-08-14 | Paper |
Online chasing problems for regular polygons
Information Processing Letters | 2010-06-09 | Paper |
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science | 2010-03-09 | Paper |
Improved approximation of the stable marriage problem
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Compact routing for flat networks
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Quantum lower bounds for the Goldreich-Levin problem
Information Processing Letters | 2009-12-18 | Paper |
| scientific article; zbMATH DE number 5604103 (Why is no real title available?) | 2009-09-15 | Paper |
Drawing borders efficiently
Theory of Computing Systems | 2009-08-06 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
The orthogonal CNN problem
Information Processing Letters | 2009-07-21 | Paper |
Quantum Queries on Permutations with a Promise
Implementation and Application of Automata | 2009-07-09 | Paper |
Negation-limited complexity of parity and inverters
Algorithmica | 2009-06-22 | Paper |
Inclusion-exclusion for \(k\)-CNF formulas
Information Processing Letters | 2009-04-28 | Paper |
An Improved Exact Algorithm for Cubic Graph TSP
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Properties of Symmetric Incentive Compatible Auctions
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Optimal Resource Augmentations for Online Knapsack
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Quantum Query Complexity of Boolean Functions with Small On-Sets
Algorithms and Computation | 2009-01-29 | Paper |
Reductions for monotone Boolean circuits
Theoretical Computer Science | 2008-12-12 | Paper |
Randomized Competitive Analysis for Two-Server Problems
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Polynomial-Time Construction of Linear Network Coding
Automata, Languages and Programming | 2008-08-28 | Paper |
Average-Case Competitive Analyses for One-Way Trading
Lecture Notes in Computer Science | 2008-07-10 | Paper |
A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
Algorithmica | 2008-07-01 | Paper |
Online removable square packing
Theory of Computing Systems | 2008-06-06 | Paper |
Unbounded-Error Classical and Quantum Communication Complexity
Algorithms and Computation | 2008-05-27 | Paper |
Finite-State Online Algorithms and Their Automated Competitive Analysis
Algorithms and Computation | 2008-04-24 | Paper |
Negation-Limited Complexity of Parity and Inverters
Algorithms and Computation | 2008-04-24 | Paper |
Max-stretch reduction for tree spanners
Algorithmica | 2008-04-03 | Paper |
A Randomized Algorithm for Two Servers in Cross Polytope Spaces
Approximation and Online Algorithms | 2008-02-20 | Paper |
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Strip Packing vs. Bin Packing
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Unbounded-Error One-Way Classical and Quantum Communication Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
Drawing Borders Efficiently
Lecture Notes in Computer Science | 2007-11-15 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Improved Algorithms for Quantum Identification of Boolean Oracles
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Reductions for Monotone Boolean Circuits
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Quantum Network Coding
STACS 2007 | 2007-09-03 | Paper |
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics | 2007-08-23 | Paper |
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science | 2007-06-06 | Paper |
| Query complexity of quantum biased oracles | 2007-05-09 | Paper |
| Quantum identification of Boolean oracles | 2007-05-09 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Density condensation of Boolean formulas
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Parallelizing local search for CNF satisfiability using vectorization and PVM
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Average-case competitive analyses for ski-rental problems
Algorithmica | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2163026 (Why is no real title available?) | 2005-04-29 | Paper |
Single backup table schemes for shortest-path routing
Theoretical Computer Science | 2005-04-06 | Paper |
Avoiding routing loops on the internet
Theory of Computing Systems | 2005-02-11 | Paper |
Randomized approximation of the stable marriage problem
Theoretical Computer Science | 2004-10-27 | Paper |
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
Journal of Parallel and Distributed Computing | 2004-10-04 | Paper |
A new quantum claw-finding algorithm for three functions
New Generation Computing | 2004-09-22 | Paper |
Transformation rules for CNOT-based quantum circuits and their applications
New Generation Computing | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086630 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086256 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080247 (Why is no real title available?) | 2004-08-04 | Paper |
Approximability results for stable marriage problems with ties.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1222598 (Why is no real title available?) | 2004-03-09 | Paper |
| scientific article; zbMATH DE number 2013801 (Why is no real title available?) | 2003-12-07 | Paper |
scientific article; zbMATH DE number 2013801 (Why is no real title available?)
(available as arXiv preprint) | 2003-12-07 | Paper |
| scientific article; zbMATH DE number 1979523 (Why is no real title available?) | 2003-09-14 | Paper |
A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
Theoretical Computer Science | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1929951 (Why is no real title available?) | 2003-06-18 | Paper |
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
Acta Mathematicae Applicatae Sinica. English Series | 2003-03-17 | Paper |
Online independent sets.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1848397 (Why is no real title available?) | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1796950 (Why is no real title available?) | 2002-09-05 | Paper |
Complexity of finding dense subgraphs
Discrete Applied Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1789201 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1788705 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1788718 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1696636 (Why is no real title available?) | 2002-07-22 | Paper |
Hard variants of stable marriage.
Theoretical Computer Science | 2002-07-15 | Paper |
An \(O(\sqrt N)\) oblivious routing algorithm for two-dimensional meshes of constant queue-size
Journal of Algorithms | 2002-07-08 | Paper |
| scientific article; zbMATH DE number 1759430 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1741112 (Why is no real title available?) | 2002-05-15 | Paper |
New bounds for oblivious mesh routing
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
A lower bound for elementary oblivious routing on three-dimensional meshes
Journal of Algorithms | 2001-12-12 | Paper |
On the approximability of the stable marriage problem
RIMS Kokyuroku | 2001-09-17 | Paper |
Efficient randomized routing algorithms on the two-dimensional mesh of buses
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1568063 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1555967 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1522926 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1511685 (Why is no real title available?) | 2000-09-27 | Paper |
Greedily Finding a Dense Subgraph
Journal of Algorithms | 2000-08-28 | Paper |
Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
Theoretical Computer Science | 2000-06-04 | Paper |
Oblivious routing algorithms on the mesh of buses
Journal of Parallel and Distributed Computing | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1305438 (Why is no real title available?) | 2000-04-13 | Paper |
| scientific article; zbMATH DE number 1405659 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1404230 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1404241 (Why is no real title available?) | 2000-02-20 | Paper |
| A representation method of assembly tasks for dealing with uncertainty | 2000-02-14 | Paper |
| scientific article; zbMATH DE number 1398072 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398074 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398100 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398101 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1398105 (Why is no real title available?) | 2000-02-03 | Paper |
| scientific article; zbMATH DE number 1361489 (Why is no real title available?) | 2000-02-01 | Paper |
| scientific article; zbMATH DE number 1379127 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1372650 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1372662 (Why is no real title available?) | 1999-12-01 | Paper |
| scientific article; zbMATH DE number 1322322 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1322310 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1222593 (Why is no real title available?) | 1999-08-31 | Paper |
| scientific article; zbMATH DE number 1222837 (Why is no real title available?) | 1998-11-11 | Paper |
| scientific article; zbMATH DE number 1113997 (Why is no real title available?) | 1998-10-01 | Paper |
A canonical form of vector machines
Information and Computation | 1998-09-01 | Paper |
Better approximations of non-Hamiltonian graphs
Discrete Applied Mathematics | 1998-06-02 | Paper |
Exponential lower bounds for the tree-like Hajós calculus
Information Processing Letters | 1997-02-28 | Paper |
Time lower bounds do not exist for CRCW PRAMs
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 956856 (Why is no real title available?) | 1996-12-11 | Paper |
Routing Problems on the Mesh of Buses
Journal of Algorithms | 1996-09-16 | Paper |
Routing Problems on the Mesh of Buses
Journal of Algorithms | 1996-08-21 | Paper |
A Simpler Parallel Algorithm for Graph Connectivity
Journal of Algorithms | 1994-10-19 | Paper |
${\text{ASPACE}}(o(\log \log n))$ is Regular
SIAM Journal on Computing | 1993-05-16 | Paper |
CNF-Satisfiability Test by Counting and Polynomial Average Time
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4049072 (Why is no real title available?) | 1987-01-01 | Paper |
The universe problem for unrestricted flow languages
Acta Informatica | 1983-01-01 | Paper |
