Person:313449

Available identifiers

zbMath Open bansal.nikhilWikidataQ102300787 ScholiaQ102300787MaRDI QIDQ313449

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126236	2024-04-09	Paper
Discrepancy theory and related algorithms	2024-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q6147427	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147437	2024-01-15	Paper
The power of two choices in graphical allocation	2023-12-08	Paper
Flow time scheduling and prefix Beck-Fiala	2023-12-08	Paper
k-forrelation optimally separates Quantum and classical query complexity	2023-11-14	Paper
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	2023-10-31	Paper
Competitive Algorithms for Generalized k -Server in Uniform Metrics	2023-10-23	Paper
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture	2023-10-17	Paper
A nearly tight lower bound for the \(d\)-dimensional cow-path problem	2023-06-05	Paper
Contention resolution, matrix scaling and fair allocation	2022-10-19	Paper
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank	2022-08-23	Paper
https://portal.mardi4nfdi.de/entity/Q5091067	2022-07-21	Paper
Smoothed Analysis of the Koml\'os Conjecture	2022-04-25	Paper
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms	2022-02-28	Paper
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines	2021-06-29	Paper
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems	2021-02-02	Paper
Online vector balancing and geometric discrepancy	2021-01-19	Paper
On‐line balancing of random inputs	2021-01-05	Paper
On the discrepancy of random low degree set systems	2020-11-30	Paper
New Developments in Iterated Rounding (Invited Talk)	2020-07-19	Paper
Nested convex bodies are chaseable	2020-04-14	Paper
Achievable Performance of Blind Policies in Heavy Traffic	2020-03-12	Paper
https://portal.mardi4nfdi.de/entity/Q5215668	2020-02-12	Paper
On a generalization of iterated and randomized rounding	2020-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q5204822	2019-12-05	Paper
The ( h,k )-Server Problem on Bounded Depth Trees	2019-11-25	Paper
On the discrepancy of random low degree set systems	2019-10-15	Paper
New tools and connections for exponential-time approximation	2019-09-10	Paper
The Gram-Schmidt walk: a cure for the Banaszczyk blues	2019-08-22	Paper
Improved Approximation Algorithm for Two-Dimensional Bin Packing	2019-06-20	Paper
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach	2019-06-20	Paper
On the number of matroids	2019-05-15	Paper
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound	2019-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q4633881	2019-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q4633882	2019-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q4633939	2019-05-06	Paper
Minimizing weighted flow time	2018-11-05	Paper
Better Scalable Algorithms for Broadcast Scheduling	2018-10-30	Paper
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems	2018-10-11	Paper
A Polylogarithmic-Competitive Algorithm for the k -Server Problem	2018-08-02	Paper
Improved Approximation for Vector Bin Packing	2018-07-16	Paper
The (h, k)-Server Problem on Bounded Depth Trees	2018-07-16	Paper
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs	2018-07-16	Paper
On the Lovász Theta Function for Independent Sets in Sparse Graphs	2018-07-04	Paper
Tight bounds for double coverage against weak adversaries	2018-04-12	Paper
https://portal.mardi4nfdi.de/entity/Q4607947	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607969	2018-03-15	Paper
Approximation-Friendly Discrepancy Rounding	2018-02-26	Paper
Tight approximation bounds for dominating set on graphs of bounded arboricity	2017-11-03	Paper
Approximating independent sets in sparse graphs	2017-10-05	Paper
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines	2017-09-29	Paper
The local-global conjecture for scheduling with non-linear cost	2017-09-01	Paper
Minimizing Maximum Flow-time on Related Machines	2017-08-31	Paper
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs	2017-08-31	Paper
Faster space-efficient algorithms for subset sum and k-sum	2017-08-17	Paper
Algorithmic discrepancy beyond partial coloring	2017-08-17	Paper
Weighted geometric set multi-cover via quasi-uniform sampling	2017-03-30	Paper
Approximating vector scheduling: almost matching upper and lower bounds	2016-12-21	Paper
https://portal.mardi4nfdi.de/entity/Q2830868	2016-11-01	Paper
On the number of matroids	2016-09-09	Paper
Approximation-Friendly Discrepancy Rounding	2016-08-10	Paper
Tight Bounds for Double Coverage Against Weak Adversaries	2016-02-26	Paper
On the adaptivity gap of stochastic orienteering	2015-12-09	Paper
Minimum congestion mapping in a cloud	2015-09-11	Paper
On the Lovász Theta function for Independent Sets in Sparse Graphs	2015-08-21	Paper
Minimizing Flow-Time on Unrelated Machines	2015-08-21	Paper
A logarithmic approximation for unsplittable flow on line graphs	2015-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q5501259	2015-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q5501310	2015-08-03	Paper
Algorithmic Aspects of Combinatorial Discrepancy	2015-07-24	Paper
Minimum Congestion Mapping in a Cloud	2015-06-24	Paper
Deterministic discrepancy minimization	2015-03-23	Paper
The Geometry of Scheduling	2015-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q2934659	2014-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q2934667	2014-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q2934715	2014-12-18	Paper
Speed Scaling with an Arbitrary Power Function	2014-12-05	Paper
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching	2014-12-02	Paper
The Santa Claus problem	2014-11-25	Paper
A quasi-PTAS for unsplittable flow on line graphs	2014-11-25	Paper
Dynamic pricing for impatient bidders	2014-11-18	Paper
An entropy argument for counting matroids	2014-10-22	Paper
https://portal.mardi4nfdi.de/entity/Q2921672	2014-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q2921673	2014-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q3191563	2014-10-06	Paper
Min-Max Graph Partitioning and Small Set Expansion	2014-07-30	Paper
A Polylogarithmic-Competitive Algorithm for the k-Server Problem	2014-07-30	Paper
Min-max Graph Partitioning and Small Set Expansion	2014-07-30	Paper
Optimal Long Code Test with One Free Bit	2014-07-25	Paper
Regularity Lemmas and Combinatorial Algorithms	2014-07-25	Paper
On the Adaptivity Gap of Stochastic Orienteering	2014-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q5417604	2014-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q5417729	2014-05-22	Paper
Tight time-space tradeoff for mutual exclusion	2014-05-13	Paper
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds	2014-03-31	Paper
Approximating Real-Time Scheduling on Identical Machines	2014-03-31	Paper
A Primal-Dual Randomized Algorithm for Weighted Paging	2014-02-17	Paper
On generalizations of network design problems with degree bounds	2013-11-11	Paper
A Harmonic Algorithm for the 3D Strip Packing Problem	2013-07-24	Paper
Multicast Routing for Energy Minimization Using Speed Scaling	2013-04-19	Paper
When LP is the cure for your matching woes: improved bounds for stochastic matchings	2012-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q2913804	2012-09-27	Paper
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling	2012-09-25	Paper
Randomized Competitive Algorithms for Generalized Caching	2012-08-10	Paper
On the number of matroids	2012-06-27	Paper
Deterministic Discrepancy Minimization	2011-09-16	Paper
On Capacitated Set Cover Problems	2011-08-17	Paper
Average rate speed scaling	2011-07-01	Paper
Shape rectangularization problems in intensity-modulated radiation therapy	2011-05-10	Paper
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service	2011-04-04	Paper
Competitive algorithms for due date scheduling	2011-03-30	Paper
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems	2010-09-07	Paper
Metrical Task Systems and the k-Server Problem on HSTs	2010-09-07	Paper
Better Scalable Algorithms for Broadcast Scheduling	2010-09-07	Paper
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing	2010-09-06	Paper
Speed Scaling for Weighted Flow Time	2010-09-06	Paper
Additive Guarantees for Degree-Bounded Directed Network Design	2010-09-06	Paper
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings	2010-09-06	Paper
Server scheduling in the L p norm	2010-08-16	Paper
Improved approximation algorithms for broadcast scheduling	2010-08-16	Paper
Approximation algorithms for deadline-TSP and vehicle routing with time-windows	2010-08-15	Paper
On generalizations of network design problems with degree bounds	2010-06-22	Paper
On k-Column Sparse Packing Programs	2010-06-22	Paper
Algorithms - ESA 2003	2010-03-03	Paper
On the longest common rigid subsequence problem	2010-02-23	Paper
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability	2009-12-17	Paper
Speed scaling with a solar cell	2009-11-04	Paper
https://portal.mardi4nfdi.de/entity/Q3181596	2009-10-12	Paper
Improved Approximation Algorithms for Broadcast Scheduling	2009-06-22	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
Robust reductions from ranking to classification	2009-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q5302102	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3549707	2009-01-05	Paper
Speed scaling to manage energy and temperature	2008-12-21	Paper
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching	2008-09-25	Paper
Scheduling for Speed Bounded Processors	2008-08-28	Paper
Speed Scaling with a Solar Cell	2008-07-10	Paper
Minimizing Makespan in No-Wait Job Shops	2008-05-27	Paper
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes	2008-05-27	Paper
Job Shop Scheduling with Unit Processing Times	2008-05-27	Paper
Average Rate Speed Scaling	2008-04-15	Paper
Two-dimensional bin packing with one-dimensional resource augmentation	2008-01-18	Paper
Robust Reductions from Ranking to Classification	2008-01-03	Paper
Competitive Algorithms for Due Date Scheduling	2007-11-28	Paper
Minimizing Setup and Beam-On Times in Radiation Therapy	2007-08-28	Paper
Finding submasses in weighted strings with fast Fourier transform	2007-04-18	Paper
Handling load with less stress	2006-11-17	Paper
STACS 2005	2005-12-02	Paper
Combinatorial Pattern Matching	2005-09-07	Paper
On the average sojourn time under \(M/M/1/\)SRPT	2005-08-25	Paper
Automata, Languages and Programming	2005-08-24	Paper
Minimizing flow time on a constant number of machines with preemption	2005-06-01	Paper
Correlation clustering	2005-01-19	Paper
Non-clairvoyant scheduling for minimizing mean slowdown	2004-11-05	Paper
https://portal.mardi4nfdi.de/entity/Q4473894	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4471337	2004-07-28	Paper
A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues	2004-07-01	Paper
Analysis of the M/G/1 processor-sharing queue with bulk arrivals	2003-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4418655	2003-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4511230	2001-10-30	Paper
On the number of matroids	0001-01-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nikhil Bansal