WorldCat Identities

Nisan, Noam

Overview
Works: 38 works in 138 publications in 2 languages and 2,007 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other
Publication Timeline
.
Most widely held works by Noam Nisan
The elements of computing systems : building a modern computer from first principles by Noam Nisan( Book )

23 editions published between 2004 and 2009 in English and Undetermined and held by 662 WorldCat member libraries worldwide

"Indeed, the best way to understand how computers work is to build one from scratch, and this textbook leads students through twelve chapters and projects that gradually build a basic hardware platform and a modern software hierarchy from the ground up. In the process, the students gain hands-on knowledge of hardware architecture, operating systems, programming languages, compilers, data structures, algorithms, and software engineering. Using this constructive approach, the book exposes a significant body of computer science knowledge and demonstrates how theoretical and applied techniques taught in other courses fit into the overall picture."
Algorithmic game theory( Book )

30 editions published between 2007 and 2013 in English and held by 649 WorldCat member libraries worldwide

With contributions from major researchers in the field, 'Algorithmic Game Theory' presents a comprehensive treatment of this important practical application
Communication complexity by Eyal Kushilevitz( Book )

26 editions published between 1996 and 2009 in English and held by 351 WorldCat member libraries worldwide

Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory
Using hard problems to create pseudorandom generators by Noam Nisan( Book )

15 editions published between 1988 and 1992 in English and held by 273 WorldCat member libraries worldwide

"Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the power of randomization and the relationships between randomized and deterministic complexity classes by pursuing the idea of emulating randomness, or pseudorandom generation. Pseudorandom generators reduce the number of random bits required by randomized algorithms, enable the construction of certain cryptographic protocols, and shed light on the difficulty of simulating randomized algorithms by deterministic ones. The research described here deals with two methods of constructing pseudorandom generators from hard problems and demonstrates some surprising connections between pseudorandom generators and seemingly unrelated topics such as multiparty communication complexity and random oracles. Nisan first establishes a precise connection between computational complexity and pseudorandom number generation, revealing that efficient deterministic simulation of randomized algorithms is possible under much weaker assumptions than was previously known, and bringing to light new consequences concerning the power of random oracles. Using a remarkable argument based on multiparty communication complexity, Nisan then constructs a generator that is good against all tests computable in logarithmic space. A consequence of this result is a new construction of universal traversal sequences."
Proceedings of the 4th ACM Conference on Electronic Commerce : EC'03 : San Diego, Calif., USA, June 9-12, 2003 by Danny Menasce( )

3 editions published between 2003 and 2004 in English and held by 10 WorldCat member libraries worldwide

Trade-offs between communication throughput and parallel time by Yishay Mansour( Book )

2 editions published between 1993 and 1994 in English and held by 8 WorldCat member libraries worldwide

Abstract: "We study the effect of limited communication throughput on parallel computation in a setting where the number of processors is much smaller than the length of the input. Our model has p processors that communicate through a shared memory of size m. The input has size n, and can be read directly by all the processors. We will be primarily interested in studying cases where n>> p>> m. As a test case we study the list reversal problem. For this problem we prove a time lower bound of [omega](n/[square root of mp]). (A similar lower bound holds also for the problems of sorting, finding all unique elements, convolution, and universal hashing.) This result shows that limiting the communication (i.e., small m) has significant effect on parallel computation. We show an almost matching upper bound of O(n/[square root of mp] log [superscript O(1)]n). The upper bound requires the development of a few interesting techniques which can alleviate the limited communication in some general settings. Specifically, we show how to emulate a large shared memory on a limited shared memory efficiently. We also argue that some standard methodology for designing parallel algorithms appears to require a relatively high level of communication throughput. Our results suggest that new alternative methodologies that need a lower such level must be invented for parallel machines that enable a low level of communication throughput, since otherwise those machines will be severely handicapped as general purpose parallel machines. We cannot offer any encouraging evidence to suggest that such new methodologies are likely to be found."
Parallel algorithms for zero-one supply-demand problems by Noam Nisan( Book )

2 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide

We extend our results to the case where the input represents upper bounds on supplies and lower bounds on demands
Probabilistic analysis of network flow algorithms by Richard M Karp( Book )

1 edition published in 1987 in English and held by 5 WorldCat member libraries worldwide

Communication complexity by Eyāl Qûšileviṣ( Book )

1 edition published in 2006 in English and held by 4 WorldCat member libraries worldwide

Symmetric logspace is closed under complement by Noam Nisan( Book )

3 editions published in 1994 in English and held by 3 WorldCat member libraries worldwide

Elementy systemów komputerowych : budowa nowoczesnego komputera od podstaw by Noam Nisan( Book )

1 edition published in 2008 in Polish and held by 2 WorldCat member libraries worldwide

Lower bounds on arithmetic circuits via partial derivatives : (preliminary version)( Book )

1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide

The elements of computing systems: building a modern computer from the first principles by Noam Nisan( Book )

1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide

Rounds in communication complexity revisited by Noam Nisan( Book )

1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide

Rounds in communication complexity revisited by Noam Nisan( Book )

2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide

An experimental evaluation of bidders' behavior in AD auctions by Gali Noti( Book )

2 editions published in 2014 in English and held by 2 WorldCat member libraries worldwide

Approximate revenue maximization with multiple items by Sergiu Hart( Book )

2 editions published in 2012 in English and held by 2 WorldCat member libraries worldwide

Rounds in communication complexity revisited by Noam Nisan( Book )

1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide

Abstract: "The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds that give (1) randomization is more powerful than determinism in k-round protocols, and (2) an explicit function which exhibits an exponential gap between its k and (k - 1)-round randomized complexity. We also study the three party communication model, and exhibit an exponential gap in 3-round protocols that differ in the starting player. Finally, we show new connections of these questions to circuit complexity, that motivate further work in this direction."
On data structures and asymmetric communication complexity by P. B Miltersen( Book )

2 editions published in 1994 in English and held by 2 WorldCat member libraries worldwide

Complexity of Boolean functions : Dagstuhl, 10-14.03.1997 by D. M Barrington( Book )

1 edition published in 1997 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.53 (from 0.37 for The elemen ... to 0.98 for The elemen ...)

Algorithmic game theory
Covers
Algorithmic game theoryCommunication complexityCommunication complexity
Alternative Names
Nisan, N.

Noam Nisan

Noam Nisan computer scientist

Noam Nisan informaticien israélien

Noam Nisan informaticus uit Israël

Noam Nisan israelischer Informatiker

诺姆·尼散

Languages
English (118)

Polish (1)