The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "FSTTCS"( http://dblp.L3S.de/Venues/FSTTCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/fsttcs

Publication years (Num. hits)
1984 (30) 1985 (29) 1986 (32) 1987 (37) 1988 (34) 1989 (28) 1990 (31) 1991 (29) 1992 (32) 1993 (39) 1994 (37) 1995 (36) 1996 (33) 1997 (24) 1998 (35) 1999 (37) 2000 (43) 2001 (29) 2002 (32) 2003 (39) 2004 (44) 2005 (46) 2006 (39) 2007 (46) 2008 (38) 2009 (41) 2010 (45) 2011 (46)
Publication types (Num. hits)
inproceedings(983) proceedings(28)
Venues (Conferences, Journals, ...)
FSTTCS(1011)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 162 occurrences of 145 keywords

Results
Found 1011 publication records. Showing 1011 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Christian Glaßer, Christian Reitwießner, Maximilian Witek Applications of Discrepancy Theory in Multiobjective Approximation. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan Petri Net Reachability Graphs: Decidability Status of FO Properties. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala A Perfect-Information Construction for Coordination in Games. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1B. V. Raghavendra Rao, Jayalal M. N. Sarma Isomorphism testing of read-once functions and polynomials. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Göller, Markus Lohrey The First-Order Theory of Ground Tree Rewrite Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Aleksander Madry, Debmalya Panigrahi The Semi-stochastic Ski-rental Problem. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Supratik Chakraborty, Amit Kumar Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jacques Duparc, Alessandro Facchini, Filip Murlak Definable Operations On Weakly Recognizable Sets of Trees. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais Streamability of Nested Word Transductions. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1John Fearnley, Markus Rabe 0002, Sven Schewe, Lijun Zhang Efficient Approximation of Optimal Control for Continuous-Time Markov Games. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nathalie Bertrand, Blaise Genest Minimal Disclosure in Partially Observable Markov Decision Processes. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ocan Sankur, Patricia Bouyer, Nicolas Markey Shrinking Timed Automata. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer Dependence logic with a majority quantifier. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels Nash Equilibria in Concurrent Games with Büchi Objectives. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Harrie Jan Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König Conditional Reactive Systems. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthew Hague Parameterised Pushdown Systems with Non-Atomic Writes. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Céline Chevalier, Stéphanie Delaune, Steve Kremer Transforming Password Protocols to Compose. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Supratik Chakraborty, Amit Kumar (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  BibTeX  RDF
1Hongfei Fu, Joost-Pieter Katoen Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Geevarghese Philip, Yngve Villanger Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz Using non-convex approximations for efficient analysis of timed automata. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri Dynamic programming in faulty memory hierarchies (cache-obliviously). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Moshe Y. Vardi Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mohamed Faouzi Atig, Pierre Ganty Approximating Petri Net Reachability Along Context-free Traces. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Madhu Sudan Physical limits of Communication (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Uli Fahrenberg, Axel Legay, Claus R. Thrane The Quantitative Linear-Time--Branching-Time Spectrum. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar Rainbow Connectivity: Hardness and Tractability. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alex Bain, John C. Mitchell, Rahul Sharma 0001, Deian Stefan, Joe Zimmerman A Domain-Specific Language for Computing on Encrypted Data (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Manoj Gupta, Yogish Sabharwal, Sandeep Sen The update complexity of selection and related problems. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Emanuel Kieronski, Jakub Michaliszyn, Jan Otop Modal Logics Definable by Universal Three-Variable Formulas. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bertram Felgenhauer, Harald Zankl, Aart Middeldorp Layer Systems for Proving Confluence. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Didier Caucal, Teodor Knapik Higher order indexed monadic systems. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann Optimal Packed String Matching. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Abhijin Adiga, L. Sunil Chandran, Rogers Mathew Cubicity, Degeneracy, and Crossing Number. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yang Cai, Ting Zhang A Tight Lower Bound for Streett Complementation. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pablo Barceló, Leonid Libkin, Juan L. Reutter Parameterized Regular Expressions and Their Languages. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Umesh V. Vazirani Quantum State Description Complexity (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski Approximation Algorithms for Union and Intersection Covering Problems. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1 Author Index. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Denis Kuperberg, Michael Vanden Boom Quasi-Weak Cost Automata: A New Variant of Weakness. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Phokion G. Kolaitis Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul Obtaining a Bipartite Graph by Contracting Few Edges. Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Susanne Albers Energy-Efficient Algorithms (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pavel Pudlák On extracting computations from propositional proofs (a survey). Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Udi Boker, Orna Kupferman, Avital Steinitz Parityizing Rabin and Streett. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar Model checking time-constrained scenario-based specifications. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Backes, Matteo Maffei, Esfandiar Mohammadi Computationally Sound Abstraction and Verification of Secure Multi-Party Computations. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun Place-Boundedness for Vector Addition Systems with one zero-test. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sara Capecchi, Elena Giachino, Nobuko Yoshida Global Escape in Multiparty Sessions. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Matthew Hague, Anthony Widjaja To The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin Generalized Mean-payoff and Energy Games. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten Generalizing the powerset construction, coalgebraically. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Wieslaw Zielonka Playing in stochastic environment: from multi-armed bandits to two-player games. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kamal Lodaya, Meena Mahajan (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  BibTeX  RDF
1Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider Satisfiability of Acyclic and Almost Acyclic CNF Formulas. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal Finding Independent Sets in Unions of Perfect Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Fabio Mogavero, Aniello Murano, Moshe Y. Vardi Reasoning About Strategies. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Sofya Raskhodnikova, Ge Ruan Finding Sparser Directed Spanners. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ahmet Kara, Thomas Schwentick, Thomas Zeume Temporal Logics on Words with Multiple Data Values. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh The effect of girth on the kernelization complexity of Connected Dominating Set. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner Graph Isomorphism is not AC^0 reducible to Group Isomorphism. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf New Results on Quantum Property Testing. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell Computing Rational Radical Sums in Uniform TC^0. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Bruno Courcelle Special tree-width and the verification of monadic second-order graph pr operties. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Petr Hlinený, Jan Obdrzálek Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Kousha Etessami One-Counter Stochastic Games. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir Minimizing Busy Time in Multiple Machine Real-time Scheduling. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey ATL with Strategy Contexts: Expressiveness and Model Checking. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rajeev Alur, Pavol Cerný Expressiveness of streaming string transducers. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefan Schulz First-Order Logic with Reachability Predicates on Infinite Systems. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kamal Lodaya, Meena Mahajan Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gagan Goel, Pushkar Tripathi, Lei Wang 0010 Combinatorial Problems with Discounted Price Functions in Multi-agent Systems. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1André Chailloux, Iordanis Kerenidis, Jamie Sikora Lower bounds for Quantum Oblivious Transfer. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sven Schewe Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Santosh Vempala Recent Progress and Open Problems in Algorithmic Convex Geometry. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Cyril Nicaud, Carine Pivoteau, Benoît Razet Average Analysis of Glushkov Automata under a BST-Like Model. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh Determining the Winner of a Dodgson Election is Hard. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Blaise Genest, Anca Muscholl, Zhilin Wu Verifying Recursive Active Documents with Positive Data Tree Rewriting. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mohamed Faouzi Atig Global Model Checking of Ordered Multi-Pushdown Systems. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Slawomir Lasota Fast equivalence-checking for normed context-free processes. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Qi Ge, Daniel Stefankovic A graph polynomial for independent sets of bipartite graphs. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rishi Saket Quasi-Random PCP and Hardness of 2-Catalog Segmentation. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Eugene Asarin, Aldric Degorre Two Size Measures for Timed Languages. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Nicholas Radcliffe, Rakesh M. Verma Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan Model Checking Concurrent Programs with Nondeterminism and Randomization. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland Non-Local Box Complexity and Secure Function Evaluation. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr Fractional Pebbling and Thrifty Branching Programs. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Julien Cristau Automata and temporal logic over arbitrary linear time. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Soumya Paul, Sunil Easaw Simon Nash Equilibrium in Generalised Muller Games. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Chandan Saha, Ramprasad Saptharishi, Nitin Saxena The Power of Depth 2 Circuits over Algebras. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joachim Kneis, Alexander Langer, Peter Rossmanith A Fine-grained Analysis of a Simple Independent Set Algorithm. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Chien-Chung Huang, Zoya Svitkina Donation Center Location Problem. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar Mediating for Reduction (on Minimizing Alternating Büchi Automata). Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Javier Esparza, Stefan Kiefer On the Memory Consumption of Probabilistic Pushdown Automata. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1011 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.