The following pages link to Kazuo Iwama (Q261377):
Displaying 50 items.
- (Q198582) (redirect page) (← links)
- The hospitals/residents problem with lower quotas (Q261379) (← links)
- A faster parallel algorithm for \(k\)-connectivity (Q287014) (← links)
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Average-case competitive analyses for one-way trading (Q626450) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
- Quantum counterfeit coin problems (Q714865) (← links)
- Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing (Q826097) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Online removable square packing (Q927402) (← links)
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem (Q930600) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Online chasing problems for regular polygons (Q975435) (← links)
- An improved approximation lower bound for finding almost stable maximum matchings (Q989570) (← links)
- Inclusion-exclusion for \(k\)-CNF formulas (Q1014406) (← links)
- Negation-limited complexity of parity and inverters (Q1022345) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- The universe problem for unrestricted flow languages (Q1165586) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- A canonical form of vector machines (Q1383713) (← links)
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- Improving man-optimal stable matchings by minimum change of preference lists (Q1736562) (← links)
- Correction to: ``Pareto optimization or cascaded weighted sum: a comparison of concepts'' (Q1736611) (← links)
- Avoiding routing loops on the internet (Q1762992) (← links)
- Single backup table schemes for shortest-path routing (Q1770371) (← links)
- Average-case competitive analyses for ski-rental problems (Q1777282) (← links)
- Online independent sets. (Q1853575) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- Transformation rules for CNOT-based quantum circuits and their applications (Q1880336) (← links)
- A new quantum claw-finding algorithm for three functions (Q1880337) (← links)
- Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs (Q1881272) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Oblivious routing algorithms on the mesh of buses (Q1974679) (← links)
- Tight competitive analyses of online car-sharing problems (Q2089695) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Drawing borders efficiently (Q2272197) (← links)
- Online bin packing with \((1,1)\) and \((2,R)\) bins (Q2355985) (← links)
- The orthogonal CNN problem (Q2390236) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
