The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for difficult with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1968 (21) 1969-1975 (21) 1976-1977 (15) 1978-1979 (18) 1980-1981 (22) 1982-1983 (17) 1984 (15) 1985 (30) 1986 (26) 1987 (51) 1988 (79) 1989 (60) 1990 (98) 1991 (67) 1992 (81) 1993 (100) 1994 (144) 1995 (224) 1996 (241) 1997 (260) 1998 (366) 1999 (537) 2000 (713) 2001 (833) 2002 (1091) 2003 (1251) 2004 (1803) 2005 (2204) 2006 (2611) 2007 (2860) 2008 (2642) 2009 (1773) 2010 (390) 2011 (44) 2012 (34) 2013 (37) 2014 (42) 2015 (33) 2016 (38) 2017 (43) 2018 (39) 2019 (56) 2020 (51) 2021 (47) 2022 (51) 2023 (59) 2024 (12)
Publication types (Num. hits)
article(3269) incollection(138) inproceedings(17827) phdthesis(16)
Venues (Conferences, Journals, ...)
HICSS(171) GECCO(164) ICRA(146) IROS(146) SAC(126) SIGCSE(119) IEEE Trans. Comput. Aided Des....(116) CHI(115) IEEE Trans. Pattern Anal. Mach...(115) IPDPS(112) DAC(104) CHI Extended Abstracts(103) WSC(95) CVPR(89) ICDAR(89) ICSE(87) More (+10 of total 2755)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 23557 occurrences of 9165 keywords

Results
Found 21250 publication records. Showing 21250 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
15Eric Schechter Constructivism Is Difficult. Search on Bibsonomy Am. Math. Mon. The full citation details ... 2001 DBLP  BibTeX  RDF
15Jason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary, Omer A. Chaudhri, John Polito What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Search on Bibsonomy Genet. Program. Evolvable Mach. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Anders J. Killander Why design methodologies are difficult to implement. Search on Bibsonomy Int. J. Technol. Manag. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15James McDonald Why Is Software Project Management Difficult? And What That Implies for Teaching Software Project Management. Search on Bibsonomy Comput. Sci. Educ. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Marco Dorigo Ant Algorithms Solve Difficult Optimization Problems. Search on Bibsonomy ECAL The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Daniel E. Callan, Keiichi Tajima, Akiko E. Callan, Reiko Akahane-Yamada, Shinobu Masaki Neural processes underlying perceptual learning of a difficult second language phonetic contrast. Search on Bibsonomy INTERSPEECH The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Qun Li, Martin J. Russell Why is automatic recognition of children's speech difficult? Search on Bibsonomy INTERSPEECH The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15William Fone Using a familiar package to demonstrate a difficult concept: using an excel spreadsheet model to explain the concepts of neural networks to undergraduates. Search on Bibsonomy ITiCSE The full citation details ... 2001 DBLP  DOI  BibTeX  RDF CAL tools, computer anxiety, neural networks, constructivist
15Kolja Sulimma, Wolfgang Kunz An exact algorithm for solving difficult detailed routing problems. Search on Bibsonomy ISPD The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Xiaodong Wang, Qingxin Meng A novel system for underwater docking in difficult situations. Search on Bibsonomy CIRA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Jarinee Chattratichart, Jasna Kuljis Why Diagrams Are Sometimes Difficult. Search on Bibsonomy INTERACT The full citation details ... 2001 DBLP  BibTeX  RDF
15Antonio Bicchi Hands for dexterous manipulation and robust grasping: a difficult road toward simplicity. Search on Bibsonomy IEEE Trans. Robotics Autom. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Marina M. Pool, Tom H. A. Van Der Voort, Johannes W. J. Beentjes, Cees M. Koolstra Background Television as an Inhibitor of Performance on Easy and Difficult Homework Assignments. Search on Bibsonomy Commun. Res. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Nancy R. Mead Why is it so Difficult to Introduce Requirements Engineering Research Results into Mainstream Requirements Engineering Practice? Search on Bibsonomy ICRE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Hermann Kaindl Why is it so Difficult to Introduce Requirements Engineering Research Results into Mainstream Requirements Engineering Practice? Search on Bibsonomy ICRE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Carlos Cabral-Cardoso A bridge over troubled water. The difficult crossing from academia to the 'real world' of industry. Search on Bibsonomy ISTAS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Tiziana Catarci, Giacinto Matarazzo, Gianluigi Raiss Usability and public administration: experiences of a difficult marriage. Search on Bibsonomy CUU The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Hermann Kaindl, Karl Frank, Ivar Jacobson, Stephen J. Mellor, Joaquin Miller, Laura Hill How difficult is the transition from OOA to OOD? (panel session). Search on Bibsonomy OOPSLA Addendum The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Hamid R. Berenji, David Vengerov Advantages of cooperation between reinforcement learning agents in difficult stochastic problems. Search on Bibsonomy FUZZ-IEEE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Pieter-Tjerk de Boer, Victor F. Nicola, Reuven Y. Rubinstein Techniques for simulating difficult queueing problems: adaptive importance sampling simulation of queueing networks. Search on Bibsonomy WSC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15J. Ángel Velázquez-Iturbide Recursion in gradual steps (is recursion really that difficult?). Search on Bibsonomy SIGCSE The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Leszek Pacholski Tutoriel II: Is it difficult to solve equations in the algebra of words. Search on Bibsonomy JFPLC The full citation details ... 2000 DBLP  BibTeX  RDF
15Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo, Wendell S. Richardsons, Rachel Harrison, William J. Sloat Characterizing a Tunably Difficult Problem in Genetic Programming. Search on Bibsonomy GECCO The full citation details ... 2000 DBLP  BibTeX  RDF
15Yang Xiang 0004, Tongsheng Chu Parallel Learning of Belief Networks in Large and Difficult Domains. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
15Francisco Casacuberta, Colin de la Higuera Optimal linguistic decoding is a difficult computational problem. Search on Bibsonomy Pattern Recognit. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
15Timothy L. McDaniels, William Trousdale Value-Focused Thinking in a Difficult Context: Planning Tourism for Guimaras, Philippines. Search on Bibsonomy Interfaces The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
15Jason M. Daida, John Polito, Steven A. Stanhope, Robert R. Bertram, Jonathan C. Khoo, Shahbaz A. Chaudhary What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Search on Bibsonomy GECCO The full citation details ... 1999 DBLP  BibTeX  RDF
15Brian Cloteaux, Christoph F. Eick, Bernadette Bouchon-Meunier, Vladik Kreinovich From ordered beliefs to numbers: How to elicit numbers without asking for them (doable but computationally difficult). Search on Bibsonomy Int. J. Intell. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Tobias Rydén Optimal Overload Control of Systems with Access Buffers - a Difficult Problem. Search on Bibsonomy Comput. Networks The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Jonathan P. Caulkins, Edward H. Kaplan, Peter Lurie, Thomas O'Connor, Sung-Ho Ahn Can Difficult-to-Reuse Syringes Reduce the Spread of HIV Among Injection Drug Users? Search on Bibsonomy Interfaces The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Olivier Devillers Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems Search on Bibsonomy CoRR The full citation details ... 1998 DBLP  BibTeX  RDF
15David Preston What makes professionals so difficult: an investigation into professional ethics teaching. Search on Bibsonomy SIGCAS Comput. Soc. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Enric Celaya, Josep M. Porta A control structure for the locomotion of a legged robot on difficult terrain. Search on Bibsonomy IEEE Robotics Autom. Mag. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Barbara Hammer Training a sigmoidal network is difficult. Search on Bibsonomy ESANN The full citation details ... 1998 DBLP  BibTeX  RDF
15Igor Walukiewicz Difficult Configurations - On the Complexity of LTrL. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15David Preston What makes professionals so difficult: an investigation into professional ethics teaching. Search on Bibsonomy ACM Policy The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Leslie Barden Dealing with Difficult Customers - the Most Fun You Can Have at Work. Search on Bibsonomy SIGUCCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Michael Streit Why Are Multimodal Systems so Difficult to Build? - About the Difference between Deictic Gestures and Direct Manipulation. Search on Bibsonomy Cooperative Multimodal Communication The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Stephen J. Alter Solving Difficult Grid Related Problems Utilizing the Volume Grid Manipulator. Search on Bibsonomy IMR The full citation details ... 1998 DBLP  BibTeX  RDF
15Md. Shoaib Bhuiyan, Yuji Iwahori, Akira Iwata Optimal Edge Detection under Difficult Imaging Conditions. Search on Bibsonomy ACCV (2) The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
15Thang C. Nguyen Robust, Automatic Structural Analysis of Difficult Face Images: A New Approach Search on Bibsonomy 1998   RDF
15Jinwoo Kim, F. Javier Lerch Why Is Programming (Sometimes) So Difficult? Programming as Scientific Discovery in Multiple Problem Spaces. Search on Bibsonomy Inf. Syst. Res. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
15Alberto Caprara Sorting by reversals is difficult. Search on Bibsonomy RECOMB The full citation details ... 1997 DBLP  DOI  BibTeX  RDF alternating cycle decomposition, complexity, sorting by reversals
15Chris Fennessy If We Can Land A Man on the Moon Why is it so Difficult to Run and support a Data Centre? Search on Bibsonomy Int. CMG Conference The full citation details ... 1997 DBLP  BibTeX  RDF
15Robert Moser A fantasy adventure game as a learning environment: why learning to program is so difficult and what can be done about it. Search on Bibsonomy ITiCSE The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
15Sally C. Brailsford, Peter M. Hubbard, Barbara M. Smith, H. Paul Williams Organizing a social event - A difficult problem of combinatorial optimization. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
15Kate Finney Mathematical Notation in Formal Specification: Too Difficult for the Masses? Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF reading Z, Formal specification, mathematics
15Charles Cresson Wood Constructing difficult-to-guess passwords. Search on Bibsonomy Inf. Manag. Comput. Secur. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
15Nigel P. Smart How Difficult Is It to Solve a Thue Equation? Search on Bibsonomy ANTS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
15Grigory Kogan Computing Permanents over Fields of Characteristic 3: Where and Why It Becomes Difficult (extended abstract). Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fields of characteristic 3, computational complexity, complexity, polynomial time algorithm, polynomial-time algorithm, matrix, permanents
15Irfan A. Essa Vision-Based HCI - What's Next and What are the Difficult Problems? Search on Bibsonomy FG The full citation details ... 1996 DBLP  BibTeX  RDF
15Kokichi Sugihara, Hiroshi Inagaki Why is the 3D Delaunay Triangulation Difficult to Construct. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Aart Middeldorp, Bernhard Gramlich Simple termination is difficult. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Andreja Prijatelj Reflections on "difficult" embeddings. Search on Bibsonomy J. Philos. Log. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Sheldon H. Jacobson How difficult is the frequency selection problem? Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Daniel Bienstock, Oktay Günlük Computational experience with a difficult mixed-integer multicommodity flow problem. Search on Bibsonomy Math. Program. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15D. J. Andrews, Darrel C. Ince A case study of a difficult refinement: a fast dictionary for a spell-checking program. Search on Bibsonomy Inf. Softw. Technol. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Klaus G. Troitzsch Computer Simulation and Social Sciences: On the Future of a Difficult Relation. Search on Bibsonomy Social Science Microsimulation The full citation details ... 1995 DBLP  BibTeX  RDF
15Cristiana Bolchini, Franco Fummi, R. Gemelli, Fabio Salice A BDD Based Algorithm for Detecting Difficult Faults. Search on Bibsonomy ISCAS The full citation details ... 1995 DBLP  BibTeX  RDF
15Steve M. Easterbrook Coordination breakdowns: why groupware is so difficult to design. Search on Bibsonomy HICSS (4) The full citation details ... 1995 DBLP  DOI  BibTeX  RDF coordination breakdowns, group interaction complexity, software support tool requirements, analysis techniques, collaboration, groupware, human factors, conflict, group support systems, user adaptability, organisational change, groupware design, shared understanding, interaction mechanisms
15Barbara M. Smith In Search of Exceptionally Difficult Constraint Satisfaction Problems. Search on Bibsonomy Constraint Processing, Selected Papers The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Tsungnan Lin, Bill G. Horne, Peter Tiño, C. Lee Giles Learning long-term dependencies is not as difficult with NARX networks. Search on Bibsonomy NIPS The full citation details ... 1995 DBLP  BibTeX  RDF
15Astro Teller, Manuela M. Veloso A Contolled Experiment: Evolution for Learning Difficult Image Classification. Search on Bibsonomy EPIA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15John R. Podlena, Tim Hendtlass Using a Combination of Genetic Algorithm and Hill Climbing Techniques for the Solution of a Difficult Letter Recognition Problem. Search on Bibsonomy IEA/AIE The full citation details ... 1995 DBLP  BibTeX  RDF
15Jan Kratochvíl Regular codes in regular graphs are difficult. Search on Bibsonomy Discret. Math. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
15Yoshua Bengio, Patrice Y. Simard, Paolo Frasconi Learning long-term dependencies with gradient descent is difficult. Search on Bibsonomy IEEE Trans. Neural Networks The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
15John Budenske, Maria L. Gini Why Is It So Difficult for a Robot to Pass Through a Doorway Using Ultrasonic Sensors? Search on Bibsonomy ICRA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
15Gernot Starke Why is Process Modelling so Difficult? Search on Bibsonomy EWSPT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
15Edward M. Roche, Michael Blaine Public Policy and Information Technology in the Developing World: Difficult Financial Options. Search on Bibsonomy IFIP Congress (3) The full citation details ... 1994 DBLP  BibTeX  RDF
15Marc S. Atkin, Paul R. Cohen Learning Monitoring Strategies: A Difficult Genetic Programming Application. Search on Bibsonomy International Conference on Evolutionary Computation The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
15Kurt Konolige Easy to be Hard: Difficult Problems for Greedy Algorithms. Search on Bibsonomy KR The full citation details ... 1994 DBLP  BibTeX  RDF
15Wieslaw Kubiak Completion time variance minimization on a single machine is difficult. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15Janez Zerovnik Regular Graphs Are 'Difficult' For Colouring. Search on Bibsonomy Informatica (Slovenia) The full citation details ... 1993 DBLP  BibTeX  RDF
15Yohei Yamasaki Shannon-like games are difficult. Search on Bibsonomy Discret. Math. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15Maria J. Castro, Juan C. Perez Comparison of geometric, connections and structural techniques on a difficult isolated word recognition task. Search on Bibsonomy EUROSPEECH The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15David E. Goldberg, Kalyanmoy Deb, Hillol Kargupta, Georges R. Harik RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms. Search on Bibsonomy ICGA The full citation details ... 1993 DBLP  BibTeX  RDF
15Michael R. Fellows, Michael T. Hallett, Harold T. Wareham DNA Physical Mapping: Three Ways Difficult. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15Aart Middeldorp, Bernhard Gramlich Simple Termination is Difficult. Search on Bibsonomy RTA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
15Olivier Devillers Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems. Search on Bibsonomy Int. J. Comput. Geom. Appl. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
15Richard Rankin, Ralph W. Wilkerson Proving functionally difficult problems through model generation. Search on Bibsonomy SAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
15Enver Yücesan, Sheldon H. Jacobson Building Correct Simulation Models is Difficult. Search on Bibsonomy WSC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
15Michael E. Palmer, Stephen J. Smith Improved Evolutionary Optimization of Difficult Landscapes: Control of Premature Convergence through Scheduled Sharing. Search on Bibsonomy Complex Syst. The full citation details ... 1991 DBLP  BibTeX  RDF
15Jonathan Schaeffer A Difficult Search Problem. Search on Bibsonomy J. Int. Comput. Games Assoc. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
15Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard A GRASPTM for a difficult single machine scheduling problem, . Search on Bibsonomy Comput. Oper. Res. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
15J. A. Hoogeveen Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
15Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan An interior point algorithm to solve computationally difficult set covering problems. Search on Bibsonomy Math. Program. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
15Mark S. Fox, Norman M. Sadeh Why is Scheduling Difficult? A CSP Perspective. Search on Bibsonomy ECAI The full citation details ... 1990 DBLP  BibTeX  RDF
15C. Shim, B. Espinoza-Varas, J. Y. Cheung A PC-based neural network for recognition of difficult syllables using LPC coefficient difference. Search on Bibsonomy IJCNN The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
15Gábor Tardos Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?. Search on Bibsonomy Comb. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
15Anne Cutler, Sally Butterfield Natural speech cues to word segmentation under difficult listening conditions. Search on Bibsonomy EUROSPEECH The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
15E.-L. Bogue The difficult client: consulting techniques from the human services. Search on Bibsonomy SIGUCCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
15Lee Shiflett A difficult balance: Editorial peer review in medicine. Search on Bibsonomy J. Am. Soc. Inf. Sci. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
15Milan Ninchich Database Draw - Too Difficult? Search on Bibsonomy J. Int. Comput. Games Assoc. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
15Lajos Rónyai Simple Algebras Are Difficult Search on Bibsonomy STOC The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
15Kathleen Brush Managing Computer Center Resources: A Task No More Difficult Than Minding the Store. Search on Bibsonomy Int. CMG Conference The full citation details ... 1986 DBLP  BibTeX  RDF
15Imre Bárány, Zoltán Füredi Computing the Volume Is Difficult Search on Bibsonomy STOC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
15Bahman Kalantari Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems. Search on Bibsonomy Oper. Res. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
15David A. Bell Difficult Data Placement Problems. Search on Bibsonomy Comput. J. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
15Andrew G. Barto, Richard S. Sutton, Charles W. Anderson Neuronlike adaptive elements that can solve difficult learning control problems. Search on Bibsonomy IEEE Trans. Syst. Man Cybern. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
15John R. Kender Why Perspective Is Difficult: How Two Algorithms Fail. Search on Bibsonomy AAAI The full citation details ... 1982 DBLP  BibTeX  RDF
Displaying result #801 - #900 of 21250 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][>>]
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