The following pages link to Ashish Goel (Q222786):
Displaying 50 items.
- A renewable, modular, and time-responsive DNA circuit (Q537854) (← links)
- Advertisement allocation for generalized second-pricing schemes (Q614045) (← links)
- Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk (Q818824) (← links)
- Toward minimum size self-assembled counters (Q941685) (← links)
- Pricing for fairness: distributed resource allocation for multiple objectives (Q973022) (← links)
- Fair welfare maximization (Q1031840) (← links)
- Markets for public decision-making (Q2235098) (← links)
- Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs (Q2322505) (← links)
- Monotone properties of random geometric graphs have sharp thresholds (Q2496499) (← links)
- Simultaneous optimization via approximate majorization for concave profits or convex costs (Q2498404) (← links)
- Scale-free aggregation in sensor networks (Q2575090) (← links)
- Counteracting inequality in markets via convex pricing (Q2692269) (← links)
- Stability of networks and protocols in the adversarial queueing model for packet routing (Q2744656) (← links)
- Approximate majorization and fair online load balancing (Q2768323) (← links)
- Distributed admission control, scheduling, and routing with stale information (Q2768355) (← links)
- Reductions among high dimensional proximity problems (Q2768379) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q2819545) (← links)
- Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (Q2848226) (← links)
- Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs (Q2875130) (← links)
- A Game-Theoretic Model of Attention in Social Networks (Q2900587) (← links)
- One tree suffices: a simultaneous \(O(1)\)-approximation for single-sink buy-at-bulk (Q2913815) (← links)
- Perfect matchings via uniform sampling in regular bipartite graphs (Q2930303) (← links)
- Pricing for fairness (Q2931384) (← links)
- (Q2933859) (← links)
- (Q2934623) (← links)
- Approximate majorization and fair online load balancing (Q2944501) (← links)
- Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274) (← links)
- The Core of the Participatory Budgeting Problem (Q2959845) (← links)
- Iterative Local Voting for Collective Decision-making in Continuous Spaces (Q3120424) (← links)
- How to probe for an extreme value (Q3188994) (← links)
- Combining fairness with throughput (Q3192040) (← links)
- A Note on Modeling Retweet Cascades on Twitter (Q3460744) (← links)
- Bidirectional PageRank Estimation: From Average-Case to Worst-Case (Q3460747) (← links)
- Combinatorial optimization problems in self-assembly (Q3579174) (← links)
- (Q3579434) (← links)
- (Q3579484) (← links)
- Multi-processor scheduling to minimize flow time with ε resource augmentation (Q3580981) (← links)
- Sharp thresholds For monotone properties in random geometric graphs (Q3581011) (← links)
- Embedding Bounded Bandwidth Graphs into ℓ1 (Q3613746) (← links)
- (Q4250170) (← links)
- (Q4250182) (← links)
- (Q4252405) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q4458883) (← links)
- (Q4471335) (← links)
- (Q4542528) (← links)
- Sequential Deliberation for Social Choice (Q4614068) (← links)
- (Q4633805) (← links)
- (Q4633807) (← links)
- Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model (Q4651537) (← links)
- (Q4664413) (← links)
