# Ashish Goel

According to our database

Collaborative distances:

^{1}, Ashish Goel authored at least 185 papers between 1998 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

Relating Metric Distortion and Fairness of Social Choice Rules.

CoRR, 2018

Implementing the Lexicographic Maxmin Bargaining Solution.

CoRR, 2018

Markets for Public Decision-making.

CoRR, 2018

Markets Beyond Nash Welfare for Leontief Utilities.

CoRR, 2018

2017

Sequential Deliberation for Social Choice.

CoRR, 2017

When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors.

CoRR, 2017

Collaborative Optimization for Collective Decision-making in Continuous Spaces.

CoRR, 2017

When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors.

Proceedings of the 26th International Conference on World Wide Web, 2017

Collaborative Optimization for Collective Decision-making in Continuous Spaces.

Proceedings of the 26th International Conference on World Wide Web, 2017

Sequential Deliberation for Social Choice.

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Network Formation of Coalition Loyalty Programs.

SIGMETRICS Performance Evaluation Review, 2016

Internet Economics [Guest editors' introduction].

IEEE Internet Computing, 2016

Approximate Personalized PageRank on Dynamic Graphs.

CoRR, 2016

Re-incentivizing Discovery: Mechanisms for Partial-Progress Sharing in Research.

CoRR, 2016

Towards large-scale deliberative decision-making: small groups and the importance of triads.

CoRR, 2016

Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties.

CoRR, 2016

The Core of the Participatory Budgeting Problem.

CoRR, 2016

Personalized PageRank Estimation and Search: A Bidirectional Approach.

Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, 2016

The Core of the Participatory Budgeting Problem.

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Towards Large-Scale Deliberative Decision-Making: Small Groups and the Importance of Triads.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Approximate Personalized PageRank on Dynamic Graphs.

Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Probabilistic Matrix Inspection and Group Scheduling.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Strategic Formation of Credit Networks.

ACM Trans. Internet Techn., 2015

The Who-To-Follow System at Twitter: Strategy, Algorithms, and Revenue Impact.

Interfaces, 2015

Bidirectional PageRank Estimation: From Average-Case to Worst-Case.

CoRR, 2015

Personalized PageRank Estimation and Search: A Bidirectional Approach.

CoRR, 2015

Bidirectional PageRank Estimation: From Average-Case to Worst-Case.

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

A Note on Modeling Retweet Cascades on Twitter.

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Connectivity in Random Forests and Credit Networks.

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Generalized M-2M Mapping Scheme for SLM and PTS Based OFDM Systems Without Side-Information.

Wireless Personal Communications, 2014

Price-based protocols for fair resource allocation: Convergence time analysis and extension to leontief utilities.

ACM Trans. Algorithms, 2014

FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs.

CoRR, 2014

Crowdsourcing for Participatory Democracies: Efficient Elicitation of Social Choice Functions.

CoRR, 2014

Efficient Primal-Dual Graph Algorithms for MapReduce.

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

Disjoint Set Union with Randomized Linking.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Re-incentivizing discovery: mechanisms for partial-progress sharing in research.

Proceedings of the ACM Conference on Economics and Computation, 2014

FAST-PPR: scaling personalized pagerank estimation for large graphs.

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Crowdsourcing for Participatory Democracies: Efficient Elicitation of Social Choice Functions.

Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

2013

Joint ICI Cancellation and PAPR Reduction in OFDM Systems Without Side Information.

Wireless Personal Communications, 2013

Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs.

SIAM J. Comput., 2013

Dimension independent similarity computation.

Journal of Machine Learning Research, 2013

SER analysis of PTS based techniques for PAPR reduction in OFDM systems.

Digital Signal Processing, 2013

Personalized PageRank to a Target Node

CoRR, 2013

WTF: the who to follow service at Twitter.

Proceedings of the 22nd International World Wide Web Conference, 2013

On the precision of social and information networks.

Proceedings of the Conference on Online Social Networks, 2013

2012

One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk.

Theory of Computing, 2012

Complexity Measures for Map-Reduce, and Comparison to Parallel Computing

CoRR, 2012

Efficient Distributed Locality Sensitive Hashing

CoRR, 2012

Triadic Consensus: A Randomized Algorithm for Voting in a Crowd

CoRR, 2012

Biased Assimilation, Homophily and the Dynamics of Polarization

CoRR, 2012

Dimension Independent Similarity Computation

CoRR, 2012

Single pass sparsification in the streaming model with edge deletions

CoRR, 2012

Strategic formation of credit networks.

Proceedings of the 21st World Wide Web Conference 2012, 2012

Partitioned multi-indexing: bringing order to social search.

Proceedings of the 21st World Wide Web Conference 2012, 2012

Optimized data allocation & combining scheme for ICI self cancellation in OFDM systems.

Proceedings of the Ninth International Conference on Wireless and Optical Communications Networks, 2012

Triadic Consensus - A Randomized Algorithm for Voting in a Crowd.

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Biased Assimilation, Homophily, and the Dynamics of Polarization - (Working Paper).

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

A Game-Theoretic Model of Attention in Social Networks.

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

HBIST: An approach towards zero external test cost.

Proceedings of the 30th IEEE VLSI Test Symposium, 2012

On the communication and streaming complexity of maximum bipartite matching.

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Efficient distributed locality sensitive hashing.

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

A Read-Disturb-Free, Differential Sensing 1R/1W Port, 8T Bitcell Array.

IEEE Trans. VLSI Syst., 2011

A renewable, modular, and time-responsive DNA circuit.

Natural Computing, 2011

Widescope - A social platform for serious conversations on the Web

CoRR, 2011

Memory-based embedded digital ATE.

Proceedings of the 29th IEEE VLSI Test Symposium, 2011

Improved Approximation Results for Stochastic Knapsack Problems.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Liquidity in credit networks: a little trust goes a long way.

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Integrated Design & Test: Conquering the Conflicting Requirements of Low-Power, Variation-Tolerance and Test Cost.

Proceedings of the 20th IEEE Asian Test Symposium, 2011

Two new phase sequence sets for PAPR reduction in SLM-OFDM systems without side information.

Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, 2011

2010

A Scalable Circuit-Architecture Co-Design to Improve Memory Yield for High-Performance Processors.

IEEE Trans. VLSI Syst., 2010

Design Paradigm for Robust Spin-Torque Transfer Magnetic RAM (STT MRAM) From Circuit/Architecture Perspective.

IEEE Trans. VLSI Syst., 2010

Perfect matchings via uniform sampling in regular bipartite graphs.

ACM Trans. Algorithms, 2010

How to probe for an extreme value.

ACM Trans. Algorithms, 2010

Fast Incremental and Personalized PageRank.

PVLDB, 2010

Advertisement allocation for generalized second-pricing schemes.

Oper. Res. Lett., 2010

Foreword.

Natural Computing, 2010

Liquidity in Credit Networks: A Little Trust Goes a Long Way

CoRR, 2010

Similarity Search and Locality Sensitive Hashing using TCAMs

CoRR, 2010

Fast Incremental and Personalized PageRank over Distributed Main Memory Databases

CoRR, 2010

Graph Sparsification via Refinement Sampling

CoRR, 2010

One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk

CoRR, 2010

Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives.

Algorithmica, 2010

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Similarity search and locality sensitive hashing using ternary content addressable memories.

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Small subset queries and bloom filters using ternary associative memories, with applications.

Proceedings of the SIGMETRICS 2010, 2010

Liquidity in Credit Networks: A Little Trust Goes a Long Way.

Proceedings of the 2010 Workshop on the Economics of Networks, Systems, and Computation, 2010

Accurate characterization of random process variations using a robust low-voltage high-sensitivity sensor featuring replica-bias circuit.

Proceedings of the IEEE International Solid-State Circuits Conference, 2010

One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk.

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Data-dependant sense-amplifier flip-flop for low power applications.

Proceedings of the IEEE Custom Integrated Circuits Conference, 2010

2009

Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs

CoRR, 2009

An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk

CoRR, 2009

Perfect Matchings in Õ(n

^{1.5}) Time in Regular Bipartite Graphs
CoRR, 2009

Hybrid keyword search auctions.

Proceedings of the 18th International Conference on World Wide Web, 2009

The ratio index for budgeted learning, with applications.

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Perfect matchings via uniform sampling in regular bipartite graphs.

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

An incentive-based architecture for social recommendations.

Proceedings of the 2009 ACM Conference on Recommender Systems, 2009

An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk.

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Renewable, Time-Responsive DNA Logic Gates for Scalable Digital Circuits.

Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

REad/access-preferred (REAP) SRAM - architecture-aware bit cell design for improved yield and lower VMIN.

Proceedings of the IEEE Custom Integrated Circuits Conference, 2009

An alternate design paradigm for robust spin-torque transfer magnetic RAM (STT MRAM) from circuit/architecture perspective.

Proceedings of the 14th Asia South Pacific Design Automation Conference, 2009

2008

Toward minimum size self-assembled counters.

Natural Computing, 2008

Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs

CoRR, 2008

Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families

CoRR, 2008

Hybrid Keyword Search Auctions

CoRR, 2008

Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Obtaining High Throughput in Networks with Tiny Buffers.

Proceedings of the 16th International Workshop on Quality of Service, 2008

On the Network Coding Advantage for Wireless Multicast in Euclidean Space.

Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

Reducing Maximum Stretch in Compact Routing.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Modeling and Circuit Synthesis for Independently Controlled Double Gate FinFET Devices.

IEEE Trans. on CAD of Integrated Circuits and Systems, 2007

Algorithms and incentives for robust ranking.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Efficient, Fully Local Algorithms for CIOQ Switches.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Toward Minimum Size Self-Assembled Counters.

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006

Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs.

Algorithmica, 2006

Pricing for fairness: distributed resource allocation for multiple objectives.

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Truthful auctions for pricing search keywords.

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Asking the right questions: model-driven optimization using probes.

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Routers with Very Small Buffers.

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Embedding Bounded Bandwidth Graphs into l

_{1}.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Low-overhead design of soft-error-tolerant scan flip-flops with enhanced-scan capability.

Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASP-DAC 2006, 2006

2005

Improving lookup latency in distributed hash table systems using random sampling.

IEEE/ACM Trans. Netw., 2005

Scale-free aggregation in sensor networks.

Theor. Comput. Sci., 2005

Approximate majorization and fair online load balancing.

ACM Trans. Algorithms, 2005

An online throughput-competitive algorithm for multicast routing and admission control.

J. Algorithms, 2005

Source routing and scheduling in packet networks.

J. ACM, 2005

Part III: routers with very small buffers.

Computer Communication Review, 2005

Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk.

Algorithmica, 2005

Delay efficient sleep scheduling in wireless sensor networks.

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Low-state fairness: lower bounds and practical enforcement.

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004

Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model.

SIAM J. Comput., 2004

Using the small-world model to improve Freenet performance.

Computer Networks, 2004

An empirical evaluation of internet latency expansion.

Computer Communication Review, 2004

Making Eigenvector-Based Reputation Systems Robust to Collusion.

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

Sharp thresholds For monotone properties in random geometric graphs.

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Multi-processor scheduling to minimize flow time with epsilon resource augmentation.

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Invadable self-assembly: combining robustness with efficiency.

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Set k-cover algorithms for energy efficient monitoring in wireless sensor networks.

Proceedings of the Third International Symposium on Information Processing in Sensor Networks, 2004

Towards Protocol Equilibrium with Oblivious Routers.

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families.

Proceedings of the Algorithms, 2004

Error Free Self-assembly Using Error Prone Tiles.

Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Aggregating Correlated Data in Sensor Networks.

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives.

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

Scale Free Aggregation in Sensor Networks.

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

2003

Scheduling data transfers in a network and the set scheduling problem.

J. Algorithms, 2003

Sharp thresholds for monotone properties in random geometric graphs

CoRR, 2003

Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks

CoRR, 2003

Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Incrementally improving lookup latency in distributed hash table systems.

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

Oblivious AQM and Nash Equilibria.

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model.

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

Energy-Efficient Broadcasting in Wireless ad hoc Networks Lower Bounds and Algorithms.

Journal of Interconnection Networks, 2002

Source Routing and Scheduling in Packet Networks

CoRR, 2002

Using the small-world model to improve freenet performance.

Computer Communication Review, 2002

Oblivious AQM and nash equilibria.

Computer Communication Review, 2002

Extending Greedy Multicast Routing to Delay Sensitive Applications.

Algorithmica, 2002

Combinatorial optimization problems in self-assembly.

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Faster Network Design with Scenario Pre-Filtering.

Proceedings of the 10th International Workshop on Modeling, 2002

Using the Small-World Model to Improve Freenet Performance.

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Exact sampling of TCP Window States.

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks.

Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

DiffServ node with join minimum cost queue policy: analysis with multiclass traffic.

Proceedings of the Global Telecommunications Conference, 2002

2001

Stability of networks and protocols in the adversarial queueing model for packet routing.

Networks, 2001

Combining Fairness with Throughput: Online Routing with Multiple Objectives.

J. Comput. Syst. Sci., 2001

Running time and program size for self-assembled squares.

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Distributed admission control, scheduling, and routing with stale information.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximate majorization and fair online load balancing.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Reductions among high dimensional proximity problems.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Using approximate majorization to characterize protocol fairness.

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

Exact Sampling in Machine Scheduling Problems.

Proceedings of the Approximation, 2001

Efficient Computation of Delay-sensitive Routes from One Source to All Destinations.

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Source Routing and Scheduling in Packet Networks.

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Combining fairness with throughput: online routing with multiple objectives.

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Balancing Steiner trees and shortest path trees online.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Matching output queueing with a combined input/output-queued switch.

IEEE Journal on Selected Areas in Communications, 1999

Approximation Algorithms for Directed Steiner Problems.

J. Algorithms, 1999

Scheduling Data Transfers in a Network and the Set Scheduling Problem.

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Matching Output Queueing with a Combined Input Output Queued Switch.

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Stochastic Load Balancing and Related Problems.

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

Perspectives on Optimistically Replicated, Peer-to-Peer Filing.

Softw., Pract. Exper., 1998

Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and

*k*-Median.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximation Algorithms for Directed Steiner Problems.

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximating a Finite Metric by a Small Number of Tree Metrics.

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998