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) 2019 (53) 2020 (60) 2021 (54) 2022 (46) 2023 (45)
Publication types (Num. hits)
inproceedings(1582) proceedings(40)
Venues (Conferences, Journals, ...)
FSTTCS(1622)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 162 occurrences of 145 keywords

Results
Found 1622 publication records. Showing 1622 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
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
1Umang Bhaskar, Abheek Ghosh On the Welfare of Cardinal Voting Mechanisms. 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
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
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
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
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
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
1A. Prasad Sistla Model Checking Randomized Security Protocols (Invited Paper). Search on Bibsonomy FSTTCS The full citation details ... 2018 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
1Venkatesan Guruswami, Rishi Saket Hardness of Rainbow Coloring Hypergraphs. Search on Bibsonomy FSTTCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal 0001, R. Krithika 0001, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan 0001 On the Parameterized Complexity of Simultaneous Deletion Problems. 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
1Pawel Parys The Complexity of the Diagonal Problem for Recursion Schemes. 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
1 Front Matter, Table of Contents, Preface, Conference Organization. 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
1Thomas Wilke Backward Deterministic Büchi Automata on Infinite Words. 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
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
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
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
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
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
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
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
1Bartosz Bednarczyk, Witold Charatonik Modulo Counting on Words and Trees. 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
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
1Hugo Gimbert On the Control of Asynchronous Automata. 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
1Orna Kupferman, Gal Vardi, Moshe Y. Vardi Flow Games. 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
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
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
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
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
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
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
1Udi Boker Rabin vs. Streett Automata. 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
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
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
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
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
1Anca Muscholl Automated Synthesis: a Distributed Viewpoint. 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
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
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
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
1Apoorv Garg, Abhiram G. Ranade Train Scheduling on a Unidirectional Path. 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
1Florian Brandl, Telikepalli Kavitha Popular Matchings with Multiple Partners. Search on Bibsonomy FSTTCS The full citation details ... 2017 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
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
1Alexander Weinert, Martin Zimmermann 0002 Visibly Linear Dynamic Logic. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Sanjukta Roy Stable Matching Games: Manipulation via Subgraph Isomorphism. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Aritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot Fréchet Distance Between a Line and Avatar Point Set. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bartek Klin, Slawomir Lasota 0001, Joanna Ochremiak, Szymon Torunczyk Homomorphism Problems for First-Order Definable Structures. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tevfik Bultan Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1R. Krithika 0001, Pranabendu Misra, Ashutosh Rai 0001, Prafullkumar Tale Lossy Kernels for Graph Contraction Problems. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu Local Testing for Membership in Lattices. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo Mixed-Criticality Scheduling to Minimize Makespan. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amit Deshpande 0001, Prahladh Harsha, Rakesh Venkat Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Krishnamoorthy Dinesh 0001, Sajin Koroth, Jayalal Sarma Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Umang Bhaskar, Ajil Jalal, Rahul Vaze The Adwords Problem with Strict Capacity Constraints. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ashutosh Rai 0001, M. S. Ramanujan 0001 Strong Parameterized Deletion: Bipartite Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ramya C., B. V. Raghavendra Rao Sum of Products of Read-Once Formulas. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Aleksander Madry Continuous Optimization: The "Right" Language for Graph Algorithms? (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jaroslav Bendík, Nikola Benes, Ivana Cerná, Jiri Barnat Tunable Online MUS/MSS Enumeration. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig One-Counter Automata with Counter Observability. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar Model Checking Population Protocols. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mithilesh Kumar 0001, Daniel Lokshtanov Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova The Power and Limitations of Uniform Samples in Testing Properties of Figures. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Prahladh Harsha, Srikanth Srinivasan 0001 Robust Multiplication-Based Tests for Reed-Muller Codes. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Kim G. Larsen, Radu Mardare, Bingtian Xue Probabilistic Mu-Calculus: Decidability and Complete Axiomatization. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vrunda Dave, Shankara Narayanan Krishna, Ashutosh Trivedi 0001 FO-Definable Transformations of Infinite Strings. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Maximilian P. L. Haslbeck, Tobias Nipkow Verified Analysis of List Update Algorithms. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ankit Chauhan, Tobias Friedrich 0001, Ralf Rothenberger Greed is Good for Deterministic Scale-Free Networks. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mooly Sagiv Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla Understanding Cutting Planes for QBFs. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Romain Brenguier, Guillermo A. Pérez 0001, Jean-François Raskin, Ocan Sankur Admissibility in Quantitative Graph Games. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Danny Hucke, Markus Lohrey Querying Regular Languages over Sliding Windows. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin Graph Decompositions and Algorithms (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Waldo Gálvez, Fabrizio Grandoni 0001, Salvatore Ingala, Arindam Khan 0001 Improved Pseudo-Polynomial-Time Approximation for Strip Packing. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sriram V. Pemmaraju, Vivek B. Sardeshmukh Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Felix Klein 0001, Martin Zimmermann 0002 Prompt Delay. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Xuan Bach Le, Aquinas Hobor, Anthony W. Lin Decidability and Complexity of Tree Share Formulas. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Lukás Holík, Roland Meyer 0001, Sebastian Muskalla Summaries for Context-Free Games. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Artur Jez LZ77 Factorisation of Trees. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Holger Hermanns My O Is Bigger Than Yours (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mrinal Kumar 0001, Ramprasad Saptharishi Finer Separations Between Shallow Arithmetic Circuits. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Emmanuel Filiot, Olivier Gauwin, Nathan Lhote Aperiodicity of Rational Functions Is PSPACE-Complete. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek Most Likely Voronoi Diagrams in Higher Dimensions. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anindya Banerjee 0001, David A. Naumann, Mohammad Nikouei Relational Logic with Framing and Hypotheses. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #301 - #400 of 1622 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license