9783540240587 - fsttcs 2004: foundations of software technology and theoretical computer science: 24th international conference, chennai, india, december 16-18, 2004, ... (lecture notes in computer science, 3328) de mahajan, meena; lodaya, kamal (6 resultados)
- Tapa blanda
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de AmericaGuthrieBooks
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 44,90
Envío por EUR 6,02Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.
- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 64,16Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) is the longest-running conference on computer science in India, and is organized under the aegis of the Indian As- ciation for Research… in Computing Science, IARCS. Since its inception in 1981, the conference (held annually in the month of December) has helped in nurt- ing and creating an environment for the exchange of ideas amongst the research community in the country, by attracting top scientists around the world to the conference. This volume contains the proceedings of the 24th FSTTCS conf- ence held in December 2004. A strong point of the FSTTCS programmes has been excellent invited talks by eminent computer scientists of international renown. Continuing this t- dition, this FSTTCS featured invited talks by Javier Esparza, Piotr Indyk, Pavel A. Pevzner, John C. Reynolds, and Denis Th erien. We thank our invited speakers for readily agreeing to come to FSTTCS, and for providing write-ups for the proceedings. It is our pleasure that IARCS chose to honor Prof. Rani Siromoney at this conference, on the occasion of her 75th birthday. The in uence she has wielded (and the impact she has exerted) in Indian theoretical computer science is tremendous, and the tribute is tting and richly deserved. We thank R.K. Sh- masundar for chairing the special session in her honor, and Kamala Krithivasan and K.G. Subramanian for speaking at the session.
- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 147,69
Envío por EUR 28,91Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) is the longest-running conference on computer science in India, and is organized under the aegis of the Indian As- ciat…ion for Research in Computing Science, IARCS. Since its inception in 1981, the conference (held annually in the month of December) has helped in nurt- ing and creating an environment for the exchange of ideas amongst the research community in the country, by attracting top scientists around the world to the conference. This volume contains the proceedings of the 24th FSTTCS conf- ence held in December 2004. A strong point of the FSTTCS programmes has been excellent invited talks by eminent computer scientists of international renown. Continuing this t- dition, this FSTTCS featured invited talks by Javier Esparza, Piotr Indyk, Pavel A. Pevzner, John C. Reynolds, and Denis Th erien. We thank our invited speakers for readily agreeing to come to FSTTCS, and for providing write-ups for the proceedings. It is our pleasure that IARCS chose to honor Prof. Rani Siromoney at this conference, on the occasion of her 75th birthday. The in uence she has wielded (and the impact she has exerted) in Indian theoretical computer science is tremendous, and the tribute is tting and richly deserved. We thank R.K. Sh- masundar for chairing the special session in her honor, and Kamala Krithivasan and K.G. Subramanian for speaking at the session. 556 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, , Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 48,37
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Papers.- Genome Halving Problem Revisited.- Verifying Probabilistic Procedural Programs.- Streaming Algorithms for Geometric Problems.- Toward a Grainless Semantics for Shared-Variable… Concurrency.- Regular Languages, Unambiguous Concatenation and C.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Papers.- Genome Halving Problem Revisited.- Verifying Probabilistic Procedural Programs.- Streaming Algorithms for Geometric Problems.- Toward a Grainless Semantics for Shared-Variable Concurrency.- Regular Languages, Unambiguou…s Concatenation and Computational Complexity.- Contributed Papers.- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.- On the Urgency Expressiveness.- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages.- A Decidable Fragment of Separation Logic.- Approximate Range Searching Using Binary Space Partitions.- Representable Disjoint NP-Pairs.- Symbolic Reachability Analysis of Higher-Order Context-Free Processes.- Optimal Strategies in Priced Timed Game Automata.- A Calculus for Trust Management.- Short-Cuts on Star, Source and Planar Unfoldings.- Subdividing Alpha Complex.- Real-Counter Automata and Their Decision Problems.- Adjunct Elimination Through Games in Static Ambient Logic.- On the Bisimulation Invariant Fragment of Monadic 1 in the Finite.- On the Complexity of Hilbert's 17th Problem.- Who is Pointing When to Whom .- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix.- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.- Minimum Weight Pseudo-Triangulations.- Join Algorithms for the Theory of Uninterpreted Functions.- No, Coreset, No Cry.- Hardness Hypotheses, Derandomization, and Circuit Complexity.- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract.- Learning Languages from Positive Data and a Finite Number of Queries.- The Complexity of the Local Hamiltonian Problem.-Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.- Adaptive Stabilization of Reactive Protocols.- Visibly Pushdown Games.- Refinement and Separation Contexts.- Decidability of MSO Theories of Tree Structures.- Distributed Algorithms for Coloring and Domination in Wireless AdHoc Networks.- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.- Testing Geometric Convexity.- Complexity of Linear Connectivity Problems in Directed Hypergraphs.- Actively Learning to Verify Safety for FIFO Automata.- Reasoning About Game Equilibria Using Temporal Logic.- Alternation in Equational Tree Automata Modulo XOR.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 556 pp. Englisch.
