Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.

19-19 Nov. 2002

Filter Results

Displaying Results 1 - 25 of 82
  • Proceedings 43rd Annual IEEE Symposium on Foundations of Computer Science

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (327 KB)
    Freely Available from IEEE
  • Zero-knowledge: abstract of a tutorial

    Publication Year: 2002
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (201 KB) | HTML iconHTML

    Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory definition; zero-knowledge proofs are both convincing and yet yield nothing beyond the validity of the assertion being proven. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning intersections and thresholds of halfspaces

    Publication Year: 2002, Page(s):177 - 186
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution to within any constant error parameter. We also give the first quasipolynomial time algorithm for learning any function of a polylog number of polynomial-weight halfspaces under any distribution. As special cases of these results we obtain algorithms for learning inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erratum to "Vickrey pricing and shortest paths: What is an edge worth?"

    Publication Year: 2002, Page(s): 809
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2002, Page(s):811 - 813
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • Market equilibrium via a primal-dual-type algorithm

    Publication Year: 2002, Page(s):389 - 395
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    Although the study of market equilibria has occupied center stage within mathematical economics for over a century, polynomial time algorithms for such questions have so far evaded researchers. We provide the first such algorithm for the linear version of a problem defined by Irving Fisher in 1891. Our algorithm is modeled after Kuhn's (1995) primal-dual algorithm for bipartite matching. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract combinatorial programs and efficient property testers

    Publication Year: 2002, Page(s):83 - 92
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (445 KB) | HTML iconHTML

    Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms with one-sided error. Our framework is based on a connection of property testing and a new class of problems ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlation clustering

    Publication Year: 2002, Page(s):238 - 247
    Cited by:  Papers (34)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, υ) is labeled either + or - depending on whether a and υ have been deemed to be similar or different. The goal is to produce a partition of the vertices (a clustering) that agrees as much as possible with the edge labels. That is, we want a clustering that maximizes the numbe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forbidden information

    Publication Year: 2002, Page(s):761 - 765
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    There appears to be a gap between usual interpretations of Godel Theorem and what is actually proven. Closing this gap does not seem obvious and involves complexity theory. (This is unrelated to, well studied before, complexity quantifications of the usual Godel effects.) Similar problems and answers apply to other unsolvability results for tasks where required solutions are not unique, such as, e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the (non)universality of the one-time pad

    Publication Year: 2002, Page(s):376 - 385
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. We initiate the quantitative study concerning feasibility of building secure cryptographic primitives using imperfect random sources. Specifically, we concentrate on symmetric-key encryption and message authentication, where the shared secret ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit unique-neighbor expanders

    Publication Year: 2002, Page(s):73 - 79
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    We present a simple, explicit construction of an infinite family F of bounded-degree 'unique-neighbor' expanders Γ; i.e., there are strictly positive constants α and ε, such that all Γ = (X, E(Γ)) ∈ F satisfy the following property. For each subset S of X with no more than α|X| vertices, there are at least ε|S| vertices in X/S that are adjacent in &Gamm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graphs with tiny vector chromatic numbers and huge chromatic numbers

    Publication Year: 2002, Page(s):283 - 292
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    Karger Motwani and Sudan (1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector k-colorable, and that for constant k, graphs that are vector k-colorable can be colored by roughly Δ1-2k/ colors. Here Δ is the maximum degree in the graph. Their results play a major role in the best approximation algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple algorithmic characterization of uniform solvability

    Publication Year: 2002, Page(s):228 - 237
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    The Herlihy-Shavit (HS) conditions characterizing the solvability of asynchronous tasks over n processors have been a milestone in the development of the theory of distributed computing. Yet, they were of no help when researcher sought algorithms that do not depend on n. To help in this pursuit we investigate the uniform solvability of an infinite uniform sequence of tasks T0, T1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kolmogorov's structure functions with an application to the foundations of model selection

    Publication Year: 2002, Page(s):751 - 760
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (426 KB) | HTML iconHTML

    Kolmogorov (1974) proposed a non-probabilistic approach to statistics, an individual combinatorial relation between the data and its model. We vindicate, for the first time, the rightness of the original "structure function", proposed by Kolmogorov: minimizing the data-to-model code length (finding the ML estimator or MDL estimator), in a class of contemplated models of prescribed maximal (Kolmogo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic planar convex hull

    Publication Year: 2002, Page(s):617 - 626
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing juntas [combinatorial property testing]

    Publication Year: 2002, Page(s):103 - 112
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    We show that a Boolean function over n Boolean variables can be tested for the property of depending on only k of them, using a number of queries that depends only on k and the approximation parameter ε. We present two tests, both non-adaptive, that require a number of queries that is polynomial k and linear in ε-1. The first test is stronger in that it has a 1-sided error, wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line end-to-end congestion control

    Publication Year: 2002, Page(s):303 - 310
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. We analyze a particular end-to-end MIMD (multiplicative-increase, multiplicative-decrease) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomness extractors and their many guises

    Publication Year: 2002
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Since its introduction by Nisan and Zuckerman at STOC '93 (1996) nearly a decade ago, the notion of a randomness extractor has proven to be a fundamental and powerful one. Extractors and their variants have found widespread application in a variety of areas, including pseudorandomness and derandomization, combinatorics, cryptography, data structures, and computational complexity. Equally striking ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependent rounding in bipartite graphs

    Publication Year: 2002, Page(s):323 - 332
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB) | HTML iconHTML

    We combine the pipage rounding technique of Ageev & Sviridenko with a recent rounding method developed by Srinivasan (2001), to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications: richer random-graph models for graphs with a given deg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks

    Publication Year: 2002, Page(s):691 - 700
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem called minimum conflict-free coloring (min-CF-coloring). In its general form, the input of the min-CF-coloring problem is a set system (X, S), where each S ∈ S is a subset of X. The output is a coloring X of the sets in S that satisfies the following constraint: for every x ∈ X... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent zero knowledge with logarithmic round-complexity

    Publication Year: 2002, Page(s):366 - 375
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using O˜(log n) rounds of interaction. The number of rounds in our protocol is optimal, in the sense that any language outside BPP requires at least Ω˜(log n) rounds of interaction in order to be proved in black-box concurrent zero-knowledge. The zero-knowledge property of our main protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power from random strings

    Publication Year: 2002, Page(s):669 - 678
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    We show that sets consisting of strings of high Kolmogorov complexity provide examples of sets that are complete for several complexity classes under probabilistic and non-uniform reductions. These sets are provably not complete under the usual many-one reductions. Let RK, RKt, RKS, RKT be the sets of strings x having complexity at least |x|/2, according... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic broadcasting time in radio networks of unknown topology

    Publication Year: 2002, Page(s):63 - 72
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    In a seminal paper, Bar-Yehuda et al. (1992) considered broadcasting in radio networks whose nodes know only their own label and labels of their neighbors. They claimed a linear lower bound on the time of deterministic broadcasting in such radio networks, by constructing a class of graphs of diameter 3, with the property that every broadcasting algorithm requires linear time on one of these graphs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the decidability of self-assembly of infinite ribbons

    Publication Year: 2002, Page(s):530 - 537
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. A systematic study of self-assembly as a mathematical process has been initiated. The individual components are modelled as square tiles on the infinite two-dimensional plane. Each side of a tile is covered by a specific "glue", and two adjacent tiles will stick ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions

    Publication Year: 2002, Page(s):416 - 425
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We consider the following class of problems. The value of an outcome to a society is measured via a submodular utility function (submodularity has a natural economic interpretation: decreasing marginal utility). Decisions, however, are controlled by non-cooperative agents who seek to maximise their own private utility. We present, under basic assumptions, guarantees on the social performance of Na... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.