: Jean-Jacques Levy, Ernst W. Mayr, John C. Mitchell
: Exploring New Frontiers of Theoretical Informatics
: Springer-Verlag
: 9781402081415
: 1
: CHF 149.90
:
: Sonstiges
: English
: 689
: DRM
: PC/MAC/eReader/Tablet
: PDF
In recent years, IT application scenarios have evolved in very innovative ways. Highly distributed networks have now become a common platform for large-scale distributed programming, high bandwidth communications are inexpensive and widespread, and most of our work tools are equipped with processors enabling us to perform a multitude of tasks. In addition, mobile computing (referring specifically to wireless devices and, more broadly, to dynamically configured systems) has made it possible to exploit interaction in novel ways.

To harness the flexibility and power of these rapidly evolving, interactive systems, there is need of radically new foundational ideas and principles; there is need to develop the theoretical foundations required to design these systems and to cope with the many complex issues involved in their construction; and there is need to develop effective principles for building and analyzing such systems. Reflecting the diverse and wide spectrum of topics and interests within the theoretical computer science community,"Exploring New Frontiers of Theoretical Informatics", is presented in two distinct, but interrelated tracks: Algorithms, Complexity and Models of Computation, and Logic, Semantics, Specification and Verification.

"Explori g New Frontiers of Theoretical Informatics" contains 46 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 3rd IFIP International Conference on Theoretical Computer Science (TCS 2004), which was held in conjunction with the 18th World Computer Congress in Toulouse, France in August 2004 and sponsored by the International Federation for Information Processing (IFIP).  
CONTENTS6
PREFACE11
PROGRAM COMMITTEE12
Invited talks13
THE TPI (TRNA PAIRING INDEX), A MATHEMATICAL MEASURE OF REPETITION IN A (BIOLOGICAL) SEQUENCE14
STABILITY OF APPROXIMATION IN DISCRETE OPTIMIZATION16
TOWARDS A BROADER THEORY OF MOBILE PROCESSES33
A DECIDABLE ANALYSIS OF SECURITY PROTOCOLS35
LOOKING INSIDE AES AND BES36
REMOVE KEY ESCROW FROM THE IDENTITY-BASED ENCRYPTION SYSTEM50
A RANDOMISED ALGORITHM FOR CHECKING THE NORMALITY OF CRYPTOGRAPHIC BOOLEAN FUNCTIONS64
REVERSIBLE CIRCUIT REALIZATIONS OF BOOLEAN FUNCTIONS80
RESOURCE BOUNDED IMMUNITY AND SIMPLICITY94
DEGREE BOUNDS ON POLYNOMIALS AND RELATIVIZATION THEORY110
THE FIRING SQUAD SYNCHRONIZATION PROBLEM WITH MANY GENERALS FOR ONE- DIMENSIONAL CA124
A MATRIX Q-ANALOGUE OF THE PARIKH MAP138
THE INHERENT QUEUING DELAY OF PARALLEL PACKET SWITCHES152
EFFICIENT PROTOCOLS FOR COMPUTING THE OPTIMAL SWAP EDGES OF A SHORTEST PATH TREE166
TRUTHFUL MECHANISMS FOR GENERALIZED UTILITARIAN PROBLEMS180
THE DRIVING PHILOSOPHERS194
ENGINEERING AN EXTERNAL MEMORY MINIMUM SPANNING TREE ALGORITHM*208
SCHEDULING WITH RELEASE TIMES AND DEADLINES ON A MINIMUM222
NUMBER OF MACHINES222
APPROXIMATION ALGORITHMS FOR MIXED FRACTIONAL PACKING AND COVERING PROBLEMS236
ON WEIGHTED RECTANGLE PACKING WITH LARGE RESOURCES250
AN ALGORITHM FOR A SINK LOCATION PROBLEM IN DYNAMIC TREE NETWORKS264
EFFICIENT ALGORITHMS FOR HANDLING MOLECULAR WEIGHTED SEQUENCES278
IMPERFECTNESS OF DATA FOR STS-BASED PHYSICAL MAPPING292
SOLVING PACKING PROBLEM WITH WEAKER BLOCK SOLVERS306
ADAPTIVE SORTING WITH AVL TREES320
PRECISE ANALYSIS OF IN CUBIC TIME330
Track (2) on Logic, Semantics, Specification, and Verification346
PROTOTYPING PROOF CARRYING CODE346
CONTRACT ORIENTED DEVELOPMENT OF COMPONENT SOFTWARE362
NEW INSIGHTS ON ARCHITECTURAL CONNECTORS380
ON COMPLEXITY OF MODEL-CHECKING FOR THE TQL LOGIC394
A GENERIC FRAMEWORK FOR CHECKING SEMANTIC EQUIVALENCES BETWEEN PUSHDOWN AUTOMATA AND FINITE-STATE AUTOMATA408
Tailoring Recursion to Characterize Non- Deterministic Complexity Classes Over Arbitrary Structures422
A CALCULUS WITH LAZY MODULE OPERATORS436
DYNAMIC TYPING WITH DEPENDENT TYPES450
SUBTYPING-INHERITANCE CONFLICTS: THE MOBILE MIXIN CASE464
ASYMPTOTIC BEHAVIORS OF TYPE-2 ALGORITHMS AND INDUCED BAIRE TOPOLOGIES478
EFFECTIVE CHEMISTRY FOR SYNCHRONY AND ASYNCHRONY492
CONTROLLER SYNTHESIS FOR PROBABILISTIC SYSTEMS (EXTENDED ABSTRACT)506
HIGHLY UNDECIDABLE QUESTIONS FOR PROCESS ALGEBRAS520
NEW-HOPLA534
BEHAVIOURAL EQUIVALENCES FOR DYNAMIC WEB DATA548
BEHAVIOURAL THEORY FOR MOBILE AMBIENTS562
NESTED COMMITS FOR MOBILE CALCULI: EXTENDING JOIN576
DYNAMIC AND LOCAL TYPING FOR MOBILE AMBIENTS590
TRUE TYPE POLYMORPHISM FOR MOBILE AMBIENTS604
RECOVERING RESOURCES IN THE (DRAFT)618
ENSURING TERMINATION BY TYPABILITY632
THE SIMPLY-TYPED PURE PATTERN TYPE SYSTEM ENSURES STRONG NORMALIZATION646
TERMINATION IN MODAL KLEENE ALGEBRA660
REGULAR TREE LANGUAGE RECOGNITION WITH STATIC INFORMATION674
Acknowledgments687
Author Index688
More eBook at www.ciando.com0