Welcome
Copyright © SirsiDynix. All rights reserved.
(Build horizon-8.0.1.5407)
Center Of Excellence for Jordanian Public University Library System (COE-JOPULS)
العربية (السعودية)
English (United States)
Log in
Help
Welcome
Jordanian Union Catalogue
360 Search
Search Libraries Catalogue
Simple
Advanced
Power
Community Resource
Search History
My List
My Account
Search
Options
Refine
Start Over
Show details
Hide details
Duplicate Items
Add to My List
Print
Sorts and Limits
Sorts:
None
Author
Publication Date
Publisher
Subject
Title
Title:
Mathematical Foundations of Computer Science 2013 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings / edited by Krishnendu Chatterjee, Jirí Sgall.
Lecture Notes in Computer Science,
Lecture notes in computer science,
Main Entry:
Chatterjee, Krishnendu. editor.
Sgall, Jirí. editor.
SpringerLink (Online service)
Publisher:
Springer Berlin Heidelberg : Imprint: Springer,
Publication Date:
2013.
Publication Place:
Berlin, Heidelberg :
ISBN:
9783642403132
Subject:
Computer science.
Data structures (Computer Science).
Computer software.
Electronic data processing.
Computational complexity.
Computer science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Numeric Computing.
Data structures.
Mathematical Logic and Formal Languages.
Math Applications in Computer Science.
Series:
Lecture Notes in Computer Science, 8087
Lecture notes in computer science, 8087
Contents:
Alternation Trading Proofs and Their Limitations -- Bin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic.
Related Records:
Springer eBooks
Printed edition: 9783642403125
Cover Image:
Results 1 - 1 of 1
Agency:
Collection:
Item Type:
Status:
Barcode:
Media Type:
JUST Main Library
Electronic Resources
No Circulation
Available Online
-638548
Book