|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3642 occurrences of 1964 keywords
|
|
|
Results
Found 5530 publication records. Showing 5530 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Mayez A. Al-Mouhamed, Steven S. Seiden |
Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 45(6), pp. 757-762, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
NP-completeness, multistage networks, storage schemes, parallel memories, Memory conflicts |
12 | Beate Bollig, Ingo Wegener |
Improving the Variable Ordering of OBDDs Is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 45(9), pp. 993-1002, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
verification, NP-completeness, graph algorithms, Ordered binary decision diagrams, variable orderings |
12 | Masafumi Yamashita, Tsunehiko Kameda |
Computing on Anonymous Networks: Part II-Decision and Membership Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 7(1), pp. 90-96, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
edge election, spanning tree construction, topology recognition, distributed computing, NP-completeness, computability, leader election, Anonymous network |
12 | Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy |
Interactive Proofs and the Hardness of Approximating Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 43(2), pp. 268-292, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
independent set in a graph, multilinearity testing np-completeness, hardness of approximation, probabilistically checkable proofs |
12 | Stefan Kahrs |
Limits of ML-Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, pp. 17-31, 1996, Springer, 3-540-61756-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
completeness, ML, polymorphism, recursion, definability |
12 | Martin Grohe |
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 264-273, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
finite-variable logics, finite structures, graph isomorphism problem, complexity theoretic difficulties, quantifier-free reductions, completeness result, counting quantifiers, computational complexity, first order logic, polynomial time, equivalence |
12 | Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien |
On the Removal of Anti and Output Dependences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 1996 International Conference on Application-Specific Systems, Architectures, and Processors (ASAP '96), August 19-23, 1996, Chicago, IL , USA, pp. 353-364, 1996, IEEE Computer Society, 0-8186-7542-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
anti dependences, output dependences, heuristics, NP-completeness, dependence graph, node splitting |
12 | Rainer Schuler |
Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. ![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. 190-195, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
computational complexity, completeness, average-case analysis, resource-bounded measure |
12 | Jan Paredaens, Peter Peelman, Letizia Tanca |
G-Log: A Graph-Based Query Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 7(3), pp. 436-453, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
graph-based databases, database algorithms, data models, completeness, database theory, Deductive databases, first-order logic, complex objects, database programming languages |
12 | Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe 0001 |
Instance Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(1), pp. 96-121, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
nonuniform complexity, paddability, self-reducibility, completeness, Kolmogorov complexity |
12 | Rajeev Alur, Thomas A. Henzinger |
A Really Temporal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(1), pp. 181-204, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
EXPSPACE-completeness, linear-time temporal logic, model checking, discrete time, real-time requirements, dense time |
12 | Foto N. Afrati, Christos H. Papadimitriou |
The Parallel Complexity of Simple Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(4), pp. 891-916, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
polynomial fringe, polynomial stock, pushdown, automaton, P-completeness, NC |
12 | Andrea S. LaPaugh |
Recontamination Does Not Help to Search a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(2), pp. 224-245, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
pursuit and evasion, NP-completeness, graph searching |
12 | Christos Papatheodorou, Vangelis Magirou, Vangelis Kiountouzis |
Problem decomposition in distributed problem-solving systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 3(4), pp. 301-315, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
NP-completeness, directed acyclic graphs, Distributed problem solving, problem decomposition |
12 | David Shallcross, Victor Y. Pan, Yu Lin-Kriz |
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 557-564, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
NC equivalence, planar integer linear programming, Euclidean GCD, NC-reduction, remainder sequence, positive integers, Euclidean algorithm, P-completeness |
12 | Snehamay Kundu |
Basis Sets for Synthesis of Switching Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(4), pp. 489-493, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
basis set, logic primitives, synthesis, logic design, completeness, switching function, switching functions, Reed-Muller expansion |
12 | Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder |
Theorem Proving Using Equational Matings and Rigid E-Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(2), pp. 377-429, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
Knuth-Bendix procedure, matings, NP-completeness, unification, automated theorem proving, equational reasoning |
12 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz |
The Isomorphism Conjecture Holds Relative to an Oracle ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 30-39, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
symmetric perfect generic sets, isomorphism conjecture, NP completeness, oracle |
12 | Greg N. Frederickson |
Planar Graph Decomposition and All Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(1), pp. 162-204, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
succinct encoding, approximation algorithm, NP-completeness, planar graph, graph embedding, all pairs shortest paths, outerplanar graph, compact routing table |
12 | Martin Gogolla, Uwe Hohenstein |
Towards a Semantic View of an Extended Entity-Relationship Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 16(3), pp. 369-416, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
relational completeness, abstract data type, formal semantics, entity-relationship model, calculus, semantic data model, aggregate function, safeness |
12 | Sanjoy K. Baruah, Gilad Koren, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha |
On-line Scheduling in the Presence of Overload ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 100-110, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
processor time, online scheduling algorithm, nontrivial performance, data structures, NP completeness, upper bounds, deadline, execution time, preemptive scheduling, optimal performance, sporadic tasks, uniprocessor |
12 | Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha |
Parallel Complexity in the Design and Analysis on Conurrent Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARLE (1) ![In: PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings, pp. 288-303, 1991, Springer, 3-540-54151-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
partially commutative monoids, PRAM algorithms, Petri nets, CCS, boolean circuits, P-completeness |
12 | Phokion G. Kolaitis, Christos H. Papadimitriou |
Some Computational Aspects of Circumscription ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 37(1), pp. 1-14, January 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Horn, Model checking, NP-completeness, first-order logic, nonmonotonic reasoning, undecidability, Circumscription |
12 | O. Deux |
The Story of O2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 2(1), pp. 91-108, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
O/sub 2/, disk management, overriding, user interface generation tools, complete programming environment, multilanguage paradigm, dual mode, workstation/server configuration, prototype performance, object-oriented programming, programming environment, DBMS, database management systems, query language, query languages, completeness, inheritance, typing, extensibility, sharing, persistence, encapsulation, complex objects, object-oriented database system, object identity |
12 | Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar |
Decision Problems for Propositional Linear Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 662-671, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
noncommutative propositional linear logic, propositional linear logic, multiplicative fragment, unrestricted weakening, NP-completeness, undecidability, decision problem, PSPACE-complete |
12 | Russell Impagliazzo, Leonid A. Levin |
No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 812-821, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
distributed NP problems, hard NP, DNP problem, P-time computable distributions, NP completeness, probability distributions, average-case complexity |
12 | Frank S. de Boer |
A Proof System for the Language POOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Foundations of Object-Oriented Languages, REX School/Workshop, Noordwijkerhout, The Netherlands, May 28 - June 1, 1990, Proceedings, pp. 124-150, 1990, Springer, 3-540-53931-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
partial correctness, completeness, Object, soundness, Hoare-logic, pointers, proof-system, rendezvous, object-creation |
12 | Michael Formann, Frank Wagner 0001 |
The VLSI layout in various embedding models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings, pp. 130-139, 1990, Springer, 3-540-53832-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
embedding models, Manhattan model, knock-knee model, routing, VLSI, NP-completeness, layout |
12 | Fritz Henglein |
Fast Left-Linear Semi-Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 82-91, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
semi-unification, left-linear, P-completeness |
12 | David Bernstein, Michael Rodeh, Izidor Gertner |
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(9), pp. 1308-1313, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
pipelined machines, scheduling, computational complexity, complexity, NP-completeness, parallel machines, parallel machines, polynomial-time algorithm, pipeline processing, scheduling problems, dedicated processors |
12 | Dimiter Vakarelov |
Modal Logics for Knowledge Representation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logic at Botik ![In: Logic at Botik '89, Symposium on Logical Foundations of Computer Science, Pereslav-Zalessky, USSR, July 3-8, 1989, Proceedings, pp. 257-277, 1989, Springer, 3-540-51237-3. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
knowledge representation systems, logics for knowledge representation, completeness theorems, filtration theorems, modal logics |
12 | Martin Gogolla |
Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89), pp. 259-274, 1989, Springer, 3-540-50939-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
Theory of data bases, relational completeness, data model, abstract data type, formal semantics, integrity constraint, entity-relationship model, calculus, aggregate function |
12 | Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata |
On the Complexity of Fixed Parameter Problems (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 210-215, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
fixed parameter problems, polynomially indexed relations, complexity, completeness, polynomial time, fixed-parameter tractability |
12 | Rob Gerth |
Foundations of Compositional Program Refinement - Safety Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989, Proceedings, pp. 777-807, 1989, Springer, 3-540-52559-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
algebraic process theory, assertional methods, (pre-)congruence, simulation, communication, concurrency, refinement, implementation, completeness, behavior, compositionality, transition system, full abstractness, shared variables |
12 | Leonid A. Levin |
Homogeneous Measures and Polynomial Time Invariants ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 36-41, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
pseudorandom strings, homogeneous measures, polynomial time invariants, average case NP-completeness, Kolmogorov complexity, probability distributions |
12 | Johan van Benthem |
Time, logic and computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, Proceedings, pp. 1-49, 1988, Springer, 3-540-51080-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
first-order definability, period structure, point structure, Completeness, correspondence, event structure, temporal operator, computational semantics, tense logic |
12 | Kamal Lodaya, Ramaswamy Ramanujam, P. S. Thiagarajan |
A logic for distributed transition systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, Proceedings, pp. 508-522, 1988, Springer, 3-540-51080-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
concurrent step, distributed transition systems, completeness, soundness, axiomatization |
12 | Grazyna Mirkowska, Andrzej Salwicki |
On Applications of Algorithmic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '86, 11th Colloquium on Trees in Algebra and Programming, Nice, France, March 24-26, 1986, Proceedings, pp. 288-306, 1986, Springer, 3-540-16443-X. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
algorithmic logic, LOGLAN, verification, specification, program, implementation, computation, completeness, extension, modules, expressivity, inference rules, axioms, semantical properties |
12 | Henryk Krawczyk, Marek Kubale |
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 34(9), pp. 869-872, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
diagnostic graph, diagnostic test scheduling, computational complexity, Approximation algorithm, NP-completeness, multicomputer system |
12 | Dan Benanav, Deepak Kapur, Paliath Narendran |
Complexity of Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings, pp. 417-429, 1985, Springer, 3-540-15976-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
Associative-Commutative, NP-Completeness, Matching, Associative, Commutative |
12 | Dana Richards |
Complexity of Single-Layer Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 33(3), pp. 286-288, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
single-layer routing, vertex disjoint paths, NP-completeness, planar graphs, VLSI design |
12 | Edward L. Robertson |
Microcode Bit Optimizations is N P-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 28(4), pp. 316-319, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
parallelism., Control memory, microprogrammming, NP-completeness, minimization |
12 | Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman |
Efficient Optimization of a Class of Relational Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 4(4), pp. 435-454, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
equivalence of queries, relational database, query optimization, NP-completeness, relational algebra, tableaux |
12 | Andrzej Lingas |
A PSPACE Complete Problem Related to a Pebble Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings, pp. 300-321, 1978, Springer, 3-540-08860-1. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
dag, completeness in polynomial space, computational complexity, PSPACE, pebble game, AND/OR graph |
12 | Hon Fung Li |
Scheduling Trees in Parallel/Pipelined Processing Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 26(11), pp. 1101-1112, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
Flush time, polynomial completeness, scheduling vector, parallel, reconfiguration, pipeline, tree, latency, structure, sharing, preemption |
11 | Sam Adam-Day, Nick Bezhanishvili, David Gabelaia, Vincenzo Marra |
Polyhedral Completeness of Intermediate Logics: the nerve criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 89(1), pp. 342-382, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Mohammad Golshani, Reihane Zoghifard |
Completeness of the Gödel-löB Provability Logic for the filter sequence of Normal Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 89(1), pp. 163-174, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Ryan Mcconkey, Oluwafemi Olukoya |
Runtime and Design Time Completeness Checking of Dangerous Android App Permissions Against GDPR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 12, pp. 1-22, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Dipeeka Luitel, Shabnam Hassani, Mehrdad Sabetzadeh |
Improving requirements completeness: automated assistance through large language models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Requir. Eng. ![In: Requir. Eng. 29(1), pp. 73-95, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Tobias Reinhard |
Semi-Automated Modular Formal Verification of Critical Software: Liveness and Completeness Thresholds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.00934, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Linda-Sophie Schneider, Gabriel Herl, Andreas K. Maier |
Integer Optimization of CT Trajectories using a Discrete Data Completeness Formulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.10223, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Matt White, Ibrahim Haddad, Cailean Osborne, Xiao-Yang Liu, Ahmed Abdelmonsef, Sachin Varghese |
The Model Openness Framework: Promoting Completeness and Openness for Reproducibility, Transparency and Usability in AI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.13784, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Zian Li, Xiyuan Wang, Shijia Kang, Muhan Zhang |
On the Completeness of Invariant Geometric Deep Learning Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.04836, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Hideo Bannai, Keisuke Goto 0001, Shunsuke Kanda, Dominik Köppl |
NP-Completeness for the Space-Optimality of Double-Array Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.04951, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Stefan Hetzl, Raheleh Jalali |
On the Completeness of Interpolation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.02829, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Hrishikesh Patel, Tianwa Chen, Ivano Bongiovanni, Gianluca Demartini |
Estimating Gender Completeness in Wikipedia. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.08993, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Christoph Glasmacher, Hendrik Weber, Lutz Eckstein |
Towards a Completeness Argumentation for Scenario Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.01934, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Andi Chen, Hua-Lei Yin, Zeng-Bing Chen, Shengjun Wu |
Hybrid Quantum-inspired Resnet and Densenet for Pattern Recognition with Completeness Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.05754, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Simon Razniewski, Hiba Arnaout, Shrestha Ghosh, Fabian M. Suchanek |
Completeness, Recall, and Negation in Open-world Knowledge Bases: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 56(6), pp. 150:1-150:42, June 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Renaud Vilmart |
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 20(1), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Hichem Belgacem, Xiaochen Li, Domenico Bianculli, Lionel C. Briand |
Learning-based Relaxation of Completeness Requirements for Data Entry Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 33(3), pp. 77:1-77:32, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Petr Kuchynka, Jirí Raclavský |
Completeness in partial type theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 34(1), pp. 1-32, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Zoran Ognjanovic, Angelina Ilic-Stepic, Aleksandar Perovic |
A Probabilistic Temporal Epistemic Logic: Strong Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 32(1), pp. 94-138, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Gonzalo de la Cruz, Madalena Lira, Oscar Luaces, Beatriz Remeseiro |
Eye-LRCN: A Long-Term Recurrent Convolutional Network for Eye Blink Completeness Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 35(4), pp. 5130-5140, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Camila Sanz, Adriana Marotta |
Context Based Completeness Assessment for Data Warehouse Hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DOLAP ![In: Proceedings of the 26th International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP 2024) co-located with the 27th International Conference on Extending Database Technology and the 27th International Conference on Database Theory (EDBT/ICDT 2024), Paestum, Italy, March 25, 2024., pp. 78-82, 2024, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
11 | Pierre Ohlmann, Michal Skrzypczak |
Positionality in Σ⁰₂ and a Completeness Result. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France, pp. 54:1-54:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-311-9. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Ian Shillito, Dominik Kirst |
A Mechanised and Constructive Reverse Analysis of Soundness and Completeness of Bi-intuitionistic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPP ![In: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2024, London, UK, January 15-16, 2024, pp. 218-229, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Alexandre Clément, Noé Delorme, Simon Perdrix, Renaud Vilmart |
Quantum Circuit Completeness: Extensions and Simplifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024, February 19-23, 2024, Naples, Italy, pp. 20:1-20:23, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-310-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Joanna Kaczmarek 0001, Jörg Rothe |
NPPP-Completeness of Control by Adding Players to Change the Penrose-Banzhaf Power Index in Weighted Voting Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024, Auckland, New Zealand, May 6-10, 2024, pp. 2318-2320, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
11 | Xiongjin Leng, Yan Yang 0001, Yongquan Jiang, Yan Liu |
A Road Surface Defect Segmentation Model Based on GLoRA and Multi-Scale Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BigComp ![In: IEEE International Conference on Big Data and Smart Computing, BigComp 2024, Bangkok, Thailand, February 18-21, 2024, pp. 48-55, 2024, IEEE, 979-8-3503-7002-7. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | W. P. M. H. Heemels, Aneel Tanwani |
Existence and Completeness of Solutions to Extended Projected Dynamical Systems and Sector-Bounded Projection-Based Controllers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Control. Syst. Lett. ![In: IEEE Control. Syst. Lett. 7, pp. 1590-1595, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Yoram Timmerman, Rihem Nasfi, Guy De Tré, Filip Pattyn, Antoon Bronselaer |
Cost-based analysis of the impact of data completeness and representational consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Decis. Support Syst. ![In: Decis. Support Syst. 175, pp. 114044, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Tahira Ullah, Sven Lautenbach, Benjamin Herfort, Marcel Reinmuth, Danijel Schorlemmer |
Assessing Completeness of OpenStreetMap Building Footprints Using MapSwipe. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPRS Int. J. Geo Inf. ![In: ISPRS Int. J. Geo Inf. 12(4), pp. 143, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Hugh Xuechen Liu, Jussi Holopainen, Christian Wagner 0001 |
A design strategy for Geo AR mobile game sustainable success emphasizing game completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entertain. Comput. ![In: Entertain. Comput. 46, pp. 100569, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | John L. Bell |
Axiomatization and Completeness for Some Restricted Second-Order Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Multiple Valued Log. Soft Comput. ![In: J. Multiple Valued Log. Soft Comput. 40(1-2), pp. 121-135, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
11 | Gunther Jäger |
Completeness for Saturated $\mathsf{L}$-Quasi-Uniform Limit Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TFSS ![In: TFSS 2(2), pp. 127-136, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Grigory K. Olkhovikov |
On the Completeness of Some First-order Extensions of C. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 10(1), pp. 57-114, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
11 | Tobias Fritz, Fabio Gadducci, Davide Trotta, Andrea Corradini 0001 |
From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 31(5), pp. 42, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Basit Ali, Stefan Cobzas, Mokhwetha Daniel Mabula |
Ekeland Variational Principle and Some of Its Equivalents on a Weighted Graph, Completeness and the OSC Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Axioms ![In: Axioms 12(3), pp. 247, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Kang Lu |
Completeness of Bethe Ansatz for Gaudin Models with gl(1|1) Symmetry and Diagonal Twists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 15(1), pp. 9, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Michal Kleinbort, Kiril Solovey, Zakary Littlefield, Kostas E. Bekris, Dan Halperin |
Corrections to "Probabilistic Completeness of RRT for Geometric and Kinodynamic Planning With Forward Propagation". ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Robotics Autom. Lett. ![In: IEEE Robotics Autom. Lett. 8(2), pp. 1149-1150, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Jean Fornerod, Hoai-Minh Nguyen |
The Weyl Law of Transmission Eigenvalues and the Completeness of Generalized Transmission Eigenfunctions without Complementing Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Math. Anal. ![In: SIAM J. Math. Anal. 55(4), pp. 3959-3999, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Adam Wright, Richard Schreiber, David W. Bates, Skye Aaron, Angela Ai, Raja Arul Cholan, Akshay Desai, Miguel Divo, David A. Dorr, Thu-Trang T. Hickman, Salman T. Hussain, Shari Just, Brian Koh, Stuart R. Lipsitz, Dustin McEvoy, S. Trent Rosenbloom, Elise M. Russo, David Yut-Chee Ting, Asli Weitkamp, Dean F. Sittig |
A multi-site randomized trial of a clinical decision support intervention to improve problem list completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Am. Medical Informatics Assoc. ![In: J. Am. Medical Informatics Assoc. 30(5), pp. 899-906, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Jennifer T. May, John Myers, Devon Noonan, Eleanor McConnell, Michael P. Cary |
A call to action to improve the completeness of older adult sexual and gender minority data in electronic health records. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Am. Medical Informatics Assoc. ![In: J. Am. Medical Informatics Assoc. 30(10), pp. 1725-1729, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Chinedu Aniekwe, Kendra Cuffe, Israel Audu, Nannim Nalda, Bright Ibezim, Michael Nnakwe, ThankGod Anazodo, Mubarak Dada, Erin Rottinghaus Romano, McPaul Okoye, Monte Martin, Ritu Shrivastava |
Assessing the effect of electronic health information exchange on the completeness and validity of data for measuring viral load testing turnaround time in Nigeria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Medical Informatics ![In: Int. J. Medical Informatics 174, pp. 105059, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Davide Ancona, Pietro Barbieri, Elena Zucca |
Checked corecursive streams: Expressivity and completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 974, pp. 114081, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Joanna Alvarado-Uribe, Ari Yair Barrera-Animas, Miguel González-Mendoza 0001, Ariel Lucien García-Gamboa, Neil Hernández-Gress |
Towards a Standardized Evaluation of APIs Non-Functional Requirements Focused on Completeness and Soundness Qualities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computación y Sistemas (CyS) ![In: Computación y Sistemas (CyS) 27(4), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
11 | Adrian de Wynter |
Turing Completeness and Sid Meier's Civilization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Games ![In: IEEE Trans. Games 15(2), pp. 292-299, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Alexandru Baltag, Nick Bezhanishvili, David Fernández-Duque |
The Topological Mu-Calculus: Completeness and Decidability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 70(5), pp. 33:1-33:38, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Noam Mazor |
Key-Agreement with Perfect Completeness from Random Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
11 | Kalle Kujanpää, Joni Pajarinen, Alexander Ilin |
Hybrid Search for Efficient Planning with Completeness Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.12819, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Dusko Pavlovic, Temra Pavlovic |
From Gödel's Incompleteness Theorem to the completeness of bot religions (Extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.14338, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | José Ángel Acosta, Anthony M. Bloch, David Martín de Diego |
Completeness of Riemannian metrics: an application to the control of constrained mechanical systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.14969, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Iasson Karafyllis, Dionysis Theodosis, Markos Papageorgiou |
Forward Completeness and Applications to Control of Automated Vehicles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11515, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Simon Razniewski, Hiba Arnaout, Shrestha Ghosh, Fabian M. Suchanek |
Completeness, Recall, and Negation in Open-World Knowledge Bases: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.05403, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Tobias Reinhard, Justus Fasse, Bart Jacobs 0002 |
Completeness Thresholds for Memory Safety of Array Traversing Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.03606, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Muhammad Ilyas Azeem, Sallam Abualhaija |
A Multi-solution Study on GDPR AI-enabled Completeness Checking of DPAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.13881, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid, Alexandra Silva 0001 |
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.01755, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Amanda Vidal |
On the local consequence of modal Product logic: standard completeness and decidability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.13903, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
11 | Tobias Reinhard, Justus Fasse, Bart Jacobs 0002 |
Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.09731, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #601 - #700 of 5530 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ 16][ >>] |
|