Theory of Computing and Systems de Danny Dolev

Theory of Computing and Systems: ISTCS '92, Israel Symposium, Haifa, Israel, May 27-28, 1992. Proceedings: Lecture Notes in Computer Science, cartea 601

Danny Dolev

Zvi Galil

Michael Rodeh

ISTCS '92, the Israel Symposium on the Theory of Computingand Systems, cameabout spontaneously as a result ofinformal interaction between a group of people who viewedthe conference as an appropriate expression of Israelistrength in theoretical aspects of computing and systems.The enthusiasm that the symposium created resulted in thesubmission of a large number of extremely high qualitypapers, which led in turn to strict acceptance criteria.This volume contains nineteen selected papers representingthe cream of Israeli talent in the field, on a variety ofactive and interesting topics in the theory of computing andsystems.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

15%

Preț: 558^.12 lei
20%

Preț: 573^.45 lei
20%

Preț: 330^.54 lei
20%

Preț: 620^.33 lei
20%

Preț: 400^.77 lei
20%

Preț: 1033^.45 lei
20%

Preț: 629^.71 lei
20%

Preț: 328^.94 lei
20%

Preț: 375^.72 lei
20%

Preț: 568^.70 lei
20%

Preț: 1359^.66 lei
20%

Preț: 489^.11 lei
20%

Preț: 560^.93 lei
20%

Preț: 731^.97 lei
20%

Preț: 563^.29 lei
20%

Preț: 403^.00 lei
20%

Preț: 782^.57 lei
20%

Preț: 336^.86 lei
20%

Preț: 560^.93 lei
20%

Preț: 850^.42 lei
20%

Preț: 432^.78 lei
20%

Preț: 342^.61 lei
20%

Preț: 631^.96 lei
20%

Preț: 904^.16 lei
20%

Preț: 1391^.87 lei
20%

Preț: 487^.46 lei
20%

Preț: 400^.17 lei
20%

Preț: 984^.64 lei
20%

Preț: 556^.96 lei
20%

Preț: 733^.68 lei
20%

Preț: 1020^.28 lei
20%

Preț: 793^.92 lei
20%

Preț: 733^.68 lei
20%

Preț: 1137^.10 lei
20%

Preț: 679^.09 lei
20%

Preț: 558^.53 lei
20%

Preț: 327^.36 lei
20%

Preț: 340^.04 lei
20%

Preț: 327^.36 lei
20%

Preț: 560^.93 lei
20%

Preț: 324^.19 lei
20%

Preț: 1079^.23 lei
20%

Preț: 735^.28 lei
20%

Preț: 373^.80 lei
Preț: 395^.25 lei
20%

Preț: 488^.90 lei
20%

Preț: 293^.24 lei

Cuprins

Merging and splitting priority queues and deques in parallel.- Lower bounds for the complexity of functions in a realistic RAM model.- On Boolean decision trees with faulty nodes.- Interval graphs, interval orders and the consistency of temporal events (extended abstract).- Higher order functions in first order logics.- Reduction relations in strict applicative languages.- Approximation algorithms for minimum time broadcast.- The complexity of reconfiguring network models.- Optimal mapping in direct mapped cache environments.- New algorithms for generalized network flows.- Factoring polynomials via relation-finding.- New resultant inequalities and complex polynomial factorization.- Can symmetric Toeplitz solvers be strongly stable?.- Bounds on parallel computation of multivariate polynomials.- Time-lapse snapshots.- Concurrent Timestamping made simple.- Distributed evaluation: a tool for constructing distributed detection programs.- Foundations of asymptotical theory of Determinate Compact Testing.- Optimal k-colouring and k-nesting of intervals.