Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
33 | Sanjay Jain 0001, Arun Sharma 0001 |
Mind Change Complexity of Learning Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroCOLT ![In: Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings, pp. 198-213, 1999, Springer, 3-540-65701-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Roy Dyckhoff, Stéphane Lengrand |
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 173-185, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
purification, call-by-value semantics, depth-bounded, guarded logic, Sequent calculus, focused |
21 | Roy Dyckhoff, Delia Kesner, Stéphane Lengrand |
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 347-361, 2006, Springer, 3-540-37187-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2016, pp. 307, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
21 | Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin |
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (2) ![In: Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, pp. 881-908, 2016, Springer, 978-3-662-49895-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Ian Parberry |
An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 24(6), pp. 363-367, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Armand Prieditis |
Depth-First Branch-and-Bound vs. Depth-Bounded IDA*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Intell. ![In: Comput. Intell. 14(2), pp. 188-206, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Madanlal Musuvathi, Shaz Qadeer |
Iterative context bounding for systematic testing of multithreaded programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, 2007, pp. 446-455, 2007, ACM, 978-1-59593-633-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
context-bounding, model checking, concurrency, software testing, multithreading, partial-order reduction, shared-memory programs |
15 | Roman Barták, Hana Rudová |
Limited assignments: a new cutoff strategy for incomplete depth-first search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005, pp. 388-392, 2005, ACM, 1-58113-964-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
search, constraint satisfaction |
14 | Farid Arthaud, Martin C. Rinard |
Depth-bounded epistemic logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.08607, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Farid Arthaud, Martin C. Rinard |
Depth-bounded Epistemic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023., pp. 46-65, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Linh Anh Nguyen, Ivana Micic, Stefan Stanimirovic |
Depth-Bounded Fuzzy Simulations and Bisimulations between Fuzzy Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.03318, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Linh Anh Nguyen, Ivana Micic, Stefan Stanimirovic |
Depth-bounded fuzzy simulations and bisimulations between fuzzy automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 473, pp. 108729, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Qipeng Liu 0001 |
Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 82:1-82:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | A. R. Balasubramanian |
Complexity of Coverability in Depth-Bounded Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 17:1-17:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Tomoyuki Yamakami |
Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings, pp. 61-69, 2022, Springer, 978-3-031-22104-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Miguel A. Larotonda, Giuseppe Primiero |
A Depth-Bounded Semantics for Becoming Informed. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEFM Workshops ![In: Software Engineering and Formal Methods. SEFM 2022 Collocated Workshops - AI4EA, F-IDE, CoSim-CPS, CIFMA, Berlin, Germany, September 26-30, 2022, Revised Selected Papers, pp. 366-382, 2022, Springer, 978-3-031-26235-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
14 | Marcello D'Agostino, Costanza Larese, Sanjay Modgil |
Towards Depth-bounded Natural Deduction for Classical First-order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 8(2), pp. 423-452, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
14 | Lifeng Jin, Lane Schwartz, Finale Doshi-Velez, Timothy A. Miller, William Schuler |
Depth-Bounded Statistical PCFG Induction as a Model of Human Grammar Acquisition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Linguistics ![In: Comput. Linguistics 47(1), pp. 181-216, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Fabio Aurelio D'Asaro, Paolo Baldi, Giuseppe Primiero |
Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021., pp. 661-664, 2021, 978-1-956792-99-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Paolo Baldi, Hykel Hosni |
Depth-bounded Belief functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 123, pp. 26-40, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Ghasem Pasandi, Massoud Pedram |
Depth-bounded Graph Partitioning Algorithm and Dual Clocking Method for Realization of Superconducting SFQ Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Emerg. Technol. Comput. Syst. ![In: ACM J. Emerg. Technol. Comput. Syst. 17(1), pp. 2:1-2:22, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Paolo Baldi, Marcello D'Agostino, Hykel Hosni |
Depth-Bounded Approximations of Probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPMU (3) ![In: Information Processing and Management of Uncertainty in Knowledge-Based Systems - 18th International Conference, IPMU 2020, Lisbon, Portugal, June 15-19, 2020, Proceedings, Part III, pp. 607-621, 2020, Springer, 978-3-030-50152-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Giorgio Cignarale, Giuseppe Primiero |
A Multi-Agent Depth Bounded Boolean Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEFM ![In: Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops - ASYDE, CIFMA, and CoSim-CPS, Amsterdam, The Netherlands, September 14-15, 2020, Revised Selected Papers, pp. 176-191, 2020, Springer, 978-3-030-67219-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
14 | Lifeng Jin, Finale Doshi-Velez, Timothy A. Miller, William Schuler, Lane Schwartz |
Unsupervised Grammar Induction with Depth-bounded PCFG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Assoc. Comput. Linguistics ![In: Trans. Assoc. Comput. Linguistics 6, pp. 211-224, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
14 | Lifeng Jin, Finale Doshi-Velez, Timothy A. Miller, William Schuler, Lane Schwartz |
Unsupervised Grammar Induction with Depth-bounded PCFG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.08545, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
14 | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 18(4), pp. 33:1-33:25, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
14 | Emanuele D'Osualdo, Luke Ong, Alwen Tiu |
Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of Depth-Bounded Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSF ![In: 30th IEEE Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, August 21-25, 2017, pp. 464-480, 2017, IEEE Computer Society, 978-1-5386-3217-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
14 | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1603.09055, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
14 | Thierry Moisan, Claude-Guy Quimper, Jonathan Gaudreault |
Parallel Depth-Bounded Discrepancy Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings, pp. 377-393, 2014, Springer, 978-3-319-07045-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
14 | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (1) ![In: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, pp. 256-266, 2014, Springer, 978-3-662-44521-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
14 | Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay |
Semantics and proof-theory of depth bounded Boolean logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 480, pp. 43-68, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
14 | Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies, Damien Zufferey |
A Notion of Dynamic Interface for Depth-Bounded Object-Oriented Packages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.4615, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
14 | Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan |
Computing Role-Depth Bounded Generalizations in the Description Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2013: Advances in Artificial Intelligence - 36th Annual German Conference on AI, Koblenz, Germany, September 16-20, 2013. Proceedings, pp. 49-60, 2013, Springer, 978-3-642-40941-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
14 | Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan |
Role-depth Bounded Least Common Subsumer in Prob-EL with Nominals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013, pp. 670-688, 2013, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
14 | Fernando Rosa-Velardo, María Martos-Salgado |
Multiset rewriting for the verification of depth-bounded processes with name binding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 215, pp. 68-87, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
14 | Andreas Ecke, Anni-Yasmin Turhan |
Optimizations for the Role-Depth Bounded Least Common Subsumer in EL+. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OWLED ![In: Proceedings of OWL: Experiences and Directions Workshop 2012, Heraklion, Crete, Greece, May 27-28, 2012, 2012, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
14 | Andreas Ecke, Anni-Yasmin Turhan |
Role-depth Bounded Least Common Subsumers for EL+ and ELI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 2012 International Workshop on Description Logics, DL-2012, Rome, Italy, June 7-10, 2012, 2012, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
14 | Asma Lahimer, Pierre Lopez, Mohamed Haouari |
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1103.1516, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
14 | Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez |
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 60(2), pp. 320-327, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Asma Lahimer, Pierre Lopez, Mohamed Haouari |
Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings, pp. 117-130, 2011, Springer, 978-3-642-21310-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Abhishek Udupa, Ankush Desai, Sriram K. Rajamani |
Depth Bounded Explicit-State Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Model Checking Software - 18th International SPIN Workshop, Snowbird, UT, USA, July 14-15, 2011. Proceedings, pp. 57-74, 2011, Springer, 978-3-642-22305-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Thomas Wies, Damien Zufferey, Thomas A. Henzinger |
Forward Analysis of Depth-Bounded Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings, pp. 94-108, 2010, Springer, 978-3-642-12031-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
14 | Anni-Yasmin Turhan, Rafael Peñaloza |
Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 23rd International Workshop on Description Logics (DL 2010), Waterloo, Ontario, Canada, May 4-7, 2010, 2010, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
14 | Weirong Jiang, Viktor K. Prasanna |
Towards Green Routers: Depth-Bounded Multi-Pipeline Architecture for Power-Efficient IP Lookup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCCC ![In: 2008 IEEE International Performance, Computing and Communications Conference, IPCCC 2008, Austin, TX, USA, December 7-9, 2008, pp. 185-192, 2008, IEEE Computer Society, 978-1-4244-3368-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Toby Walsh |
Depth-bounded Discrepancy Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, 2 Volumes, pp. 1388-1395, 1997, Morgan Kaufmann. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
14 | Jan Chomicki |
Depth-Bounded Bottom-Up Evaluation of Logic Program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Program. ![In: J. Log. Program. 25(1), pp. 1-31, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Hiroki Arimura |
Completeness of Depth-bounded Resolution for Weakly Reducing Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Software Science and Engineering ![In: Software Science and Engineering: Selected Papers from the Kyoto Symposia, pp. 227-245, 1991, World Scientific, 978-981-02-0776-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
14 | José L. Balcázar |
Adaptive Logspace and Depth-Bounded Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991, pp. 240-254, 1991, IEEE Computer Society, 0-8186-2255-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
14 | H. Raymond Strong |
Depth-Bounded Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 4(1), pp. 1-14, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
|
11 | John Harrison 0001 |
Optimizing Proof Search in Model Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings, pp. 313-327, 1996, Springer, 3-540-61511-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
7 | Jiong Guo |
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 39-48, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
7 | Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings, pp. 226-239, 2009, Springer, 978-3-642-02157-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
7 | Wafa Karoui, Marie-José Huguet, Pierre Lopez, Wady Naanaa |
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, pp. 99-111, 2007, Springer, 978-3-540-72396-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
7 | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß |
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 320-331, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
7 | Michael D. Jones, Jacob Sorber |
Parallel search for LTL violations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 7(1), pp. 31-42, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Semiformal verification, Explicit model checking, Biologically inspired algorithms |
7 | Tristan Cazenave |
Admissible Moves in Two-Player Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings, pp. 52-63, 2002, Springer, 3-540-43941-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
7 | V. Vinay |
Hierarchies of Circuit Classes that are Closed under Complement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 108-117, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Circuits, Complexity Theory, Complementation |