The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1970-2006 (16) 2007-2013 (18) 2014-2021 (16) 2022-2023 (8)
Publication types (Num. hits)
article(22) incollection(1) inproceedings(35)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 14 keywords

Results
Found 58 publication records. Showing 58 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
33Sanjay Jain 0001, Arun Sharma 0001 Mind Change Complexity of Learning Logic Programs. Search on Bibsonomy EuroCOLT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
29Roy Dyckhoff, Stéphane Lengrand LJQ: A Strongly Focused Calculus for Intuitionistic Logic. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF purification, call-by-value semantics, depth-bounded, guarded logic, Sequent calculus, focused
21Roy Dyckhoff, Delia Kesner, Stéphane Lengrand Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
21Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2016 DBLP  BibTeX  RDF
21Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. Search on Bibsonomy EUROCRYPT (2) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Ian Parberry An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
20Armand Prieditis Depth-First Branch-and-Bound vs. Depth-Bounded IDA*. Search on Bibsonomy Comput. Intell. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
19Madanlal Musuvathi, Shaz Qadeer Iterative context bounding for systematic testing of multithreaded programs. Search on Bibsonomy PLDI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF context-bounding, model checking, concurrency, software testing, multithreading, partial-order reduction, shared-memory programs
15Roman Barták, Hana Rudová Limited assignments: a new cutoff strategy for incomplete depth-first search. Search on Bibsonomy SAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF search, constraint satisfaction
14Farid Arthaud, Martin C. Rinard Depth-bounded epistemic logic. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
14Farid Arthaud, Martin C. Rinard Depth-bounded Epistemic Logic. Search on Bibsonomy TARK The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
14Linh Anh Nguyen, Ivana Micic, Stefan Stanimirovic Depth-Bounded Fuzzy Simulations and Bisimulations between Fuzzy Automata. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
14Linh Anh Nguyen, Ivana Micic, Stefan Stanimirovic Depth-bounded fuzzy simulations and bisimulations between fuzzy automata. Search on Bibsonomy Fuzzy Sets Syst. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
14Qipeng Liu 0001 Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More. Search on Bibsonomy ITCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
14A. R. Balasubramanian Complexity of Coverability in Depth-Bounded Processes. Search on Bibsonomy CONCUR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
14Tomoyuki Yamakami Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits - (Extended Abstract). Search on Bibsonomy COCOON The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
14Miguel A. Larotonda, Giuseppe Primiero A Depth-Bounded Semantics for Becoming Informed. Search on Bibsonomy SEFM Workshops The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
14Marcello D'Agostino, Costanza Larese, Sanjay Modgil Towards Depth-bounded Natural Deduction for Classical First-order Logic. Search on Bibsonomy FLAP The full citation details ... 2021 DBLP  BibTeX  RDF
14Lifeng 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 Comput. Linguistics The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
14Fabio Aurelio D'Asaro, Paolo Baldi, Giuseppe Primiero Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo. Search on Bibsonomy KR The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
14Paolo Baldi, Hykel Hosni Depth-bounded Belief functions. Search on Bibsonomy Int. J. Approx. Reason. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Ghasem Pasandi, Massoud Pedram Depth-bounded Graph Partitioning Algorithm and Dual Clocking Method for Realization of Superconducting SFQ Circuits. Search on Bibsonomy ACM J. Emerg. Technol. Comput. Syst. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Paolo Baldi, Marcello D'Agostino, Hykel Hosni Depth-Bounded Approximations of Probability. Search on Bibsonomy IPMU (3) The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Giorgio Cignarale, Giuseppe Primiero A Multi-Agent Depth Bounded Boolean Logic. Search on Bibsonomy SEFM The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Lifeng Jin, Finale Doshi-Velez, Timothy A. Miller, William Schuler, Lane Schwartz Unsupervised Grammar Induction with Depth-bounded PCFG. Search on Bibsonomy Trans. Assoc. Comput. Linguistics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
14Lifeng Jin, Finale Doshi-Velez, Timothy A. Miller, William Schuler, Lane Schwartz Unsupervised Grammar Induction with Depth-bounded PCFG. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
14Kord Eickmeyer, Michael Elberfeld, Frederik Harwath Succinctness of Order-Invariant Logics on Depth-Bounded Structures. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
14Emanuele 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 CSF The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
14Kord Eickmeyer, Michael Elberfeld, Frederik Harwath Succinctness of Order-Invariant Logics on Depth-Bounded Structures. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
14Thierry Moisan, Claude-Guy Quimper, Jonathan Gaudreault Parallel Depth-Bounded Discrepancy Search. Search on Bibsonomy CPAIOR The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
14Kord Eickmeyer, Michael Elberfeld, Frederik Harwath Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. Search on Bibsonomy MFCS (1) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
14Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay Semantics and proof-theory of depth bounded Boolean logics. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
14Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies, Damien Zufferey A Notion of Dynamic Interface for Depth-Bounded Object-Oriented Packages. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
14Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan Computing Role-Depth Bounded Generalizations in the Description Logic. Search on Bibsonomy KI The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
14Andreas Ecke, Rafael Peñaloza, Anni-Yasmin Turhan Role-depth Bounded Least Common Subsumer in Prob-EL with Nominals. Search on Bibsonomy Description Logics The full citation details ... 2013 DBLP  BibTeX  RDF
14Fernando Rosa-Velardo, María Martos-Salgado Multiset rewriting for the verification of depth-bounded processes with name binding. Search on Bibsonomy Inf. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
14Andreas Ecke, Anni-Yasmin Turhan Optimizations for the Role-Depth Bounded Least Common Subsumer in EL+. Search on Bibsonomy OWLED The full citation details ... 2012 DBLP  BibTeX  RDF
14Andreas Ecke, Anni-Yasmin Turhan Role-depth Bounded Least Common Subsumers for EL+ and ELI. Search on Bibsonomy Description Logics The full citation details ... 2012 DBLP  BibTeX  RDF
14Asma Lahimer, Pierre Lopez, Mohamed Haouari Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
14Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
14Asma Lahimer, Pierre Lopez, Mohamed Haouari Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks. Search on Bibsonomy CPAIOR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
14Abhishek Udupa, Ankush Desai, Sriram K. Rajamani Depth Bounded Explicit-State Model Checking. Search on Bibsonomy SPIN The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
14Thomas Wies, Damien Zufferey, Thomas A. Henzinger Forward Analysis of Depth-Bounded Processes. Search on Bibsonomy FoSSaCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
14Anni-Yasmin Turhan, Rafael Peñaloza Role-depth Bounded Least Common Subsumers by Completion for EL- and prob-EL-TBoxes. Search on Bibsonomy Description Logics The full citation details ... 2010 DBLP  BibTeX  RDF
14Weirong Jiang, Viktor K. Prasanna Towards Green Routers: Depth-Bounded Multi-Pipeline Architecture for Power-Efficient IP Lookup. Search on Bibsonomy IPCCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
14Toby Walsh Depth-bounded Discrepancy Search. Search on Bibsonomy IJCAI The full citation details ... 1997 DBLP  BibTeX  RDF
14Jan Chomicki Depth-Bounded Bottom-Up Evaluation of Logic Program. Search on Bibsonomy J. Log. Program. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
14Hiroki Arimura Completeness of Depth-bounded Resolution for Weakly Reducing Programs. Search on Bibsonomy Software Science and Engineering The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
14José L. Balcázar Adaptive Logspace and Depth-Bounded Reducibilities. Search on Bibsonomy SCT The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
14H. Raymond Strong Depth-Bounded Computation. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1970 DBLP  DOI  BibTeX  RDF
11John Harrison 0001 Optimizing Proof Search in Model Elimination. Search on Bibsonomy CADE The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
7Jiong Guo Fixed-Parameter Algorithms for Graph-Modeled Date Clustering. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
7Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
7Wafa Karoui, Marie-José Huguet, Pierre Lopez, Wady Naanaa YIELDS: A Yet Improved Limited Discrepancy Search for CSPs. Search on Bibsonomy CPAIOR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
7Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
7Michael D. Jones, Jacob Sorber Parallel search for LTL violations. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Semiformal verification, Explicit model checking, Biologically inspired algorithms
7Tristan Cazenave Admissible Moves in Two-Player Games. Search on Bibsonomy SARA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
7V. Vinay Hierarchies of Circuit Classes that are Closed under Complement. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Circuits, Complexity Theory, Complementation
Displaying result #1 - #58 of 58 (100 per page; Change: )
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