The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

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

Publication years (Num. hits)
1990 (37) 1991 (38) 1992 (40) 1993 (38) 1994 (38) 1995 (41) 1996 (45) 1997 (29) 1998 (42) 1999 (39) 2000 (43) 2001 (39) 2002 (40) 2003 (34) 2004 (34) 2005 (43) 2006 (35) 2007 (34) 2008 (40) 2009 (42) 2010 (41) 2011 (37) 2012 (40) 2013 (39) 2014 (40) 2015 (40) 2016 (39) 2017 (42) 2018 (44) 2019 (43) 2020 (52) 2021 (38) 2022 (39) 2023 (41)
Publication types (Num. hits)
inproceedings(1312) proceedings(34)
Venues (Conferences, Journals, ...)
CONCUR(1346)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 101 occurrences of 66 keywords

Results
Found 1346 publication records. Showing 1346 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jérémy Ledent, Samuel Mimram A Sound Foundation for the Topological Approach to Task Solvability. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ulrich Dorsch, Stefan Milius, Lutz Schröder Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Giorgio Bacci, Giovanni Bacci 0001, Kim G. Larsen, Radu Mardare, Qiyi Tang 0001, Franck van Breugel Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dmitry Chistikov 0001, Andrzej S. Murawski, David Purser Asymmetric Distances for Approximate Differential Privacy. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nathalie Bertrand 0001, Patricia Bouyer, Anirban Majumdar 0002 Reconfiguration and Message Losses in Parameterized Broadcast Networks. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marc de Visme Event Structures for Mixed Choice. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marta Z. Kwiatkowska Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper). Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alain Finkel, M. Praveen Verification of Flat FIFO Systems. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Udi Boker, Karoliina Lehtinen Good for Games Automata: From Nondeterminism to Alternation. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joël Ouaknine Program Invariants (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hendrik Maarand, Tarmo Uustalu Reordering Derivatives of Trace Closures of Regular Languages. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen Alternating Weak Automata from Universal Trees. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luís Caires, Jorge A. Pérez 0001, Frank Pfenning, Bernardo Toninho Domain-Aware Session Types. Search on Bibsonomy CONCUR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Slawomir Lasota 0001, Roland Meyer 0001, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan Regular Separability of Well-Structured Transition Systems. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya Logics Meet 1-Clock Alternating Timed Automata. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy Verification of Immediate Observation Population Protocols. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Roland Meyer 0001, Sebastian Muskalla, Georg Zetzsche Bounded Context Switching for Valence Systems. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ronny Tredup, Christian Rosenke Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nima Roohi, Pavithra Prabhakar, Mahesh Viswanathan 0001 Relating Syntactic and Semantic Perturbations of Hybrid Automata. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ichiro Hasuo Coalgebraic Theory of Büchi and Parity Automata: Fixed-Point Specifications, Categorically (Invited Tutorial). Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Radu Grigore, Stefan Kiefer Selective Monitoring. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke Universal Safety for Timed Petri Nets is PSPACE-complete. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andy Polyakov, Ming-Hsien Tsai 0001, Bow-Yaw Wang, Bo-Yin Yang Verifying Arithmetic Assembly Programs in Cryptographic Primitives (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Véronique Bruyère, Quentin Hautem, Jean-François Raskin Parameterized complexity of games with monotonically ordered omega-regular objectives. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jan Kretínský, Alexej Rotar The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Blondin, Javier Esparza, Antonín Kucera 0001 Automatic Analysis of Expected Termination Time for Population Protocols. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan Reachability in Timed Automata with Diagonal Constraints. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sergey Goncharov 0001, Julian Jakob, Renato Neves A Semantics for Hybrid Iteration. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tomasz Brengos A Coalgebraic Take on Regular and omega-Regular Behaviour for Systems with Internal Moves. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Kragl, Shaz Qadeer, Thomas A. Henzinger Synchronizing the Asynchronous. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kartik Nagar, Suresh Jagannathan Automated Detection of Serializability Violations Under Weak Consistency. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Filippo Bonchi, Barbara König 0001, Daniela Petrisan Up-To Techniques for Behavioural Metrics via Fibrations. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jakub Michaliszyn, Jan Otop Non-deterministic Weighted Automata on Random Words. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Luca Aceto, Ian Cassar, Adrian Francalanza, Anna Ingólfsdóttir On Runtime Enforcement via Suppressions. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Amina Doumane, Damien Pous Completeness for Identity-free Kleene Lattices. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Moshe Y. Vardi The Siren Song of Temporal Synthesis (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jan Kretínský, Guillermo A. Pérez 0001, Jean-François Raskin Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Piotr Hofman, Slawomir Lasota 0001 Linear Equations with Ordered Data. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrey Gorlin, C. R. Ramakrishnan 0001 Separable GPL: Decidable Model Checking with More Non-Determinism. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sven Schewe, Lijun Zhang 0001 (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  BibTeX  RDF
1Massimo Bartoletti, Laura Bocchi, Maurizio Murgia 0001 Progress-Preserving Refinements of CTA. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan Verifying Quantitative Temporal Properties of Procedural Programs. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paulin Fournier, Hugo Gimbert Alternating Nonzero Automata. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jure Kukovec, Igor Konnov 0001, Josef Widder Reachability in Parameterized Systems: All Flavors of Threshold Automata. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Barbara König 0001, Christina Mika-Michalski (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yuxin Deng Bisimulations for Probabilistic and Quantum Processes (Invited Paper). Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Cabrera, Tobias Heindel, Reiko Heckel, Barbara König 0001 Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Qiyi Tang 0001, Franck van Breugel Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stephanie Balzer, Frank Pfenning, Bernardo Toninho A Universal Session Type for Untyped Asynchronous Communication. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell 0001 Effective Divergence Analysis for Linear Recurrence Sequences. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rob van Glabbeek Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Blondin, Christoph Haase, Filip Mazowiecki Affine Extensions of Integer Vector Addition Systems with States. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rodica Condurache, Youssouf Oualhadj, Nicolas Troquard The Complexity of Rational Synthesis for Concurrent Games. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tyler Sorensen 0001, Hugues Evrard, Alastair F. Donaldson GPU Schedulers: How Fair Is Fair Enough?. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1S. Akshay 0001, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar Towards an Efficient Tree Automata Based Technique for Timed Systems. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi Divergence and Unique Solution of Equations. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nicolas David 0002, Claude Jard, Didier Lime, Olivier H. Roux Coverability Synthesis in Parametric Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrzej S. Murawski, Nikos Tzevelekos Higher-Order Linearisability. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nathalie Bertrand 0001, Miheer Dewaskar, Blaise Genest, Hugo Gimbert Controlling a Population. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yuxi Fu On the Power of Name-Passing Communication. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ki Yung Ahn, Ross Horne, Alwen Tiu A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1S. Akshay 0001, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep On Petri Nets with Hierarchical Special Arcs. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Paola Giannini Concurrent Reversible Sessions. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Qiyi Tang 0001, Franck van Breugel Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Guy Avni, Thomas A. Henzinger, Ventsislav Chonev Infinite-Duration Bidding Games. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Azadeh Farzan, Zachary Kincaid A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Filippo Bonchi, Joshua Holland, Dusko Pavlovic, Pawel Sobocinski 0001 Refinement for Signal Flow Graphs. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Uli Schlachter, Harro Wimmel k-Bounded Petri Net Synthesis from Modal Transition Systems. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Roland Meyer 0001, Uwe Nestmann (eds.) 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  BibTeX  RDF
1Filippo Bonchi, Alexandra Silva 0001, Ana Sokolova The Power of Convex Algebras. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Karin Quaas, Arnaud Sangnier The Complexity of Flat Freeze LTL. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yuan Feng 0001, Ernst Moritz Hahn, Andrea Turrini, Shenggang Ying Model Checking Omega-regular Properties for Quantum Markov Chains . Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Luca Aceto, Ignacio Fábregas, Álvaro García-Pérez, Anna Ingólfsdóttir, Yolanda Ortega-Mallén Rule Formats for Nominal Process Calculi. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva 0001, Fabio Zanasi Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Julian Gutierrez 0001, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge Nash Equilibrium and Bisimulation Invariance. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nicolas Basset, Jean Mairesse, Michèle Soria Uniform Sampling for Networks of Automata. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hongseok Yang Probabilistic Programming (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Serge Haddad, Vincent Jugé Unbounded Product-Form Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop Bidirectional Nested Weighted Automata. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Orna Kupferman, Gal Vardi Flow Logic. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik Divide and Congruence III: Stability & Divergence. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nathanaël Fijalkow, Cristian Riveros, James Worrell 0001 Probabilistic Automata of Bounded Ambiguity. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ahmed Bouajjani, Constantin Enea, Chao Wang 0069 Checking Linearizability of Concurrent Priority Queues. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Paul Brunet, Damien Pous, Georg Struth On Decidability of Concurrent Kleene Algebra. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thomas Chatain, Loïc Paulevé Goal-Driven Unfolding of Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Taolue Chen, Fu Song, Zhilin Wu Tractability of Separation Logic with Inductive Definitions: Beyond Lists. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur Admissibility in Games with Imperfect Information (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma Model-Checking Counting Temporal Logics on Flat Structures. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mingzhang Huang, Qiang Yin 0002 Two Lower Bounds for BPA. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrea Cerone, Alexey Gotsman, Hongseok Yang Algebraic Laws for Weak Consistency. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann Efficient Coalgebraic Partition Refinement. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig Data Multi-Pushdown Automata. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen 0001, John Wickerson Forward Progress on GPU Concurrency (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Adrian Francalanza Consistently-Detecting Monitors. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz Soundness in Negotiations. Search on Bibsonomy CONCUR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #201 - #300 of 1346 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][>>]
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