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) 2012 (50) 2013 (47) 2014 (55) 2015 (50) 2016 (52) 2017 (48) 2018 (51)
Publication types (Num. hits)
inproceedings(1329) proceedings(35)
Venues (Conferences, Journals, ...)
FSTTCS(1364)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 162 occurrences of 145 keywords

Results
Found 1364 publication records. Showing 1364 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pierre Ganty, Elena Gutiérrez The Parikh Property for Weighted Context-Free Grammars. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier Parameterized Dynamic Cluster Editing. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexandre Debant, Stéphanie Delaune, Cyrille Wiedling A Symbolic Framework to Analyse Physical Proximity in Security Protocols. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Swaroop N. Prabhakar, Vikram Sharma 0001 Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kazuyuki Asada, Naoki Kobayashi 0001 Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg 0001, Martin Hoefer, Kurt Mehlhorn On Fair Division for Indivisible Items. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Béatrice Bérard, Stefan Haar, Loïc Hélouët Hyper Partial Order Logic. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Siddhesh Chaubal, Anna Gál New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan 0001 On the Probabilistic Degree of OR over the Reals. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ola Svensson Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl On Canonical Models for Rational Functions over Infinite Words. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Furio Honsell, Luigi Liquori, Claude Stolze, Ivan Scagnetto The Delta-Framework. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Mansutti Extending Propositional Separation Logic for Robustness Properties. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alain Finkel, Jérôme Leroux, Grégoire Sutre Reachability for Two-Counter Machines with One Test and One Reset. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah Graph Pattern Polynomials. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1A. Prasad Sistla Model Checking Randomized Security Protocols (Invited Paper). Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ágnes Cseh, Telikepalli Kavitha Popular Matchings in Complete Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anantha Padmanabha, R. Ramanujam, Yanjing Wang Bundled Fragments of First-Order Modal Logic: (Un)Decidability. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bhaskar Ray Chaudhury, Kurt Mehlhorn Combinatorial Algorithms for General Linear Arrow-Debreu Markets. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Amy Babay, Michael Dinitz, Zeyu Zhang Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marc Bagnol, Denis Kuperberg Büchi Good-for-Games Automata Are Efficiently Recognizable. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Faried Abu Zaid Uniformly Automatic Classes of Finite Structures. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Elazar Goldenberg, Karthik C. S. Towards a General Direct Product Testing Theorem. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Umang Bhaskar, Abheek Ghosh On the Welfare of Cardinal Voting Mechanisms. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee On the Inner Product Predicate and a Generalization of Matching Vector Families. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rupak Majumdar Random Testing for Distributed Systems with Theoretical Guarantees (Invited Paper). Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Deepanjan Kesh Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sumit Ganguly, Paritosh K. Pandya (eds.) 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, Shaan Vaidya Verification of Timed Asynchronous Programs. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gilles Geeraerts, Shibashis Guha, Jean-François Raskin Safe and Optimal Scheduling for Hard and Soft Tasks. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manisha Bansal, Naveen Garg 0001, Neelima Gupta A 5-Approximation for Universal Facility Location. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier Symbolic Approximation of Weighted Timed Games. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Place, Marc Zeitoun The Complexity of Separation for Levels in Concatenation Hierarchies. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan On the Parameterized Complexity of [1, j]-Domination Problems. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ramprasad Saptharishi, Anamay Tengse Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Santosh Vempala Continuous Algorithms (Invited Paper). Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Bhaskar Ray Chaudhury Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vincent Penelle, Sylvain Salvati, Grégoire Sutre On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Faried Abu Zaid, Chris Köcher The Cayley-Graph of the Queue Monoid: Logic and Decidability. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Baelde, Anthony Lick, Sylvain Schmitz A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Udi Boker, Karoliina Lehtinen On the Way to Alternating Weak Automata. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Satya V. Lokam, R. Ramanujam (eds.) 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Stéphane Le Roux 0001, Arno Pauly, Mickael Randour Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee 0001 Shortest k-Disjoint Paths via Determinants. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method". Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sumedh Tirodkar Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Béatrice Bérard, Serge Haddad, Engel Lefaucheux Probabilistic Disclosure: Maximisation vs. Minimisation. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guru Guruganesh, Euiwoong Lee Understanding the Correlation Gap For Matchings. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thomas Wilke Backward Deterministic Büchi Automata on Infinite Words. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari An Improved Dictatorship Test with Perfect Completeness. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pawel Parys The Complexity of the Diagonal Problem for Recursion Schemes. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bartosz Bednarczyk, Witold Charatonik Modulo Counting on Words and Trees. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akash Kumar 0003, Anand Louis, Madhur Tulsiani Finding Pseudorandom Colorings of Pseudorandom Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anurag Anshu, Dmitry Gavinsky, Rahul Jain 0001, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal A Composition Theorem for Randomized Query Complexity. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka Local Patterns. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Rishi Saket Hardness of Rainbow Coloring Hypergraphs. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alina Ene, Viswanath Nagarajan, Rishi Saket Approximation Algorithms for Stochastic k-TSP. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Orna Kupferman, Gal Vardi, Moshe Y. Vardi Flow Games. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath Maintaining Reeb Graphs of Triangulated 2-Manifolds. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Joseph Boninger, Joshua Brody, Owen Kephart Non-Adaptive Data Structure Bounds for Dynamic Predecessor. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Nikhil S. Mande A Lifting Theorem with Applications to Symmetric Functions. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dileep Kini, Mahesh Viswanathan 0001 Complexity of Model Checking MDPs against LTL Specifications. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vinod Vaikuntanathan Some Open Problems in Information-Theoretic Cryptography. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jakub Michaliszyn, Jan Otop Average Stack Cost of Büchi Pushdown Automata. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stéphane Demri, Étienne Lozes, Denis Lugiez On Symbolic Heaps Modulo Permission Theories. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexander Weinert VLDL Satisfiability and Model Checking via Tree Automata. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, R. Krithika 0001, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan On the Parameterized Complexity of Simultaneous Deletion Problems. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Krebs, Nutan Limaye, Michael Ludwig A Unified Method for Placing Problems in Polylogarithmic Depth. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jakub Michaliszyn, Jan Otop, Piotr Wieczorek Querying Best Paths in Graph Databases. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Apoorv Garg, Abhiram G. Ranade Train Scheduling on a Unidirectional Path. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Anca Muscholl Automated Synthesis: a Distributed Viewpoint. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yi Huang, Mano Vikash Janardhanan, Lev Reyzin Network Construction with Ordered Constraints. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi On Hashing-Based Approaches to Approximate DNF-Counting. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Luke Hinde, Ján Pich Reasons for Hardness in QBF Proof Systems. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Telikepalli Kavitha Popular Matchings with Multiple Partners. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Prateek Jain 0002, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, Aaron Sidford A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares). Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Victor Lagerkvist, Biman Roy A Dichotomy Theorem for the Inverse Satisfiability Problem. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Balanced Judicious Bipartition is Fixed-Parameter Tractable. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Edith Elkind Justified Representation in Multiwinner Voting: Axioms and Algorithms. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Blondin, Alain Finkel, Jean Goubault-Larrecq Forward Analysis for WSTS, Part III: Karp-Miller Trees. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hugo Gimbert On the Control of Asynchronous Automata. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan Verification of Asynchronous Programs with Nested Locks. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yixin Cao 0001, Yuping Ke, Yota Otachi, Jie You Vertex Deletion Problems on Chordal Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bernd Finkbeiner, Paul Gölz Synthesis in Distributed Environments. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bharatram Rangarajan A Combinatorial Proof of Ihara-Bass's Formula for the Zeta Function of Regular Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rüdiger Ehlers, Bernd Finkbeiner Symmetric Synthesis. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir Monitoring for Silent Actions. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Udi Boker, Orna Kupferman, Michal Skrzypczak How Deterministic are Good-For-Games Automata?. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Onur Cagirici, Petr Hlinený, Bodhayan Roy On Colourability of Polygon Visibility Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Meghana Nasre, Prajakta Nimbhorkar Popular Matchings with Lower Quotas. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Udi Boker Rabin vs. Streett Automata. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou Streaming for Aibohphobes: Longest Palindrome with Mismatches. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Devavrat Shah Matrix Estimation, Latent Variable Model and Collaborative Filtering. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur Admissibility in Quantitative Graph Games. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1364 (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.
open data data released under the ODC-BY 1.0 license