FOCS 2007 - PDF Preprint Papers

FOCS 2007 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2007 Paper

click to vote

FOCS
2007
IEEE

181views Theoretical Computer Science» more FOCS 2007»

Minimizing Average Flow-time : Upper and Lower Bounds

14 years 3 months ago

Download www.cse.iitd.ernet.in

We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...

Naveen Garg, Amit Kumar

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	181	Minimizing Average Flow-time : Upper and Lower Bounds	claim
2	174	On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)	claim
3	166	Spectral Graph Theory and its Applications	claim
4	157	Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards	claim
5	156	Computing Equilibria in Anonymous Games	claim
6	150	Mechanism Design via Differential Privacy	claim
7	150	Space-Efficient Identity Based Encryption Without Pairings	claim
8	146	A Primal-Dual Randomized Algorithm for Weighted Paging	claim
9	145	Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting	claim
10	143	Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits	claim
11	139	Inferring Local Homology from Sampled Stratified Spaces	claim
12	135	On the Advantage over Random for Maximum Acyclic Subgraph	claim
13	133	Mixing Time Power Laws at Criticality	claim
14	132	Maximizing Non-Monotone Submodular Functions	claim
15	131	On the Hardness and Smoothed Complexity of Quasi-Concave Minimization	claim
16	129	Intrusion-Resilient Secret Sharing	claim
17	129	Local Global Tradeoffs in Metric Embeddings	claim
18	128	Hardness of Reconstructing Multivariate Polynomials over Finite Fields	claim
19	128	Buy-at-Bulk Network Design with Protection	claim
20	124	Lower Bounds on Signatures From Symmetric Primitives	claim
21	123	Round Complexity of Authenticated Broadcast with a Dishonest Majority	claim
22	121	Can you beat treewidth?	claim
23	120	Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling	claim
24	120	Beating Simplex for Fractional Packing and Covering Linear Programs	claim
25	118	Covert Multi-Party Computation	claim
26	118	Hardness Amplification for Errorless Heuristics	claim
27	116	Strongly History-Independent Hashing with Applications	claim
28	116	Cryptography from Sunspots: How to Use an Imperfect Reference String	claim
29	114	A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits	claim
30	114	Finding Disjoint Paths in Expanders Deterministically and Online	claim
31	113	Parameterized Proof Complexity	claim
32	113	Balloon Popping With Applications to Ascending Auctions	claim
33	112	Testing Expansion in Bounded-Degree Graphs	claim
34	109	On the Optimality of Planar and Geometric Approximation Schemes	claim
35	108	Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation	claim
36	104	Approximate Hypergraph Partitioning and Applications	claim
37	104	Towards Sharp Inapproximability For Any 2-CSP	claim
38	102	Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies	claim
39	100	Sparse Random Linear Codes are Locally Decodable and Testable	claim
40	99	Extractors and Rank Extractors for Polynomial Sources	claim
41	97	One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications	claim
42	97	Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem	claim
43	96	The Power of Quantum Systems on a Line	claim
44	92	Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence	claim
45	90	Polylogarithmic Independence Can Fool DNF Formulas	claim
46	90	Smooth Histograms for Sliding Windows	claim
47	88	Near Optimal Bounds for Collision in Pollard Rho for Discrete Log	claim
48	88	Planning for Fast Connectivity Updates	claim
49	87	Pseudorandom Bits for Polynomials	claim
50	85	Non-Linear Index Coding Outperforming the Linear Optimum	claim
51	85	Quantum Algorithms for Hidden Nonlinear Structures	claim
52	84	Non-Preemptive Min-Sum Scheduling with Resource Augmentation	claim
53	83	Derandomization of Sparse Cyclotomic Integer Zero Testing	claim
54	83	Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions	claim
55	81	Reconstruction for Models on Random Graphs	claim
56	72	Testing for Concise Representations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers