The following pages link to Xiaotie Deng (Q221890):
Displaying 50 items.
- (Q197358) (redirect page) (← links)
- On revenue maximization with sharp multi-unit demands (Q266046) (← links)
- Equiseparability on terminal Wiener index (Q427678) (← links)
- Multi-bidding strategy in sponsored search auctions (Q431926) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs (Q598473) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- A lower bound for communication on the crossbar (Q672740) (← links)
- Server problems and resistive spaces (Q751278) (← links)
- On Bayesian epistemology of Myerson auction (Q777293) (← links)
- Condorcet winners for public goods (Q816518) (← links)
- Computation of arbitrage in frictional bond markets (Q860869) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- A new numerical method an American option pricing (Q865981) (← links)
- Implicit-degrees and circumferences (Q913815) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- (Q946328) (redirect page) (← links)
- Optimal dynamic portfolio selection with earnings-at-risk (Q946329) (← links)
- Arbitrage opportunities across sponsored search markets (Q954989) (← links)
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- Two-factor mutual authentication based on smart cards and passwords (Q955348) (← links)
- The computation of approximate competitive equilibrium is PPAD-hard (Q975493) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- A simplicial approach for discrete fixed point theorems (Q1014795) (← links)
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- On the complexity of market equilibria with maximum social welfare (Q1044745) (← links)
- A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors (Q1125809) (← links)
- More powerful closure operations on graphs (Q1174165) (← links)
- Distributed near-optimal matching (Q1375630) (← links)
- On multiprocessor system scheduling (Q1383800) (← links)
- A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers (Q1384686) (← links)
- Approximate sequencing for variable length tasks. (Q1401212) (← links)
- On computational complexity of membership test in flow games and linear production games (Q1414436) (← links)
- Approximation algorithms in batch processing (Q1417850) (← links)
- Portfolio selection theory with different interest rates for borrowing and lending (Q1424962) (← links)
- Solution to a problem on degree sequences of graphs (Q1567678) (← links)
- Totally balanced combinatorial optimization games (Q1575068) (← links)
- Graph algorithms with small communication costs (Q1587586) (← links)
- Recent studies of agent incentives in internet resource allocation and pricing (Q1728405) (← links)
- Network pollution games (Q1755784) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- On-line scheduling a batch processing system to minimize total weighted job completion time (Q1768601) (← links)
- A PTAS for semiconductor burn-in scheduling (Q1774521) (← links)
- A minimax portfolio selection strategy with equilibrium (Q1779559) (← links)
- Center and distinguisher for strings with unbounded alphabet (Q1810861) (← links)
- Total balancedness condition for Steiner tree games. (Q1811075) (← links)
- Symmetric duality for a class of multiobjective fractional programming problems. (Q1856854) (← links)
- Minimizing mean completion time in a batch processing system (Q1879250) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
