Ashish Goel
According to our database^{1},
Ashish Goel
authored at least 155 papers
between 1998 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at stanford.edu
On csauthors.net:
Bibliography
2020
Advertising for Demographically Fair Outcomes.
CoRR, 2020
Continuous Credit Networks and Layer 2 Blockchains: Monotonicity and Sampling.
CoRR, 2020
The impossibility of low rank representations for trianglerich complex networks.
CoRR, 2020
Liquidity in Credit Networks with Constrained Agents.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 2024, 2020, 2020
Satellite Navigation for the Age of Autonomy.
Proceedings of the IEEE/ION Position, Location and Navigation Symposium, 2020
2019
Knapsack Voting for Participatory Budgeting.
ACM Trans. Economics and Comput., 2019
Iterative Local Voting for Collective Decisionmaking in Continuous Spaces.
J. Artif. Intell. Res., 2019
A novel quadrilateral companding transform for PAPR reduction in OFDM systems.
Digit. Signal Process., 2019
Constrained Credit Networks.
CoRR, 2019
Who is in Your Top Three? Optimizing Learning in Elections with Many Candidates.
CoRR, 2019
Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs.
Combinatorica, 2019
Pruning based Distance Sketches with Provable Guarantees on Random Graphs.
Proceedings of the World Wide Web Conference, 2019
Markets Beyond Nash Welfare for Leontief Utilities.
Proceedings of the Web and Internet Economics  15th International Conference, 2019
Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice.
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
2018
Implementing the Lexicographic Maxmin Bargaining Solution.
Proceedings of the Web and Internet Economics  14th International Conference, 2018
Markets for Public DecisionMaking.
Proceedings of the Web and Internet Economics  14th International Conference, 2018
Relating Metric Distortion and Fairness of Social Choice Rules.
Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation, 2018
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 Decisionmaking 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 Perform. Evaluation Rev., 2016
Internet Economics [Guest editors' introduction].
IEEE Internet Comput., 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 LargeScale Deliberative DecisionMaking: 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 TwentyFifth International Joint Conference on Artificial Intelligence, 2016
2015
Strategic Formation of Credit Networks.
ACM Trans. Internet Techn., 2015
The WhoToFollow System at Twitter: Strategy, Algorithms, and Revenue Impact.
Interfaces, 2015
Bidirectional PageRank Estimation: From AverageCase to WorstCase.
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 TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
2014
Generalized M2M Mapping Scheme for SLM and PTS Based OFDM Systems Without SideInformation.
Wireless Personal Communications, 2014
Pricebased protocols for fair resource allocation: Convergence time analysis and extension to leontief utilities.
ACM Trans. Algorithms, 2014
Efficient PrimalDual 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 TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
Reincentivizing discovery: mechanisms for partialprogress sharing in research.
Proceedings of the ACM Conference on Economics and Computation, 2014
FASTPPR: 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
Biased assimilation, homophily, and the dynamics of polarization.
Proc. Natl. Acad. Sci. USA, 2013
Dimension independent similarity computation.
J. Mach. Learn. Res., 2013
SER analysis of PTS based techniques for PAPR reduction in OFDM systems.
Digit. Signal Process., 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 SingleSink BuyatBulk.
Theory Comput., 2012
Complexity Measures for MapReduce, and Comparison to Parallel Computing
CoRR, 2012
Single pass sparsification in the streaming model with edge deletions
CoRR, 2012
Partitioned multiindexing: 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 GameTheoretic 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 TwentyThird Annual ACMSIAM 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 ReadDisturbFree, Differential Sensing 1R/1W Port, 8T Bitcell Array.
IEEE Trans. Very Large Scale Integr. Syst., 2011
A renewable, modular, and timeresponsive DNA circuit.
Nat. Comput., 2011
Widescope  A social platform for serious conversations on the Web
CoRR, 2011
Memorybased embedded digital ATE.
Proceedings of the 29th IEEE VLSI Test Symposium, 2011
Improved Approximation Results for Stochastic Knapsack Problems.
Proceedings of the TwentySecond Annual ACMSIAM 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 (EC2011), 2011
Integrated Design & Test: Conquering the Conflicting Requirements of LowPower, VariationTolerance and Test Cost.
Proceedings of the 20th IEEE Asian Test Symposium, 2011
Two new phase sequence sets for PAPR reduction in SLMOFDM systems without side information.
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, 2011
2010
A Scalable CircuitArchitecture CoDesign to Improve Memory Yield for HighPerformance Processors.
IEEE Trans. Very Large Scale Integr. Syst., 2010
Design Paradigm for Robust SpinTorque Transfer Magnetic RAM (STT MRAM) From Circuit/Architecture Perspective.
IEEE Trans. Very Large Scale Integr. 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.
Proc. VLDB Endow., 2010
Advertisement allocation for generalized secondpricing schemes.
Oper. Res. Lett., 2010
Foreword.
Nat. Comput., 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
Pricing for Fairness: Distributed Resource Allocation for Multiple Objectives.
Algorithmica, 2010
Perfect matchings in o(n log n) time in regular bipartite graphs.
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
Accurate characterization of random process variations using a robust lowvoltage highsensitivity sensor featuring replicabias circuit.
Proceedings of the IEEE International SolidState Circuits Conference, 2010
Datadependant senseamplifier flipflop 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
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 ACMSIAM Symposium on Discrete Algorithms, 2009
An incentivebased architecture for social recommendations.
Proceedings of the 2009 ACM Conference on Recommender Systems, 2009
An Oblivious O(1)Approximation for Single Source BuyatBulk.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Renewable, TimeResponsive DNA Logic Gates for Scalable Digital Circuits.
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009
REad/accesspreferred (REAP) SRAM  architectureaware bit cell design for improved yield and lower VMIN.
Proceedings of the IEEE Custom Integrated Circuits Conference, 2009
An alternate design paradigm for robust spintorque transfer magnetic RAM (STT MRAM) from circuit/architecture perspective.
Proceedings of the 14th Asia South Pacific Design Automation Conference, 2009
2008
Toward minimum size selfassembled counters.
Nat. Comput., 2008
Dimension augmentation and combinatorial criteria for efficient errorresistant DNA selfassembly.
Proceedings of the Nineteenth Annual ACMSIAM 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 ACMSIAM 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
2006
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs.
Algorithmica, 2006
Truthful auctions for pricing search keywords.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC2006), 2006
Asking the right questions: modeldriven optimization using probes.
Proceedings of the TwentyFifth ACM SIGACTSIGMODSIGART 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
Lowoverhead design of softerrortolerant scan flipflops with enhancedscan capability.
Proceedings of the 2006 Conference on Asia South Pacific Design Automation: ASPDAC 2006, 2006
2005
Improving lookup latency in distributed hash table systems using random sampling.
IEEE/ACM Trans. Netw., 2005
Scalefree aggregation in sensor networks.
Theor. Comput. Sci., 2005
Approximate majorization and fair online load balancing.
ACM Trans. Algorithms, 2005
An online throughputcompetitive 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 BuyatBulk.
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
Lowstate 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 smallworld model to improve Freenet performance.
Comput. Networks, 2004
An empirical evaluation of internet latency expansion.
Computer Communication Review, 2004
Making EigenvectorBased Reputation Systems Robust to Collusion.
Proceedings of the Algorithms and Models for the WebGraph: 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
Multiprocessor scheduling to minimize flow time with epsilon resource augmentation.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Invadable selfassembly: combining robustness with efficiency.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Set kcover 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 Selfassembly 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
2003
Scheduling data transfers in a network and the set scheduling problem.
J. Algorithms, 2003
Incrementally improving lookup latency in distributed hash table systems.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 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
EnergyEfficient Broadcasting in Wireless ad hoc Networks Lower Bounds and Algorithms.
J. Interconnect. Networks, 2002
Oblivious AQM and nash equilibria.
Computer Communication Review, 2002
Extending Greedy Multicast Routing to Delay Sensitive Applications.
Algorithmica, 2002
Combinatorial optimization problems in selfassembly.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Faster Network Design with Scenario PreFiltering.
Proceedings of the 10th International Workshop on Modeling, 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 selfassembled 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
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 Delaysensitive Routes from One Source to All Destinations.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001
2000
Balancing Steiner trees and shortest path trees online.
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
1999
Matching output queueing with a combined input/outputqueued switch.
IEEE J. Sel. Areas Commun., 1999
Approximation Algorithms for Directed Steiner Problems.
J. Algorithms, 1999
Stochastic Load Balancing and Related Problems.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
1998
Perspectives on Optimistically Replicated, PeertoPeer Filing.
Softw. Pract. Exp., 1998
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and kMedian.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Online ThroughputCompetitive Algorithm for Multicast Routing and Admission Control.
Proceedings of the Ninth Annual ACMSIAM 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