|
|
Venues (Conferences, Journals, ...)
|
|
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 |
11 | Wei Sun 0002, Clement T. Yu |
Semantic Query Optimization for Tree and Chain Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(1), pp. 136-151, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
chain queries, knowledge-based query optimization, semantically equivalent transformations, unnecessary joins, redundant beneficial/nonbeneficial selection operations, acyclic queries, closure chain queries, equi-join attributes, restriction closure computation, computational complexity, query processing, knowledge based systems, NP complete, time complexity, database theory, trees (mathematics), semantic query optimization, query graphs, tree queries |
11 | Philippe Mathieu, Jean-Paul Delahaye |
A Kind of Achievement by Parts Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning, 5th International Conference, LPAR'94, Kiev, Ukraine, July 16-22, 1994, Proceedings, pp. 320-332, 1994, Springer, 3-540-58216-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Topics Logic of Knowledge, Complete computation, Deduction |
11 | R. Ravi 0001 |
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 202-213, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
minimum gossip time problem, rapid rumor ramification, minimum broadcast time approximation, minimum broadcast time problem, telephone model, multicast problem, NP-complete, NP-hard, undirected graph, conference calls |
11 | Silvio Micali |
CS Proofs (Extended Abstracts) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 436-453, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
computationally sound proof, CS proofs, computationally-based notion, cryptographic assumption, computational complexity, NP complete problem, polynomial time, proof, random oracle |
11 | Hirotsugu Kakugawa, Satoshi Fujita, Masafumi Yamashita, Tadashi Ae |
Availability of k-Coterie. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(5), pp. 553-558, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
distributed k-mutual-exclusion problem, k-mutex problem, distribution system, graph theory, distributed processing, concurrency control, network topology, critical section, complete graph |
11 | Shirish Bhide, Nigel M. John, Mansur R. Kabuka |
A Boolean Neural Network Approach for the Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(10), pp. 1271-1278, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Boolean neural network, simulation, scheduling, real-time systems, real-time systems, computational complexity, simulated annealing, combinatorial optimization, Boolean functions, traveling salesman problem, neural nets, job scheduling, NP-complete problems, noise immunity, hardware complexity, simulated annealing algorithm |
11 | Nageswara S. V. Rao |
Computational Complexity Issues in Operative Diagnosis of Graph-Based Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(4), pp. 447-457, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
graph-based systems, alarm placement, fault propagation time, alarm placement problem, computational complexity, computational complexity, fault diagnosis, fault tolerant computing, NP-complete, fault propagation |
11 | Vijay Raghavan 0002 |
On Asymmetric Invalidation with Partial Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(6), pp. 764-768, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
asymmetric invalidation, partial tests, diagnosability problem, co-NP complete, computational complexity, fault diagnosis, logic testing, diagnosis algorithm |
11 | Gilles Brassard, Claude Crépeau, Richard Jozsa, Denis Langlois |
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties ![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. 362-371, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
circular polarization, quantum bit commitment scheme, complete protocol, polarized photons, conjugate transmission-reception basis |
11 | David W. Juedes, Jack H. Lutz |
The Complexity and Distribution of Hard Problems (Extended Abstract) ![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. 177-185, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
complete languages, hard problems, time complexity classes, hard languages, complexity, distribution, reducibility |
11 | Stavros S. Cosmadakis |
Logical Reducibility and Monadic NP ![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. 52-61, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
syntactically restricted first-order reductions, logical reducibility, monadic NP, polynomial-time many-one reductions, directed reachability, encodings, first-order logic, NP-complete problems, relational structures |
11 | Richa Agarwala, David Fernández-Baca |
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed ![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. 140-147, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
perfect phylogeny problem, character states, NP-complete, polynomial-time algorithm |
11 | Majid Sarrafzadeh, C. K. Wong |
Bottleneck Steiner Trees in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(3), pp. 370-374, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
bottleneck Steiner trees, maximum-weight edge minimized, linear decision tree model, communication network design, computational complexity, lower bound, optimisation, NP-complete, trees (mathematics), VLSI layout, location problems |
11 | Cheol-Hoon Lee, Dongmyun Lee, Myunghwan Kim 0001 |
Optimal Task Assignment in Linear Array Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(7), pp. 877-880, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
optimal task assignment, linear array networks, network flow approach, two-terminal network flow problem, computational complexity, distributed processing, NP-complete, computer networks, communication costs, task assignment, distributed computing system |
11 | Krishna P. Belkhale, Prithviraj Banerjee |
Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(1), pp. 83-96, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
reconfiguration strategies, VLSI processor arrays, Diogenes approach, rectangular arrays, VLSI, fault tolerant computing, trees, trees (mathematics), circuit layout CAD, complete binary tree |
11 | Kostas N. Oikonomou |
Abstractions of Finite-State Machines and Immediately-Detectable Output Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(3), pp. 325-338, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
immediately-detectable output faults, nondeterministic machine, approximately optimal partition, computational complexity, data structures, fault tolerant computing, abstraction, NP-complete, finite-state machines, polynomial-time algorithm, finite automata, set partitioning |
11 | Rajeev Alur, Thomas A. Henzinger |
Back to the Future: Towards a Theory of Timed Regular Languages ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 177-186, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
theory of timed regular languages, two-way timed automata, temporal logic, undecidability, boolean operations, PSPACE-complete |
11 | Bernd Becker 0001 |
Synthesis for Testability: Binary Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pp. 501-512, 1992, Springer, 3-540-55210-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
VLSI structures, (complete, full) testability, synthesis, fault model, algorithms and data structures |
11 | Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan |
The Twisted N-Cube with Application to Multiprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(1), pp. 88-93, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
twisted N-cube, n-regular graphs, graph theory, connectivity, hypercube networks, trees (mathematics), multiprocessing, disjoints paths, hypercube multiprocessors, complete binary tree, subgraph |
11 | Chung-Kuan Cheng, So-Zen Yao, T. C. Hu |
The Orientation of Modules Based on Graph Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(6), pp. 774-780, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
layout stage, total net length, printed circuits, computational complexity, VLSI, VLSI, graph theory, NP-complete, modules, orientation, circuit layout CAD, routability, minimum cut, graph decomposition, printed circuit board, graph problem |
11 | O. J. Murphy, R. L. McCraw |
Designing Storage Efficient Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(3), pp. 315-320, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
storage efficient decision trees, storage optimal decision tree, information-theoretic heuristic, computational complexity, computational complexity, data structures, trees (mathematics), decision theory, NP-complete problem, decision tables, decision tables |
11 | Tzong-An Su, Gultekin Özsoyoglu |
Controlling FD and MVD Inferences in Multilevel Relational Database Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 3(4), pp. 474-485, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
FD inferences, attribute classification, MVD inferences, multilevel relational database, record classification, FD-compromises, minimum information loss, MVD-compromises, conflict-free MVDs, computational complexity, relational databases, database theory, inference mechanisms, functional dependencies, NP-complete problem, exact algorithm, necessary and sufficient conditions, multivalued dependencies |
11 | Dennis E. Shasha, Jason Tsong-Li Wang |
Optimizing Equijoin Queries In Distributed Databases Where Relations Are Hash Partitioned. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 16(2), pp. 279-308, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
equijoin, systems, spanning trees, hashing, NP-complete problems, relational data models |
11 | David Baraff |
Coping with friction for non-penetrating rigid body simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 18th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1991, Providence, RI, USA, April 27-30, 1991, pp. 31-41, 1991, ACM, 0-89791-436-8. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
NP-complete, dynamics, friction |
11 | Martin L. Brady, Majid Sarrafzadeh |
Stretching a Knock-Knee Layout for Multilayer Wiring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(1), pp. 148-151, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
knock-knee layout stretching, multilayer wiring, knock-knee mode, 4/3 approximation algorithm, VLSI, VLSI, NP-complete, optimal algorithm, circuit layout CAD |
11 | 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 |
11 | László Babai, Lance Fortnow, Carsten Lund |
Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols ![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 I, pp. 16-25, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
efficient provability, multiple prover interactive proof systems, two-prover interactive protocols, noncommunicating provers, randomizing polynomial-time verifier, coNP-complete languages, nondeterministic exponential time, polynomial time |
11 | 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 |
11 | Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann 0001, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger |
Drawing Graphs in the Plane with High Resolution ![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 I, pp. 86-95, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
high resolution planar graph drawing, straight line edges, minimum angle, incident edges, maximum node degree, hypercubes, NP-hard problem, counting, complete graphs, tori, multidimensional meshes |
11 | Xiaotie Deng, Christos H. Papadimitriou |
Exploring an Unknown Graph (Extended Abstract) ![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 I, pp. 355-361, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
unknown graph exploration, strongly connected graph, Eulerian graphs, bounded ratio, directed graph, PSPACE-complete, worst-case ratio |
11 | K. V. S. Ramarao |
Distributed Algorithms for Network Recognition Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(9), pp. 1240-1248, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
unified algorithms, network recognition, noncentralized initiations, computational complexity, distributed algorithms, distributed processing, computer networks, tree, time complexities, communication complexity, bipartite graph, ring, centralized, decentralized, star, complete graph |
11 | Rajiv M. Dewan, Bezalel Gavish |
Models for the Combined Logical and Physical Design of Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(7), pp. 955-967, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
integrated formulation, model, databases, NP-complete, database management systems, transactions, decomposition, database theory, database theory, physical design, mathematical program, combined logical |
11 | Alan A. Bertossi, Maurizio A. Bonuccelli |
A Gracefully Degradable VLSI System for Linear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(6), pp. 853-861, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
gracefully degradable, fault-tolerant VLSI system, linear programming problems, interconnection pattern, cousin nodes, ternary tree, faulty processing elements, computational complexity, VLSI, fault tolerant computing, linear programming, multiple faults, complete binary tree, simplex algorithm |
11 | Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis |
The Parallel Complexity of the Subgraph Connectivity Problem ![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. 294-299, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
triconnected components, subgraph connectivity problem, induced subgraph, cardinality, parallel complexity, P-complete |
11 | Cheng Ng |
Lower Bounds for the Stable Marriage Problem and its Variants ![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. 129-133, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
men, opposite sex, order of preference, complete matching, lower bound, ranks, women, worst case, stable marriage problem, partners |
11 | Odile Marcotte, Subhash Suri |
Fast Matching Algorithms for Points on a Polygon (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. 60-65, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
Ackermann function, endpoints, minimum-weight perfect matching, verification problem, nonconvex polygons, functional inverse, weights, edges, boundary, assignment problem, Euclidean distance, convex polygon, simple, complete graph, nonconvex |
11 | Yuejun Jiang |
An Autoepistemic Logical View of Knowledge Base. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings, pp. 68-77, 1989, Springer, 3-540-52048-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
AI in Database, Incomplete knowledge, Complete Database, Nonstandard Logic, Modal logic, Deductive database, Integrity Constraints, Non-monotonic logic, Closed World Assumption, Possible worlds semantics, Autoepistemic logic |
11 | Elias Dahlhaus, Péter Hajnal, Marek Karpinski |
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs ![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. 186-193, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Hamiltonian cycle problem, dense graphs, concurrent-read-exclusive-write parallel random-access machine, graph, NP-complete, perfect matching, vertex, optimal parallel algorithm, polylogarithmic factor |
11 | Olivier Goldschmidt, Dorit S. Hochbaum |
Polynomial Algorithm for the k-Cut Problem ![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. 444-451, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
k-cut problem, edge weighted graph, k nonempty components, total edge weight, partition, NP-complete, NP hard, polynomial algorithm, vertex |
11 | Hans L. Bodlaender |
Dynamic Programming on Graphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 105-118, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
graph decision problems, restrictions of NP-complete problems, local condition compositions, dynamic programming, polynomial time algorithms, Treewidth, partial k-trees |
11 | Hans L. Bodlaender |
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 223-232, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Chromatic Index, graphs with small treewidth, polynomial time algorithms, NP-complete problems, Graph Isomorphism, tree-decompositions, partial k-trees |
11 | Ryosaku Shimada, Yoshiteru Ohkura, Jun-ichi Aoe |
Nonbinary Arithmetic AN Codes Using Odd Radix Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 34(11), pp. 1050-1056, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
symmetric R-ary expressions, Absolute-minimum complete residue system, arithmetic AN codes, arithmetic error, cyclic SR -AN codes, Lee-type arithmetic distance |
11 | Hisao Kameda |
Optimality of a Central Processor Scheduling Policy for Processing a Job Stream ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 2(1), pp. 78-90, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
1/0 bound, CPU bound, Markovian queuing model, dispatching policy, finite-source queue, job stream, machine repairman model, multiple-resource system, near-complete decomposability, multiprogramming, CPU scheduling, preemptive priority |
11 | Inder S. Gopal, Don Coppersmith, C. K. Wong |
Optimal Wiring of Movable Terminals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 32(9), pp. 845-858, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
wiring channels, movable terminals, VLSI chip design, dynamic programming, optimal algorithms, Analysis of algorithms, NP-complete problems, wiring, vias |
11 | Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida |
On Minimal Test Sets for Locating Single Link Failures in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 30(3), pp. 182-190, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
network diagnosis, system graph, Algorithm, complexity, test, NP-complete, tree, diagnosis |
11 | Gururaj S. Rao, Harold S. Stone, T. C. Hu |
Assignment of Task in a Distributed Processor System with Limited Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 28(4), pp. 291-299, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
Ford?Fulkerson algorithm, Gomory?Hu cut trees, multiterminal maximal flows, load balancing, distributed computers, Computer networks, NP-complete problems, cutsets |
11 | Joseph Y.-T. Leung, Edmund K. Lai |
On Minimum Cost Recovery from System Deadlock. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 28(9), pp. 671-677, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
average-case performance, minimum cost deadlock recovery, system deadlock, Approximation algorithms, time complexity, NP-complete problems, worst case performance |
11 | John B. Kam, George I. Davida |
Structured Design of Substitution-Permutation Encryption Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 28(10), pp. 747-753, 1979. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
substitution-permutation (SP) networks, Complete SP networks, encryption, data security, data encryption standard |
11 | Hideo Fujiwara, Kozo Kinoshita |
On the Computational Complexity of System Diagnosis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 27(10), pp. 881-885, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
polynomially complete, Fault diagnosis, polynomial time algorithm, Turing machines, self-diagnosable systems |
11 | Vinod K. Agarwal, Gerald M. Masson |
Resolution-Oriented Fault Interrelationships in Combinational Logic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 26(11), pp. 1170-1175, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
Boolean difference, combinational logic networks, complete masking, fault dependent Boolean difference, fault dependent testing, fault interrelationships, fault resolution, multiple fault analysis, unresolvability, functional equivalence |
11 | Borzoo Bonakdarpour, Ali Ebnenasir, Sandeep S. Kulkarni |
Complexity results in revising UNITY programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Auton. Adapt. Syst. ![In: ACM Trans. Auton. Adapt. Syst. 4(1), pp. 5:1-5:28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
formal methods, UNITY |
11 | Gianluca Amato, Francesca Scozzari |
Observational Completeness on Abstract Interpretation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 99-112, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
11 | Paul Brodhead, Bjørn Kjos-Hanssen |
The Strength of the Grätzer-Schmidt Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 59-67, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
computability theory, lattice theory |
11 | Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin |
Average-Case Analyses of Vickrey Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 434-447, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST |
11 | Emine Yilmaz, Javed A. Aslam |
Estimating average precision when judgments are incomplete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 16(2), pp. 173-211, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bpref, infAP, Evaluation, Robustness, Average precision, Incomplete judgments |
11 | David Avis, Hiroshi Imai, Tsuyoshi Ito |
Generating facets for the cut polytope of a graph by triangular elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(2), pp. 303-325, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52B12, 90C57, 05C99 |
11 | José Meseguer 0001, Prasanna Thati |
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
High. Order Symb. Comput. ![In: High. Order Symb. Comput. 20(1-2), pp. 123-160, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rewrite theories, Security protocols, Reachability, Narrowing |
11 | Salvatore La Torre, Gennaro Parlato |
On the Complexity of LtlModel-Checking of Recursive State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 937-948, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
11 | Li-Chun Wang 0001, Chih-Wen Chang |
On the performance of multicarrier DS-CDMA with imperfect power control and variable spreading factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 24(6), pp. 1154-1166, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Shai Rubin, Somesh Jha, Barton P. Miller |
On the Completeness of Attack Mutation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: 19th IEEE Computer Security Foundations Workshop, (CSFW-19 2006), 5-7 July 2006, Venice, Italy, pp. 43-56, 2006, IEEE Computer Society, 0-7695-2615-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Anantharaman Lakshminarayanan, Tong-Lee Lim |
Augmented Certificate Revocation Lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 11th Australasian Conference, ACISP 2006, Melbourne, Australia, July 3-5, 2006, Proceedings, pp. 87-98, 2006, Springer, 3-540-35458-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi |
About the Lifespan of Peer to Peer Networks, . ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, pp. 290-304, 2006, Springer, 3-540-49990-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
11 | John H. Reif, Sudheer Sahu, Peng Yin 0003 |
Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers., pp. 257-274, 2005, Springer, 3-540-34161-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Vincent Conitzer, Tuomas Sandholm |
Complexity of (iterated) dominance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5-8, 2005, pp. 88-97, 2005, ACM, 1-59593-049-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
(iterated) dominance, game theory |
11 | Lefteris M. Kirousis, Phokion G. Kolaitis |
A Dichotomy in the Complexity of Propositional Circumscription. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 37(6), pp. 695-715, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 124-136, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Stephen D. Travers |
The Complexity of Membership Problems for Circuits over Sets of Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 322-333, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Xingquan Zhu 0001, Xindong Wu 0001 |
Data Acquisition with Active and Impact-Sensitive Instance Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA, pp. 721-726, 2004, IEEE Computer Society, 0-7695-2236-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Julia Kempe, Alexei Y. Kitaev, Oded Regev 0001 |
The Complexity of the Local Hamiltonian Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 372-383, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Eric Allender, Vikraman Arvind, Meena Mahajan |
Arithmetic Complexity, Kleene Closure, and Formal Power Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(4), pp. 303-328, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
11 | Wonil Lee, Donghoon Chang, Sangjin Lee 0002, Soo Hak Sung, Mridul Nandi |
New Parallel Domain Extenders for UOWHF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30 - December 4, 2003, Proceedings, pp. 208-227, 2003, Springer, 3-540-20592-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
UOWHF, masking assignment, sequential construciton, parallel construction, tree based construction, hash function |
11 | Harry G. Mairson, Kazushige Terui |
On the Computational Complexity of Cut-Elimination in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, pp. 23-36, 2003, Springer, 3-540-20216-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
11 | Severino Villanueva Gervacio, Romulo C. Guerrero, Helen M. Rara |
Folding Wheels and Fans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(4), pp. 731-737, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
11 | Giuseppe Della Penna, Benedetto Intrigila, Enrico Tronci, Marisa Venturini Zilli |
Exploiting Transition Locality in the Disk Based Mur phi Verifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proceedings, pp. 202-219, 2002, Springer, 3-540-00116-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
11 | Mitsunori Ogihara, Seinosuke Toda |
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 585-597, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
11 | S. Sriram, R. Tandon, Pallab Dasgupta, P. P. Chakrabarti 0001 |
Symbolic verification of Boolean constraints over partially specified functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2001 International Symposium on Circuits and Systems, ISCAS 2001, Sydney, Australia, May 6-9, 2001, pp. 113-116, 2001, IEEE, 0-7803-6685-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
11 | James Laird |
Finite Models and Full Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 384-398, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
affine logic, full completeness, effective presentability, linear logic, PCF |
11 | Héctor Muñoz-Avila, David W. Aha, Len Breslow, Dana S. Nau, Rosina Weber-Lee |
Integrating Conversational Case Retrieval with generative Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWCBR ![In: Advances in Case-Based Reasoning, 5th European Workshop, EWCBR 2000, Trento, Italy, September 6-9, 2000, Proceedings, pp. 210-221, 2000, Springer, 3-540-67933-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Conversational case retrieval, integrations, planning |
11 | Arnaud Durand 0001, Miki Hermann, Laurent Juban |
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings, pp. 92-102, 1999, Springer, 3-540-66408-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
11 | Andreas Jakoby, Christian Schindelhauer |
On the Complexity of Worst Case and Expected Time in a Circuit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 295-306, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
expected time, computational complexity, average case analysis, worst case, theory of parallel and distributed computation, timed circuits |
11 | Volker Diekert, Edward Ochmanski, Klaus Reinhardt |
On Confluent Semi-Commutations - Decidability and Complexity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 229-241, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
11 | Staffan Bonnier |
Unification in Incompletely Specified Theories: A Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS'91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings, pp. 84-92, 1991, Springer, 3-540-54345-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
11 | Solomampionona Ranaivoson |
Nontrivial Lower Bounds for some NP-Problems on Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings, pp. 318-339, 1990, Springer, 3-540-54487-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
11 | Edmund M. Clarke |
Programming Language Constructs for Which it is Impossible to Obtain "Good" Hoare-Like Axiom Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 10-20, 1977, ACM. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
10 | Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman, Andrzej Wasowski |
Timed I/O automata: a complete specification theory for real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2010, Stockholm, Sweden, April 12-15, 2010, pp. 91-100, 2010, ACM, 978-1-60558-955-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
specification theory, timed i/o automata, real-time, interfaces, refinement |
10 | Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, Philippe Suter |
Complete functional synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, June 5-10, 2010, pp. 316-329, 2010, ACM, 978-1-4503-0019-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
bapa, synthesis procedure, decision procedure, presburger arithmetic |
10 | Dave Christie, Jae-Woong Chung, Stephan Diestelhorst, Michael Hohmuth, Martin Pohlack, Christof Fetzer, Martin Nowack, Torvald Riegel, Pascal Felber, Patrick Marlier, Etienne Rivière |
Evaluation of AMD's advanced synchronization facility within a complete transactional memory stack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroSys ![In: European Conference on Computer Systems, Proceedings of the 5th European conference on Computer systems, EuroSys 2010, Paris, France, April 13-16, 2010, pp. 27-40, 2010, ACM, 978-1-60558-577-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
transactional memory |
10 | Muhammad Adeel Pasha, Steven Derrien, Olivier Sentieys |
A complete design-flow for the generation of ultra low-power WSN node architectures based on micro-tasking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 693-698, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
WSN node, hardware specialization, microcoded architecture, low-power design |
10 | |
Chandra and Harel Complete Query Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Database Systems ![In: Encyclopedia of Database Systems, pp. 317, 2009, Springer US, 978-0-387-35544-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Peter Bürgisser, Felipe Cucker |
Exotic Quantifiers, Complexity Classes, and Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 9(2), pp. 135-170, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 68Q17 |
10 | Pablo Chico de Guzmán, Manuel Carro, Manuel V. Hermenegildo |
Towards a Complete Scheme for Tabled Execution Based on Program Transformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 11th International Symposium, PADL 2009, Savannah, GA, USA, January 19-20, 2009. Proceedings, pp. 224-238, 2009, Springer, 978-3-540-92994-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Continuation-call tabling, Performance, Program transformation, Implementation, Tabled logic programming |
10 | Katsuhiko Sano |
Sound and Complete Tree-Sequent Calculus for Inquisitive Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 365-378, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Isil Dillig, Thomas Dillig, Alex Aiken |
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, pp. 233-247, 2009, Springer, 978-3-642-02657-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Philippe Moret, Walter Binder, Alex Villazón |
CCCP: complete calling context profiling in virtual execution environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2009, Savannah, GA, USA, January 19-20, 2009, pp. 151-160, 2009, ACM, 978-1-60558-327-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
calling context profiling, native code, java virtual machine, bytecode instrumentation |
10 | Liangcai Shu, Bo Long, Weiyi Meng |
A Latent Topic Model for Complete Entity Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 880-891, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Pablo Cordero, Manuel Enciso, Ángel Mora 0001, Inmaculada Perez de Guzmán |
A Complete Logic for Fuzzy Functional Dependencies over Domains with Similarity Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN (1) ![In: Bio-Inspired Systems: Computational and Ambient Intelligence, 10th International Work-Conference on Artificial Neural Networks, IWANN 2009, Salamanca, Spain, June 10-12, 2009. Proceedings, Part I, pp. 261-269, 2009, Springer, 978-3-642-02477-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos |
A Complete Characterisation of the Linear Clique-Width of Path Powers. ![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. 241-250, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Gerold Jäger, Sharlee Climer, Weixiong Zhang |
Complete Parsimony Haplotype Inference Problem and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 337-348, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Alain Finkel, Jean Goubault-Larrecq |
Forward Analysis for WSTS, Part II: Complete WSTS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 188-199, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Tom Schrijvers, Simon L. Peyton Jones, Martin Sulzmann, Dimitrios Vytiniotis |
Complete and decidable type inference for GADTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, ICFP 2009, Edinburgh, Scotland, UK, August 31 - September 2, 2009, pp. 341-352, 2009, ACM, 978-1-60558-332-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Haskell, type inference, GADTs |
|
|