The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase P-complete (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1944-1960 (18) 1961-1965 (16) 1966-1967 (16) 1968-1969 (16) 1970-1971 (16) 1972-1973 (26) 1974 (22) 1975 (29) 1976 (58) 1977 (54) 1978 (47) 1979 (55) 1980 (65) 1981 (71) 1982 (67) 1983 (67) 1984 (83) 1985 (98) 1986 (120) 1987 (145) 1988 (203) 1989 (236) 1990 (298) 1991 (267) 1992 (289) 1993 (295) 1994 (376) 1995 (431) 1996 (460) 1997 (540) 1998 (595) 1999 (737) 2000 (902) 2001 (998) 2002 (1202) 2003 (1396) 2004 (1827) 2005 (2162) 2006 (2327) 2007 (2546) 2008 (2583) 2009 (1851) 2010 (523) 2011 (333) 2012 (420) 2013 (418) 2014 (429) 2015 (520) 2016 (418) 2017 (445) 2018 (455) 2019 (492) 2020 (463) 2021 (569) 2022 (584) 2023 (580) 2024 (146)
Publication types (Num. hits)
article(10872) book(50) data(3) incollection(169) inproceedings(19235) phdthesis(74) proceedings(2)
Venues (Conferences, Journals, ...)
CoRR(1137) Discret. Math.(460) IEEE Trans. Comput. Aided Des....(221) MFCS(215) ICALP(208) Theor. Comput. Sci.(202) STACS(200) J. ACM(160) Discret. Appl. Math.(158) ICRA(147) Graphs Comb.(145) WG(145) DAC(138) LICS(137) IEEE Trans. Parallel Distribut...(133) CSL(132) More (+10 of total 3900)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 22091 occurrences of 8614 keywords

Results
Found 30405 publication records. Showing 30405 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
13Toshihide Ibaraki, Tiko Kameda, Naoki Katoh Cautious Transaction Schedulers for Database Concurrency Control. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF cautious schedulers, WW, write-write constraints, WRW, WW-scheduler, polynomial-time scheduling algorithm, read sets, write sets, scheduling, computational complexity, computational complexity, distributed databases, distributed databases, NP-complete, database theory, transaction schedulers, database concurrency control
13Jan J. M. M. Rutten Correctness and full abstraction of metric semantics for concurrency. Search on Bibsonomy REX Workshop The full citation details ... 1988 DBLP  DOI  BibTeX  RDF complete metric spaces, concurrency, contractions, correctness, operational semantics, compositionality, denotational semantics, full abstraction
13Don S. Batory On Searching Transposed Files. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF inveited file, multilist, transposed file, query processing, NP-complete, file searching
13Catriel Beeri, Philip A. Bernstein Computational Problems Related to the Design of Normal Form Relational Schemas. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF derivation tree, membership algorithm, relational database, NP-complete, database design, function dependency, third normal form
13Robert Law Using student blogs for documentation in software development projects. Search on Bibsonomy ITiCSE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
13Wenfei Fan, Floris Geerts Relative information completeness. Search on Bibsonomy PODS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF information completeness, master data, constraints, consistency
13Olaf Beyersdorff, Arne Meier, Michael Thomas 0001, Heribert Vollmer The Complexity of Reasoning for Fragments of Default Logic. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Johan Kwisthout The Computational Complexity of Monotonicity in Probabilistic Networks. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
13Gang Gou, Maxim Kormilitsin, Rada Chirkova Query evaluation using overlapping views: completeness and efficiency. Search on Bibsonomy SIGMOD Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF rewriting queries using views, query optimization, materialized views
13Piotr Faliszewski, Mitsunori Ogihara Separating the Notions of Self- and Autoreducibility. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
13Régis Barbanchon, Etienne Grandjean Local Problems, Planar Local Problems and Linear Time. Search on Bibsonomy CSL The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
13Lefteris M. Kirousis, Phokion G. Kolaitis On the Complexity of Model Checking and Inference in Minimal Models. Search on Bibsonomy LPNMR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
13Levke Bentzien Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
13Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. Search on Bibsonomy CIAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
13Randy Browne An Entropy Conservation Law for Testing the Completeness of Convert Channel Analysis. Search on Bibsonomy CCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
13Miki Hermann, Phokion G. Kolaitis The Complexity of Counting Problems in Equational Matching. Search on Bibsonomy CADE The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
13Tomasz Imielinski, Kumar V. Vadaparty Complexity of Query Processing in Databases with OR-Objects. Search on Bibsonomy PODS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
12Sebastian Burckhardt, Chris Dern, Madanlal Musuvathi, Roy Tan Line-up: a complete and automatic linearizability checker. Search on Bibsonomy PLDI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF thread safety, atomicity, linearizability
12Chadi Khirallah, Vladimir Stankovic 0001, Lina Stankovic, Yang Yang 0003, Zixiang Xiong Bandwidth efficient multi-station wireless streaming based on complete complementary sequences. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Frédéric Guyon, Céline Brochier-Armanet, Alain Guénoche Comparison of alignment free string distances for complete genome phylogeny. Search on Bibsonomy Adv. Data Anal. Classif. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C05, 68R15, 92B10, 90C27
12Brian D. Sutton Computing the complete CS decomposition. Search on Bibsonomy Numer. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 65F15, 15A23, 15A18
12Pablo Rabanal, Ismael Rodríguez, Fernando Rubio 0001 Applying River Formation Dynamics to Solve NP-Complete Problems. Search on Bibsonomy Nature-Inspired Algorithms for Optimisation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Yeting Ge, Leonardo Mendonça de Moura Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories. Search on Bibsonomy CAV The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Xin Zhao, Yuqin Lv, Wenxin He A Novel Micropayment Scheme with Complete Anonymity. Search on Bibsonomy IAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Brendan Elliott, En Cheng, Chimezie Thomas-Ogbuji, Z. Meral Özsoyoglu A complete translation from SPARQL into efficient SQL. Search on Bibsonomy IDEAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF semantic web, SQL, RDF, SPARQL
12Young-Ho Choi, Tae-Kyeong Lee, Sanghoon Baek, Se-Young Oh Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform. Search on Bibsonomy IROS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Jasmina Omic, Robert E. Kooij, Piet Van Mieghem Heterogeneous Protection in Regular and Complete Bi-partite Networks. Search on Bibsonomy Networking The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Virus spread, heterogeneous networks, epidemic threshold
12Junyan Qian, Lingzhong Zhao, Guoyong Cai, Tianlong Gu Automatic Construction of Complete Abstraction by Abstract Interpretation. Search on Bibsonomy ACIS-ICIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12S. Dov Gordon, Jonathan Katz Complete Fairness in Multi-party Computation without an Honest Majority. Search on Bibsonomy TCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Alberto Carraro, Antonino Salibra Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. Search on Bibsonomy LICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Nikolaos D. Liveris, Hai Zhou 0001, Prithviraj Banerjee Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis. Search on Bibsonomy ASP-DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Peter B. Golbus, Robert W. McGrail, Tomasz Przytycki, Mary Sharac, Aleksandar Chakarov Tricolorable torus knots are NP-complete. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Ting Li, Bo Shu, Xianjie Qiu, Zhaoqi Wang A complete descriptor of line-segment-pair for symbol recognition. Search on Bibsonomy CGI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Jianguo Lu, Minghao Li, John Mylopoulos, Kenneth Cheung Complete and Equivalent Query Rewriting Using Views. Search on Bibsonomy APWeb/WAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Md. Aquil Khan, Mohua Banerjee A Logic for Complete Information Systems. Search on Bibsonomy ECSQARU The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Johannes Köbler, Sebastian Kuhnert The Isomorphism Problem for k-Trees Is Complete for Logspace. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph canonization, logspace completeness, graph isomorphism, space complexity, k-trees
12Xianming Liu, Hongxun Yao, Rongrong Ji, Pengfei Xu 0001, Xiaoshuai Sun What is a complete set of keywords for image description & annotation on the web. Search on Bibsonomy ACM Multimedia The full citation details ... 2009 DBLP  DOI  BibTeX  RDF keyword selection, semantic items, ontology, image annotation
12Chinh T. Vu, Yingshu Li Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks. Search on Bibsonomy PerCom Workshops The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Adam Roman Decision Version of the Road Coloring Problem Is NP-Complete. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Bernd Steinbach, Christian Posthoff Complete Sets of Hamiltonian Circuits for Classification of Documents. Search on Bibsonomy EUROCAST The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Wumo Pan, Tien D. Bui, Ching Y. Suen Isolated Handwritten Farsi Numerals Recognition Using Sparse and Over-Complete Representations. Search on Bibsonomy ICDAR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Hangkyu Lee, Irith Pomeranz, Sudhakar M. Reddy On Complete Functional Broadside Tests for Transition Faults. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Uwe Naumann Optimal Jacobian accumulation is NP-complete. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 26B10, 68Q17
12Haiyun Bian, Raj Bhatnagar An Algorithm for Mining Weighted Dense Maximal 1-Complete Regions. Search on Bibsonomy Data Mining: Foundations and Practice The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Marcin Dabrowski, Piotr Pacyna Generic and Complete Three-Level Identity Management Model. Search on Bibsonomy SECURWARE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Noor Shamsiah Othman, Mohammed El-Hajjar, Anh Quang Pham, Osamah Alamri, Soon Xin Ng, Lajos Hanzo Over-Complete Source-Mapping Aided AMR-WB MIMO Transceiver Using Three-Stage Interative Detection. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Wankou Yang, Hui Yan, Jianguo Wang 0002, Jingyu Yang 0001 Face recognition using Complete Fuzzy LDA. Search on Bibsonomy ICPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Jon Sneyers Turing-Complete Subclasses of CHR. Search on Bibsonomy ICLP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Radu Mardare, Alberto Policriti A Complete Axiomatic System for a Process-Based Spatial Logic. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Horatiu Jula, George Candea A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity. Search on Bibsonomy RV The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Yong Gao 0001 Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Guoxing Zhao, Jixin Ma 0001, Fuxing Shen, Miltos Petridis A Sound and Complete Reified Temporal Logic. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Reified Temporal Logic, Completeness
12Ruining Li, Zhurong Zhou, Yuhui Qiu Automated Composition of Semantic Web Service Using Data Mediator and Complete Backward Tree. Search on Bibsonomy CSSE (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Wen-Gong Shieh, Wen-Bing Horng Efficient and complete remote authentication scheme with smart cards. Search on Bibsonomy ISI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, Simone Silvestri Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage. Search on Bibsonomy IWSOS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid Spanners of Complete k -Partite Geometric Graphs. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Martin Fürer Solving NP-Complete Problems with Quantum Search. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
12Kord Eickmeyer, Martin Grohe, Magdalena Grüber Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF derandomisation, parameterized complexity, inapproximability
12Marcel Erné, Mai Gehrke, Ales Pultr Complete Congruences on Topologies and Down-set Lattices. Search on Bibsonomy Appl. Categorical Struct. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) Primary 06D10, Secondary 06A15, 06D22, 54H10, 08A30
12Risco Mulwani Mutelo, Wai Lok Woo, Satnam Singh Dlay A Complete Fisher Discriminant Analysis for Based Image Matrix and Its Application to Face Biometrics. Search on Bibsonomy ICB The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Fisher Discriminant Analysis (FDA), Feature extraction, Face Recognition, Biometrics, image representation, two dimensional Image
12Gabriel Juhás, Robert Lorenz 0001, Sebastian Mauser Complete Process Semantics for Inhibitor Nets. Search on Bibsonomy ICATPN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Liangjun Zhang, Young J. Kim, Dinesh Manocha A hybrid approach for complete motion planning. Search on Bibsonomy IROS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Shih-Lien Lu, Peter Yiannacouras, Rolf Kassa, Michael Konow, Taeweon Suh An FPGA-based Pentium in a complete desktop system. Search on Bibsonomy FPGA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF pentium®, FPGA, emulator, accelerator, processor
12John Harding, Carol L. Walker, Elbert A. Walker On Complete Sublattices of the Algebra of Truth Values of Type-2 Fuzzy Sets. Search on Bibsonomy FUZZ-IEEE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Mohieddine Missaoui, David R. C. Hill, Cécile Militon, Pierre Peyret Complete Backtranslation of Oligopeptides for Metabolic Pathways Exploration of Complex Environments using Functional Microarrays. Search on Bibsonomy BIBE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Vasudha Bhatnagar, Sharanjit Kaur Exclusive and Complete Clustering of Streams. Search on Bibsonomy DEXA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12James Brotherston, Alex Simpson Complete Sequent Calculi for Induction and Infinite Descent. Search on Bibsonomy LICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Laurent Dupont 0004, Michael Hemmer, Sylvain Petitjean, Elmar Schömer Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira Aliased Register Allocation for Straight-Line Programs Is NP-Complete. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Damien Pous Complete Lattices and Up-To Techniques. Search on Bibsonomy APLAS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Yuriy Brun Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time. Search on Bibsonomy DNA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Fawad Nazir, Tallat Hussain Tarar, Faran Javed Chawla, Hiroki Suguri, Hafiz Farooq Ahmad, Arshad Ali Constella: A Complete IP Network Topology Discovery Solution. Search on Bibsonomy APNOMS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Network Monitoring and Management, Simple Network Management Protocol (SNMP)
12Bart Kuijpers, Walied Othman Trajectory Databases: Data Models, Uncertainty and Complete Query Languages. Search on Bibsonomy ICDT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Ming-Wen Shao A Complete Method to Incomplete Information Systems. Search on Bibsonomy RSKT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Rough sets, knowledge reduction, incomplete information systems
12Yoshiki Mitani, Tomoko Matsumura, Mike Barker, Seishiro Tsuruho, Katsuro Inoue, Ken-ichi Matsumoto Proposal of a Complete Life Cycle In-Process Measurement Model Based on Evaluation of an In-Process Measurement Experiment Using a Standardized Requirement Definition Process. Search on Bibsonomy ESEM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF In-process measurement, Requirement definition phase measurement, Enterprise Architecture, Empirical software engineering, Software process measurement
12Paulin Jacobé de Naurois, Virgile Mogbil Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. Search on Bibsonomy CSL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Iddo Hanniel, Ron Wein An exact, complete and efficient computation of arrangements of Bézier curves. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Bézier curves, robustness, arrangements, exact computation, CGAL
12Joachim Kneis, Daniel Mölle, Peter Rossmanith Partial vs. Complete Domination: t-Dominating Set. Search on Bibsonomy SOFSEM (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider Covering Graphs with Few Complete Bipartite Subgraphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Krishnendu Chatterjee Stochastic Müller Games are PSPACE-Complete. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
12Zdenka Riecanová Embeddings of generalized effect algebras into complete effect algebras. Search on Bibsonomy Soft Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Denis Cornaz A linear programming formulation for the maximum complete multipartite subgraph problem. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991) 05C15, 90C09
12Domenico Cantone, Calogero G. Zarba A Decision Procedure for Monotone Functions over Bounded and Complete Lattices. Search on Bibsonomy Theory and Applications of Relational Structures as Knowledge Instruments The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Michael Krüger, Harald Hempel Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF coNP-completeness, inverse NP-problems, 3-DIMENSIONAL MATCHING, computational complexity, HAMILTONIAN CYCLE
12Christopher Ré, Jérôme Siméon, Mary F. Fernández A Complete and Efficient Algebraic Compiler for XQuery. Search on Bibsonomy ICDE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Zhiyang Yao Finding Efficient Robot Path for the Complete Coverage of A Known Space. Search on Bibsonomy IROS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Pierluigi Daglio A complete and fully qualified design flow for verification of mixed-signal SoC with embedded flash memories. Search on Bibsonomy DATE Designers' Forum The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Fernando Magno Quintão Pereira, Jens Palsberg Register Allocation After Classical SSA Elimination is NP-Complete. Search on Bibsonomy FoSSaCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Feng Zhao, Xicheng Lu, Peidong Zhu, Jinjing Zhao BGPSep_S: An Algorithm for Constructing IBGP Configurations with Complete Visibility. Search on Bibsonomy ICDCN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Li Ma 0002, Yang Yang 0041, Zhaoming Qiu, Guo Tong Xie, Yue Pan, Shengping Liu Towards a Complete OWL Ontology Benchmark. Search on Bibsonomy ESWC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Grigore Rosu Equality of streams is a Pi0 over 2-complete problem. Search on Bibsonomy ICFP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF infinite structures, streams, algebraic specification
12Yves Guiard, Michel Beaudouin-Lafon, Yangzhou Du, Caroline Appert, Jean-Daniel Fekete, Olivier Chapuis Shakespeare's complete works as a benchmark for evaluating multiscale document navigation techniques. Search on Bibsonomy BELIV The full citation details ... 2006 DBLP  DOI  BibTeX  RDF evaluation benchmark, evaluation standard, multiscale document navigation techniques, Fitts' law, target acquisition
12Stéphane Demri, Denis Lugiez Presburger Modal Logic Is PSPACE-Complete. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Eugene Goldberg Determinization of Resolution by an Algorithm Operating on Complete Assignments. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Ofer M. Shir, Christian Siedschlag, Thomas Bäck, Marc J. J. Vrakking The complete-basis-functions parameterization in ES and its application to laser pulse shaping. Search on Bibsonomy GECCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF evolution strategies, parameterization, laser pulse shaping
12Marie-Pierre Béal, Dominique Perrin Complete Codes in a Sofic Shift. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Ranjit Jhala, Kenneth L. McMillan A Practical and Complete Approach to Predicate Refinement. Search on Bibsonomy TACAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Wu-Hua Chen, Wei Xing Zheng 0001 A study of complete stability for delayed cellular neural networks. Search on Bibsonomy ISCAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Adrian Kosowski Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. Search on Bibsonomy SIROCCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #601 - #700 of 30405 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][>>]
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