The Resource FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)
FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)
Resource Information
The item FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri-St. Louis Libraries.
This item is available to borrow from 1 library branch.
- Language
- eng
- Extent
- xiii, 532 pages
- Contents
-
- Frequency assignment in mobile phone systems
- Martin Grötschel
- Data provenance: some basic issues
- Peter Buneman, Sanjeev Khanna, and Wang-Chiew Tan
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
- Sachin B. Patkar and H. Narayanan
- On-line edge-coloring with a fixed number of colors
- Lene Monrad Favrholdt and Morten Nyhave Nielsen
- On approximability of the independent/connected edge dominating set problems
- Toshihiro Fujito
- Model checking: theory into practice
- Model checking CTL properties of pushdown systems
- Igor Walukiewicz
- Decidable dense branching-time temporal logic
- Salvatore La Torre and Margherita Napoli
- Fair equivalence relations
- Orna Kupferman, Nir Piterman, and Moshe Y. Vardi
- Arithmetic circuits and polynomial replacement systems
- Pierre McKenzie, Heribert Vollmer, and Klaus W. Wagner
- Depth-3 arithmetic circuits for s2n(X) and extensions of the graham-pollack theorem
- Jaikumar Radhakrishnan, Pranab Sen, and Sundar Vishwanathan
- E. Allen Emerson
- Bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite
- Olivier Ly
- Combining semantics with non-standard interpreter hierarchies
- Sergei Abramov and Robert Glück
- Using modes to ensure subject reduction fot typed logic programs with subtyping
- Jan-Georg Smaus, François Fages, and Pierre Deransart
- Dynamically ordered probabilistic choice logic programming
- Marina De Vos and Dirk Vermeir
- Coordinatized kernels and catalytic reductions: an improved FPT algorithm for max leaf spanning tree and other problems
- Michael R. Fellows ... [et al.]
- Algebra for XML query
- Planar graph blocking for external searching
- Surender Baswana and Sandeep Sen
- Complete fragment of higher-order duration u-calculus
- Dimitar P. Guelev
- Complete axiomatisation for timed automata
- Huimin Lin and Wang Yi
- Text sparsification via local maxima
- Pilu Crescenzi ... [et al.]
- Approximate swapped matching
- Amihood Amir, Moshe Lewenstein, and Ely Porat
- Mary Fernandez, Jerome Simeon, and Philip Wadler
- Semantic theory for heterogeneous system design
- Rance Cleaveland and Gerald Lǔttgen
- Formal verification of the ricart-agrawala algorithm
- Ekaterina Sedletsky, Amir Pnueli, and Mordechai Ben-Ari
- On distribution-specific learning with membership queries versus pseudorandom generation
- Johannes Köbler and Wolfgang Lindner
- 0p2-completeness: a classical approach for new results
- Holger Spakowski and Jörg Vogel
- Is the standard proof system for SAT P-optimal?
- Johannes Köbler and Jochen Messner
- Irrugularities of distribution, derandomization, and complexity theory
- General framework for types in graph rewriting
- Barbara König
- Ground congruence for chi calculus
- Yuxi Fu and Zhenrong Yang
- Inheritance in the joint calculus
- Cédric Fournet ... [et al.]
- Approximation algorithms for bandwidth and storage allocation problems under real time constraints
- Stefano Leonardi, Alberto Marchetti-Spaccamela, and Andrea Vitaletti
- Dynamic spectrum allocation: the impotency of duration notificaion
- Bala Kalyanasundaram and Kirk Pruhs
- Bernard Chazelle
- Fine structure of game lambda models
- Pietro Di Gianantonio and Gianluca Franco
- Stron normalization of second order symmetric [pi]-calculus
- Michel Parigot
- Scheduling to minimize the average completion time of dedicated tasks
- Foto Afrati ... [et al.]
- Hunting for functionally analogous genes
- Michael T. Hallett and Jens Lagergren
- Keeping track of the latest gossip in shared memory systems
- Bharat Adsul, Aranyak Mehta, and Milind Sohoni
- Rewriting logic as a metalogical framework
- Concurrent knowledge and logical clock abstractions
- Ajay D. Kshemkalyani
- Decidable hierarchies of starfree languages
- Christian Glaber and Heinz Schmitz
- Prefix languages of church-rosser languages
- Jens R. Woinowski
- David Basin, Manuel Clavel, and José Meseguer
- Isbn
- 9783540414131
- Label
- FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings
- Title
- FST TCS 2000
- Title remainder
- foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings
- Statement of responsibility
- Sanjiv Kapoor, Sanjiva Prasad (eds.)
- Title variation
- Foundations of software technology and theoretical computer science
- Language
- eng
- Additional physical form
- Also available by subscription via the World Wide Web.
- Cataloging source
- OHX
- Illustrations
- illustrations
- Index
- index present
- Literary form
- non fiction
- http://bibfra.me/vocab/lite/meetingDate
- 2000
- http://bibfra.me/vocab/lite/meetingName
- Conference on Foundations of Software Technology and Theoretical Computer Science
- Nature of contents
- bibliography
- http://library.link/vocab/relatedWorkOrContributorDate
- 1959-
- http://library.link/vocab/relatedWorkOrContributorName
-
- Kapoor, Sanjiv
- Prasad, Sanjiva
- Series statement
- Lecture notes in computer science,
- Series volume
- 1974
- http://library.link/vocab/subjectName
-
- Software engineering
- Computer science
- Label
- FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- volume
- Carrier category code
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
- txt
- Content type MARC source
- rdacontent
- Contents
-
- Frequency assignment in mobile phone systems
- Martin Grötschel
- Data provenance: some basic issues
- Peter Buneman, Sanjeev Khanna, and Wang-Chiew Tan
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
- Sachin B. Patkar and H. Narayanan
- On-line edge-coloring with a fixed number of colors
- Lene Monrad Favrholdt and Morten Nyhave Nielsen
- On approximability of the independent/connected edge dominating set problems
- Toshihiro Fujito
- Model checking: theory into practice
- Model checking CTL properties of pushdown systems
- Igor Walukiewicz
- Decidable dense branching-time temporal logic
- Salvatore La Torre and Margherita Napoli
- Fair equivalence relations
- Orna Kupferman, Nir Piterman, and Moshe Y. Vardi
- Arithmetic circuits and polynomial replacement systems
- Pierre McKenzie, Heribert Vollmer, and Klaus W. Wagner
- Depth-3 arithmetic circuits for s2n(X) and extensions of the graham-pollack theorem
- Jaikumar Radhakrishnan, Pranab Sen, and Sundar Vishwanathan
- E. Allen Emerson
- Bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite
- Olivier Ly
- Combining semantics with non-standard interpreter hierarchies
- Sergei Abramov and Robert Glück
- Using modes to ensure subject reduction fot typed logic programs with subtyping
- Jan-Georg Smaus, François Fages, and Pierre Deransart
- Dynamically ordered probabilistic choice logic programming
- Marina De Vos and Dirk Vermeir
- Coordinatized kernels and catalytic reductions: an improved FPT algorithm for max leaf spanning tree and other problems
- Michael R. Fellows ... [et al.]
- Algebra for XML query
- Planar graph blocking for external searching
- Surender Baswana and Sandeep Sen
- Complete fragment of higher-order duration u-calculus
- Dimitar P. Guelev
- Complete axiomatisation for timed automata
- Huimin Lin and Wang Yi
- Text sparsification via local maxima
- Pilu Crescenzi ... [et al.]
- Approximate swapped matching
- Amihood Amir, Moshe Lewenstein, and Ely Porat
- Mary Fernandez, Jerome Simeon, and Philip Wadler
- Semantic theory for heterogeneous system design
- Rance Cleaveland and Gerald Lǔttgen
- Formal verification of the ricart-agrawala algorithm
- Ekaterina Sedletsky, Amir Pnueli, and Mordechai Ben-Ari
- On distribution-specific learning with membership queries versus pseudorandom generation
- Johannes Köbler and Wolfgang Lindner
- 0p2-completeness: a classical approach for new results
- Holger Spakowski and Jörg Vogel
- Is the standard proof system for SAT P-optimal?
- Johannes Köbler and Jochen Messner
- Irrugularities of distribution, derandomization, and complexity theory
- General framework for types in graph rewriting
- Barbara König
- Ground congruence for chi calculus
- Yuxi Fu and Zhenrong Yang
- Inheritance in the joint calculus
- Cédric Fournet ... [et al.]
- Approximation algorithms for bandwidth and storage allocation problems under real time constraints
- Stefano Leonardi, Alberto Marchetti-Spaccamela, and Andrea Vitaletti
- Dynamic spectrum allocation: the impotency of duration notificaion
- Bala Kalyanasundaram and Kirk Pruhs
- Bernard Chazelle
- Fine structure of game lambda models
- Pietro Di Gianantonio and Gianluca Franco
- Stron normalization of second order symmetric [pi]-calculus
- Michel Parigot
- Scheduling to minimize the average completion time of dedicated tasks
- Foto Afrati ... [et al.]
- Hunting for functionally analogous genes
- Michael T. Hallett and Jens Lagergren
- Keeping track of the latest gossip in shared memory systems
- Bharat Adsul, Aranyak Mehta, and Milind Sohoni
- Rewriting logic as a metalogical framework
- Concurrent knowledge and logical clock abstractions
- Ajay D. Kshemkalyani
- Decidable hierarchies of starfree languages
- Christian Glaber and Heinz Schmitz
- Prefix languages of church-rosser languages
- Jens R. Woinowski
- David Basin, Manuel Clavel, and José Meseguer
- Control code
- 45543011
- Dimensions
- 24 cm
- Dimensions
- unknown
- Extent
- xiii, 532 pages
- Isbn
- 9783540414131
- Isbn Type
- (pbk.)
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
- n
- Other physical details
- illustrations
- Specific material designation
- remote
- Label
- FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)
- Bibliography note
- Includes bibliographical references and index
- Carrier category
- volume
- Carrier category code
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
- txt
- Content type MARC source
- rdacontent
- Contents
-
- Frequency assignment in mobile phone systems
- Martin Grötschel
- Data provenance: some basic issues
- Peter Buneman, Sanjeev Khanna, and Wang-Chiew Tan
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
- Sachin B. Patkar and H. Narayanan
- On-line edge-coloring with a fixed number of colors
- Lene Monrad Favrholdt and Morten Nyhave Nielsen
- On approximability of the independent/connected edge dominating set problems
- Toshihiro Fujito
- Model checking: theory into practice
- Model checking CTL properties of pushdown systems
- Igor Walukiewicz
- Decidable dense branching-time temporal logic
- Salvatore La Torre and Margherita Napoli
- Fair equivalence relations
- Orna Kupferman, Nir Piterman, and Moshe Y. Vardi
- Arithmetic circuits and polynomial replacement systems
- Pierre McKenzie, Heribert Vollmer, and Klaus W. Wagner
- Depth-3 arithmetic circuits for s2n(X) and extensions of the graham-pollack theorem
- Jaikumar Radhakrishnan, Pranab Sen, and Sundar Vishwanathan
- E. Allen Emerson
- Bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite
- Olivier Ly
- Combining semantics with non-standard interpreter hierarchies
- Sergei Abramov and Robert Glück
- Using modes to ensure subject reduction fot typed logic programs with subtyping
- Jan-Georg Smaus, François Fages, and Pierre Deransart
- Dynamically ordered probabilistic choice logic programming
- Marina De Vos and Dirk Vermeir
- Coordinatized kernels and catalytic reductions: an improved FPT algorithm for max leaf spanning tree and other problems
- Michael R. Fellows ... [et al.]
- Algebra for XML query
- Planar graph blocking for external searching
- Surender Baswana and Sandeep Sen
- Complete fragment of higher-order duration u-calculus
- Dimitar P. Guelev
- Complete axiomatisation for timed automata
- Huimin Lin and Wang Yi
- Text sparsification via local maxima
- Pilu Crescenzi ... [et al.]
- Approximate swapped matching
- Amihood Amir, Moshe Lewenstein, and Ely Porat
- Mary Fernandez, Jerome Simeon, and Philip Wadler
- Semantic theory for heterogeneous system design
- Rance Cleaveland and Gerald Lǔttgen
- Formal verification of the ricart-agrawala algorithm
- Ekaterina Sedletsky, Amir Pnueli, and Mordechai Ben-Ari
- On distribution-specific learning with membership queries versus pseudorandom generation
- Johannes Köbler and Wolfgang Lindner
- 0p2-completeness: a classical approach for new results
- Holger Spakowski and Jörg Vogel
- Is the standard proof system for SAT P-optimal?
- Johannes Köbler and Jochen Messner
- Irrugularities of distribution, derandomization, and complexity theory
- General framework for types in graph rewriting
- Barbara König
- Ground congruence for chi calculus
- Yuxi Fu and Zhenrong Yang
- Inheritance in the joint calculus
- Cédric Fournet ... [et al.]
- Approximation algorithms for bandwidth and storage allocation problems under real time constraints
- Stefano Leonardi, Alberto Marchetti-Spaccamela, and Andrea Vitaletti
- Dynamic spectrum allocation: the impotency of duration notificaion
- Bala Kalyanasundaram and Kirk Pruhs
- Bernard Chazelle
- Fine structure of game lambda models
- Pietro Di Gianantonio and Gianluca Franco
- Stron normalization of second order symmetric [pi]-calculus
- Michel Parigot
- Scheduling to minimize the average completion time of dedicated tasks
- Foto Afrati ... [et al.]
- Hunting for functionally analogous genes
- Michael T. Hallett and Jens Lagergren
- Keeping track of the latest gossip in shared memory systems
- Bharat Adsul, Aranyak Mehta, and Milind Sohoni
- Rewriting logic as a metalogical framework
- Concurrent knowledge and logical clock abstractions
- Ajay D. Kshemkalyani
- Decidable hierarchies of starfree languages
- Christian Glaber and Heinz Schmitz
- Prefix languages of church-rosser languages
- Jens R. Woinowski
- David Basin, Manuel Clavel, and José Meseguer
- Control code
- 45543011
- Dimensions
- 24 cm
- Dimensions
- unknown
- Extent
- xiii, 532 pages
- Isbn
- 9783540414131
- Isbn Type
- (pbk.)
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
- n
- Other physical details
- illustrations
- Specific material designation
- remote
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.umsl.edu/portal/FST-TCS-2000--foundations-of-software-technology/5rgMuaIzm8o/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/FST-TCS-2000--foundations-of-software-technology/5rgMuaIzm8o/">FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of Missouri-St. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.umsl.edu/portal/FST-TCS-2000--foundations-of-software-technology/5rgMuaIzm8o/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/FST-TCS-2000--foundations-of-software-technology/5rgMuaIzm8o/">FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of Missouri-St. Louis Libraries</a></span></span></span></span></div>
