33rd Annual Symposium on Foundations of Computer Science: Proceedings

October 24-27, 1992, Pittsburgh, Pennsylvania/Cat. No. 92Ch3188-0 (Symposium on ... on Foundations of Computer Science)
  • 752 Pages
  • 2.45 MB
  • 535 Downloads
  • English
by
IEEE Computer Society Press
General Theory of Computing, General, Computer Science (General), Computers - General Information, Science/Mathem
The Physical Object
FormatPaperback
ID Numbers
Open LibraryOL11389506M
ISBN 100818629002
ISBN 139780818629006

This book constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCSheld in Torun, Poland, in August The 45 revised full papers presented together with 5 invited.

33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, October IEEE Computer SocietyISBN [contents] 32nd FOCS San Juan, Puerto Rico.

51 rows  larger cover image: The IEEE Symposium on Foundations of Computer Science (FOCS). Get this from a library. 33rd Annual Symposium on Foundations of Computer Science: October, Pittsburg, Pennsylvania: proceedings [papers].

[IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing.;]. Proceedings., 33rd Annual Symposium on Foundations of Computer Science, () Parallel comparison merging of many-ordered lists. Theoretical Computer ScienceCited by: Presents the front cover of the proceedings record.

Proceedings 35th Annual Symposium on. Proceedings., 33rd Annual Symposium on Foundations of Computer Science Location: Pittsburgh, PA, USA [] Proceedings 32nd Annual Symposium of Foundations of Computer Science Location: San Juan, Puerto Rico, USA.

In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS (pp. [] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol.

Download 33rd Annual Symposium on Foundations of Computer Science: Proceedings PDF

October). BibTeX @INPROCEEDINGS{Plaxton92improvedlower, author = {C. Greg Plaxton and Bjorn Poonen and Torsten Suel}, title = {Improved Lower Bounds for Shellsort}, booktitle = {In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science}, year = {}, pages = {}}.

FOCS ' Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. October Read More. Proceeding. Publisher: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. Previous Next. Abstract. No abstract available.

Select All. Export Citations Save to Binder. ARTICLE. The IEEE Annual Symposium on Foundations of Computer Science is an academic conference in the field of theoretical computer science. FOCS is sponsored by the IEEE Computer Society. As Fich writes, FOCS and its annual Association for Computing Machinery counterpart STOC are considered the two top conferences in theoretical computer science, considered broadly: they “are forums for some of the best work throughout theory of computing that promote breadth among theory of computing.

Browse Proceedings. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. November Read More. Proceeding.

Publisher: IEEE Computer Society; Massachusetts Ave., NW Washington, DC; Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Previous Next. Abstract. No abstract. Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS IEEE Computer Society, pp.

Description 33rd Annual Symposium on Foundations of Computer Science: Proceedings EPUB

(Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, (FOCS), Octoberpages A brief announcement of this work also appears in Proceedings of the 27th International Symposium on Distributed Computing (DISC), Lecture Notes in Computer Science, volumeOctoberpages Costis Daskalakis, Themis Gouleakis, Christos Tzamos and Manolis Zampetakis 59th Annual IEEE Symposium on Foundations of Computer Science, (FOCS) Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover.

Mohsen Ghaffari,Themis Gouleakis, Christian Konrad. Jump to Content Jump to Main Navigation. Publications. Logical Methods in Computer Science, Vol Issue 1, February A preliminary version appearead in the Proceedings of 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ), IEEE Press, pagespdf: A.

Atserias, M. Lauria, and J. Nordström.

Details 33rd Annual Symposium on Foundations of Computer Science: Proceedings EPUB

Narrow Proofs May Be Maximally Long. CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an \Omega\Gamma n lg 2 n=(lg lg n) 2) lower bound for the size of Shellsort sorting networks, for arbitrary increment sequences.

We also show an identical lower bound for the running time of Shellsort. In 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. [] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). [] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Cited by: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing () p.

21– Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science () p. – D.B. ShmoysA best possible approximation algorithm for the k-center by: Preliminary Version: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science,pp.

Approximation Algorithms for the Largest Common Subtree Problem. (with S. Khanna and F.F. Yao) Preliminary version: Report No. STAN-CS, Department of Computer Science, Stanford University (). Nisan, E. Szemerédi, A.

Wigderson, Undirected connectivity inO n, Proceedings, 33rd Annual IEEE Symposium on Foundations of Computer Science, October Google Scholar 25Cited by: Home Browse by Title Proceedings SFCS '92 Zero-knowledge proofs of knowledge without interaction. ARTICLE. Zero-knowledge proofs of knowledge without interaction.

Share on. Authors: A. De Santis. Dipartimento di Informatica ed Applicazioni, Salerno Univ., Italy. Annual Symposium on Foundations of Computer Science (Proceedings) Publisher: Publ by IEEE: Pages: Number of pages: 6: ISBN (Print) State: Published - Dec 1 Event: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA Duration: Oct 1 → Oct 4 Volume 25 (), pages Also appeared in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, Octoberpages (PS,PDF) S.

Fenner. Resource-bounded Baire category: A stronger approach. Journal Draft. Annual Symposium on Foundations of Computer Science (Proceedings) Publisher: Publ by IEEE: Pages: Number of pages: 8: ISBN (Print) State: Published - Dec 1 Externally published: Yes: Event: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA Duration: Oct 1 → Oct 4 Cited by: The Steiner tree problem is defined as follows—given a graph G=(V,E) and a subset X⊂V of terminals, compute a minimum cost tree that includes all nodes in X.

Furthermore, it is reasonable to assume that the edge costs form a metric. This problem is NP-hard and has been the. Aaron L. Roth Contact Information Phone: () Saeed Shari -Malvajerdi.

NeurIPS The 33rd Annual Conference on Neural Information Processing Systems, Oral Presentation (36 / submissions) Aaron Roth. FOCS The 60th Annual IEEE Symposium on Foundations of Computer Science, How to Use Heuristics for Di.

Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS IEEE Computer Society, pp. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Cited by: Conferences IEEE Symposium on Foundations of Computer Science (FOCS) The IEEE Symposium on Foundations of Computer Science (FOCS) is the flagship conference of the TCMF and covers a broad range of theoretical computer science.

It is held annually in the autumn and is paired with its sister conference, the annual Symposium on Theory of Computing (STOC) [ ]. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), October P. Jayanti, E. L. Lloyd, and A. S. Sethi.

Complexity of Concurrent Reading and Writing. In Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG), OctoberLecture Notes in Computer ScienceSpringer-Verlag.Optimal cover time for a graph-based coupon collector process.

In Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, Lisboa, Portugal, pagesJuly X. Li, J. Misra, and C. G. Plaxton. Active and concurrent topology maintenance.Get this from a library!

Foundations of Computer Science, 34th Symposium on (FOCS '93). -- Proceedings of the 34th Annual Symposium on Foundations of Computer Science, held in Palo Alto, California, Novermber The chronological presentation includes .