ITU

Symposium on Foundations of Computer Science. Annual Proceedings

  1. 2013
  2. Published

    How to Approximate A Set Without Knowing Its Size in Advance

    Pagh, R., Segev, G. & Wieder, U., 2013, In: Symposium on Foundations of Computer Science. Annual Proceedings. p. 80-88

    Research output: Journal Article or Conference Article in JournalConference articleResearchpeer-review

  3. Published

    The Parity of Directed Hamiltonian Cycles

    Björklund, A. & Husfeldt, T., 2013, In: Symposium on Foundations of Computer Science. Annual Proceedings. p. 727-735

    Research output: Journal Article or Conference Article in JournalConference articleResearchpeer-review

  4. 2008
  5. Published

    Near-Optimal Sparse Recovery in the L1 Norm

    Ruzic, M. & Indyk, P., 2008, In: Symposium on Foundations of Computer Science. Annual Proceedings.

    Research output: Journal Article or Conference Article in JournalConference articleResearchpeer-review

ID: 780352