Filter
Conference contribution

Search results

  • 2001

    Random CDMA in the multiple cell uplink environment: The effect of fading on various receivers

    Zaidel, B. M., Shamai, S. & Verdú, S., 2001, Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001. Institute of Electrical and Electronics Engineers Inc., p. 42-44 3 p. 955130. (Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 2000

    Information theoretic aspects of some multiuser detection strategies in a multi-cell randomly spread DS-CDMA system

    Zaidel, B. M., Shamai, S. & Verdú, S., 2000, 21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 267-270 4 p. 924388. (21st IEEE Convention of the Electrical and Electronic Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Irregularities of distribution, derandomization, and complexity theory

    Chazelle, B., 2000, FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science - 20th Conference, Proceedings. Kapoor, S. & Prasad, S. (eds.). Springer Verlag, p. 46-54 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1974).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1999

    Capacity of CDMA fading channels

    Shamai, S. & Verdú, S., 1999, Proceedings - 1999 IEEE International Symposium on Information Theory, ITW 1999. Institute of Electrical and Electronics Engineers Inc., p. 24 1 p. 814334. (IEEE International Symposium on Information Theory - Proceedings; vol. 1999-June).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations
  • Geometric searching over the rationals

    Chazelle, B., 1999, Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Nešetřil, J. (ed.). Springer Verlag, p. 354-365 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1643).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    2 Scopus citations
  • Trade-offs of performance and single chip implementation of indoor wireless multi-access receivers

    Zhang, N., Poon, A., Tse, D., Brodersen, R. & Verdu, S., 1999, 1999 IEEE Wireless Communications and Networking Conference, WCNC. Institute of Electrical and Electronics Engineers Inc., p. 226-230 5 p. 797820. (IEEE Wireless Communications and Networking Conference, WCNC; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 1998

    Resistance of digital watermarks to collusive attacks

    Kilian, J., Leighton, F. T., Matheson, L. R., Shamoon, T. G., Tarjan, R. E. & Zane, F., 1998, Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998. p. 271 1 p. 708876. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    49 Scopus citations
  • Robustness and security of digital watermarks

    Matheson, L. R., Mitchell, S. G., Shamoon, T. G., Tarjan, R. E. & Zane, F., 1998, Financial Cryptography - 2nd International Conference, FC 1998, Proceedings. Hirschfeld, R. (ed.). Springer Verlag, p. 227-240 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1465).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    16 Scopus citations
  • Simple confluently persistent catenable lists

    Kaplan, H., Okasaki, C. & Tarjan, R. E., 1998, Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. Arnborg, S. & Ivansson, L. (eds.). Springer Verlag, p. 119-130 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1432).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • Spectral efficiency of direct-sequence spread-spectrum multiaccess with random spreading

    Verdu, S. & Shamai, S., 1998, 1998 Information Theory Workshop, ITW 1998. Institute of Electrical and Electronics Engineers Inc., p. 64-65 2 p. 706437. (1998 Information Theory Workshop, ITW 1998).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • The discrepancy method

    Chazelle, B., 1998, Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. Springer Verlag, p. 1-3 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1533 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • 1997

    Interior point methods for sea-bottom image enhancement

    Carmona, R. A. & Zhong, S., 1997, Proceedings of SPIE - The International Society for Optical Engineering. Society of Photo-Optical Instrumentation Engineers, p. 132-137 6 p. (Proceedings of SPIE - The International Society for Optical Engineering; vol. 3079).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • Least favorable additive noise under a divergence constraint

    McKellips, A. L. & Verdu, S., 1997, Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997. p. 533 1 p. 613470. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Sensitivity of the rate-distortion function of stationary continuous-time Gaussian processes to non-Gaussian contamination

    Pinsker, M. S., Prelov, V. V. & Verdú, S., 1997, Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997. p. 73 1 p. 612988. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1996

    Purely functional representations of catenable sorted lists

    Kaplan, H. & Tarjan, R. E., Jul 1 1996, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, p. 202-211 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129452).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    28 Scopus citations
  • Toward efficient unstructured multigrid preprocessing (extended abstract)

    Dorward, S. E., Matheson, L. R. & Tarjan, R. E., 1996, Parallel Algorithms for Irregularly Structured Problems - 3rd International Workshop IRREGULAR 1996, Proceedings. Ferreira, A., Rolim, J., Saad, Y. & Yang, T. (eds.). Springer Verlag, p. 105-118 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1117).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 1995

    Models of parallel computation: A survey and synthesis

    Maggs, B. M., Matheson, L. R. & Tarjan, R. E., 1995, Proceedings of the 28th Annual Hawaii International Conference on System Sciences, HICSS 1995. IEEE Computer Society, p. 61-70 10 p. 375476. (Proceedings of the Annual Hawaii International Conference on System Sciences; vol. 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    54 Scopus citations
  • 1994

    A randomized linear-Time algorithm for finding minimum spanning trees

    Kleint, P. N. & Tarjan, R. E., May 23 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 9-15 7 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    20 Scopus citations
  • Bounds on the size of tetrahedralizations

    Chazelle, B. & Shouraboura, N., 1994, Proceedings of the Annual Symposium on Computational Geometry. Publ by ACM, p. 231-239 9 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    13 Scopus citations
  • Finite-precision source resolvability

    Steinberg, Y. & Verdú, S., 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. Institute of Electrical and Electronics Engineers Inc., p. 296 1 p. 394722. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • The resolvability and the capacity of AWGN channels are equal

    Han, T. S. & Verdú, S., 1994, Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. Institute of Electrical and Electronics Engineers Inc., p. 463 1 p. 395078. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • Unstructured multigrid strategies on massively parallel computers: A case for integrated design

    Dorward, S. E., Matheson, L. R. & Tarjan, R. E., 1994, Proceedings of the Hawaii International Conference on System Sciences. Publ by IEEE, p. 169-178 10 p. (Proceedings of the Hawaii International Conference on System Sciences; vol. 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • When does the source-channel separation theorem hold?

    Vembu, S., Verdu, S. & Steinberg, Y., Dec 1 1994, IEEE International Symposium on Information Theory - Proceedings. IEEE

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1993

    Approximation theory of output statistics

    Han, T. S. & Verdu, S., 1993, Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, p. 153 1 p. (Proceedings of the 1993 IEEE International Symposium on Information Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • Generalizing Fano's inequality

    Han, T. S. & Verdu, S., 1993, Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, p. 71 1 p. (Proceedings of the 1993 IEEE International Symposium on Information Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Geometric discrepancy revisited

    Chazelle, B., 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 392-399 8 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    12 Scopus citations
  • Multiuser water-filling

    Cheng, R. S. & Verdu, S., 1993, Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, p. 209 1 p. (Proceedings of the 1993 IEEE International Symposium on Information Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Product range spaces, sensitive sampling, and derandomization

    Bronnimann, H., Chazelle, B. & Matousek, J., 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 400-409 10 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    19 Scopus citations
  • Worst-case power-constrained noise for binary-input channels

    Shamai, S. & Verdu, S., 1993, Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, p. 262 1 p. (Proceedings of the 1993 IEEE International Symposium on Information Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • 1992

    A faster deterministic maximum flow algorithm

    King, V., Rao, S. & Tarjan, R., Sep 1 1992, Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, p. 157-164 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129721).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    36 Scopus citations
  • Computing minimal spanning subgraphs in linear time

    Han, X., Kelsen, P., Ramachandran, V. & Tarjan, R., Sep 1 1992, Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, p. 146-156 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129721).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations
  • Diameter, width, closest line pair, and parametric searching

    Chazelle, B., Edelsbrunner, H., Guibas, L. & Sharir, M., 1992, Eighth Annual Symposium On Computational Geometry. Publ by ACM, p. 120-129 10 p. (Eighth Annual Symposium On Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    21 Scopus citations
  • How hard is halfspace range searching

    Bronnimann, H. & Chazelle, B., 1992, Eighth Annual Symposium On Computational Geometry. Publ by ACM, p. 271-275 5 p. (Eighth Annual Symposium On Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 1991

    Fully persistent lists with catenation

    Driscoll, J. R., Sleator, D. D. K. & Tarjan, R. E., Mar 1 1991, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, p. 89-99 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • On the exponent of the all pairs shortest path problem

    Alon, N., Galil, Z. & Margalit, O., Dec 1991, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 569-575 7 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    43 Scopus citations
  • Randomized parallel algorithms for trapezoidal diagrams

    Clarkson, K. L., Cole, R. & Tarjan, R. E., Jun 1 1991, Proceedings of the Annual Symposium on Computational Geometry. Association for Computing Machinery, p. 152-161 10 p. (Proceedings of the Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • 1990

    More efficient bottom-up tree pattern matching

    Cai, J., Paige, R. & Tarjan, R., 1990, CAAP 1990 - 15th Colloquium on Trees in Algebra and Programming, Proceedings. Arnold, A. (ed.). Springer Verlag, p. 72-86 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 431 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations
  • Quasi-optimal upper bounds for simplex range searching and new zone theorems

    Chazelle, B., Sharir, M. & Welzl, E., 1990, Proc Sixth Annu Symp Comput Geom. Publ by ACM, p. 23-33 11 p. (Proc Sixth Annu Symp Comput Geom).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    22 Scopus citations
  • Slimming down by adding; selecting heavily covered points

    Chazelle, B., Edelsbrunner, H., Guibas, L. J., Hershberger, J. E., Seidel, R. & Sharir, M., 1990, Proc Sixth Annu Symp Comput Geom. Publ by ACM, p. 116-127 12 p. (Proc Sixth Annu Symp Comput Geom).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • 1989

    A singly-exponential stratification scheme for real semi-algebraic varieties and its applications

    Chazelle, B., Edelsbrunner, H., Guibas, L. J. & Sharir, M., 1989, Automata, Languages and Programming - 16th International Colloquium, Proceedings. Dezani-Ciancaglini, M., Della Rocca, S. R. & Ausiello, G. (eds.). Springer Verlag, p. 179-193 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 372 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    43 Scopus citations
  • Lines in space - combinatorics, algorithms and applications

    Chazelle, B., Edelsbrunner, H., Guibas, L. J. & Sharir, M., 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 382-393 12 p. (Proc Twenty First Annu ACM Symp Theory Comput).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    28 Scopus citations
  • 1988

    A fast las vegas algorithm for triangulating a simple polygon

    Clarkson, K. L., Tarjan, R. E. & Van Wyk, C. J., Jan 6 1988, Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, p. 18-22 5 p. (Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • Almost-optimum speed-ups of algorithms for dipartite matching and relatod problems

    Gabow, H. N. & Tarjan, R. E., 1988, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery, p. 514-527 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    31 Scopus citations
  • Deterministic view of random sampling and its use in geometry

    Chazelle, B. & Friedman, J., 1988, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 539-549 11 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • Finding minimum-cost circulations by canceling negative cycles

    Goldberg, A. V. & Tarjan, R. E., 1988, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery, p. 388-397 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    17 Scopus citations
  • Optimal algorithm for intersecting line segments in the plane

    Chazelle, B. & Edelsbrunner, H., 1988, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 590-600 11 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    48 Scopus citations
  • 1987

    POLYTOPE RANGE SEARCHING AND INTEGRAL GEOMETRY.

    Chazelle, B., 1987, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 1-10 10 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Scopus citations
  • 1986

    Linear time algorithms for visibility and shortest path problems inside simple polygons

    Guibas, L., Hershberger, J., Leven, D., Sharir, M. & Tarjan, R. E., Aug 1 1986, Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986. Association for Computing Machinery, Inc, p. 1-13 13 p. (Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    63 Scopus citations
  • LOWER BOUNDS ON THE COMPLEXITY OF MULTIDIMENSIONAL SEARCHING.

    Chazelle, B., 1986, Annual Symposium on Foundations of Computer Science (Proceedings). p. 87-96 10 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • 1984

    FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS.

    Fredman, M. L. & Tarjan, R. E., 1984, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 338-346 9 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    200 Scopus citations