|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 606 occurrences of 472 keywords
|
|
|
Results
Found 1309 publication records. Showing 1309 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
92 | Jean Goubault-Larrecq |
Well-Founded Recursive Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 484-497, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
well-foundedness, path orderings, Knuth-Bendix orderings, higher-order path orderings, graphs, automata, Termination, calculus |
88 | Jean-Pierre Jouannaud, Albert Rubio |
Polymorphic higher-order recursive path orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(1), pp. 2:1-2:48, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Automated termination prover tool, Gödel's polymorphic recursor, higher-order rewriting, termination orderings, typed lambda calculus |
79 | Danny De Schreye, Alexander Serebrenik |
Acceptability with General Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic: Logic Programming and Beyond ![In: Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I, pp. 187-210, 2002, Springer, 3-540-43959-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
orderings, acceptability, termination analysis |
79 | Alexander Serebrenik, Danny De Schreye |
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR (LNCS 2042: Selected Papers) ![In: Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000 London, UK, July 24-28, 2000, Selected Papers., pp. 69-85, 2000, Springer, 3-540-42127-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
acceptability, termination analysis, term-orderings |
78 | Leo Bachmair, David A. Plaisted |
Associative Path Orderings. ![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. 241-254, 1985, Springer, 3-540-15976-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
73 | Bing Bing Zhou, Richard P. Brent |
On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 3rd Euromicro Workshop on Parallel and Distributed Processing (PDP '95), January 25-27, 1995, San Remo, Italy, pp. 401-408, 1995, IEEE Computer Society, 0-8186-7031-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
one-sided Jacobi algorithm, column norms, parallel Jacobi orderings, parallel orderings, Fujitsu AP1000, parallel algorithms, sorting, singular value decomposition, singular value decompositions, equivalence, parallel implementation, Jacobian matrices |
70 | Ulrich Bodenhofer, Josef Küng |
Fuzzy orderings in flexible query answering systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 8(7), pp. 512-522, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Flexible query answering systems, Fuzzy orderings, Vague query system, Relational databases |
69 | Nick Cropper, Ursula Martin |
The Classification of Polynomial Orderings on Monadic Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(3), pp. 197-226, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Termination, Term rewriting systems, Ordinals |
69 | Albert Rubio |
Extension Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 511-522, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
69 | Deepak Kapur, G. Sivakumar |
Maximal Extensions os Simplification Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 225-239, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
69 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 65-80, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
69 | Joachim Steinbach |
Extensions and Comparison of Simplification Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings, pp. 434-448, 1989, Springer, 3-540-51081-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
61 | Guillem Godoy, Robert Nieuwenhuis |
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 9(3), pp. 167-192, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
symbolic constraints, built-in theories, automated deduction, term orderings |
60 | Franz Baader |
Combination of Compatible Reduction Orderings that are Total on Ground Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 2-13, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
60 | Joachim Steinbach |
Improving Assoviative Path Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings, pp. 411-425, 1990, Springer, 3-540-52885-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
56 | Andreas Weiermann |
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets. ![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. 488-498, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
well-partial orderings, maximal order types, finite multisets, well-quasi orderings, ordinals, term orderings |
54 | Basile Schaeli, Roger D. Hersch |
Dynamic testing of flow graph based parallel applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADTAD ![In: Proceedings of the 6th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging, held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008), PADTAD 2008, Seattle, Washington, USA, July 20-21, 2008, pp. 2, 2008, ACM, 978-1-60558-052-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
54 | Basile Schaeli, Sebastian Gerlach, Roger D. Hersch |
Decomposing Partial Order Execution Graphs to Improve Message Race Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA, pp. 1-8, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Wilfred Ng |
Inferring Functional Dependencies in Linerly Ordered Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 9th International Conference, DEXA '98, Vienna, Austria, August 24-28, 1998, Proceedings, pp. 186-195, 1998, Springer, 3-540-64950-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Luis M. de Campos, José Miguel Puerta |
Stochastic Local Algorithms for Learning Belief Networks: Searching in the Space of the Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 6th European Conference, ECSQARU 2001, Toulouse, France, September 19-21, 2001, Proceedings, pp. 228-239, 2001, Springer, 3-540-42464-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Stochastic Hill-Climbing Search, Learning, Variable Neighborhood Search, Belief Networks, Causal Orderings |
51 | Jürgen Stuber |
Theory Path Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 148-162, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Thomas Arts, Jürgen Giesl |
Automatically Proving Termination Where Simplification Orderings Fail. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings, pp. 261-272, 1997, Springer, 3-540-62781-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
51 | Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi |
Completion for Multiple Reduction Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 71-85, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
46 | Gianni Bosi, Juan Carlos Candeal, Esteban Induráin, Esteban Olóriz, Margarita Zudaire |
Numerical Representations of Interval Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(2), pp. 171-190, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
orderings on a set, numerical representations of orderings, interval-orders |
46 | Maria Paola Bonacina, Nachum Dershowitz |
Abstract canonical inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(1), pp. 6, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
proof orderings, fairness, redundancy, completeness, completion, Inference, saturation, canonicity |
45 | Marc Bezem, Tore Langholm, Michal Walicki |
Completeness and Decidability in Sequence Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings, pp. 123-137, 2007, Springer, 978-3-540-75558-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Didier Dubois, Henri Prade |
Approximate and Commonsense Reasoning: From Theory to Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 9th International Symposium, ISMIS '96, Zakopane, Poland, June 9-13, 1996, Proceedings, pp. 19-33, 1996, Springer, 3-540-61286-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
43 | Vincent Astier, Marcus Tressl |
Axiomatization of local-global principles for pp-formulas in spaces of orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(1), pp. 77-95, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Spaces of orderings, Special groups, Positive-primitive formulas, Local-global principles, Isotropy theorem, Model theory, Quadratic forms |
43 | Aleksey Zobnin |
Admissible orderings and finiteness criteria for differential standard bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 365-372, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Gröbner bases, admissible orderings, differential algebra |
43 | Leo Bachmair, Nachum Dershowitz |
Equational Inference, Canonical Proofs, and Proof Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(2), pp. 236-276, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
term rewriting, rewrite systems, proof theory, equational logic, inference systems, term orderings |
42 | Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal |
Logic and Rational Languages of Words Indexed by Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 76-85, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Prasad A. Kulkarni, David B. Whalley, Gary S. Tyson, Jack W. Davidson |
In search of near-optimal optimization phase orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the 2006 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'06), Ottawa, Ontario, Canada, June 14-16, 2006, pp. 83-92, 2006, ACM, 1-59593-362-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
genetic algorithms, exhaustive search, phase ordering |
42 | Alexis Bès, Olivier Carton |
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings, pp. 158-167, 2005, Springer, 3-540-26546-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Alberto Marcone |
Fine Analysis of the Quasi-Orderings on the Power Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 18(4), pp. 339-347, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
better quasi-ordering, wqo, well quasi-ordering |
42 | Véronique Bruyère, Olivier Carton |
Automata on Linear Orderings. ![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. 236-247, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Marcello M. Bonsangue, Joost N. Kok |
Semantics, Orderings and Recursion in the Weakest Precondition Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Sematics: Foundations and Applications, REX Workshop, Beekbergen, The Netherlands, June 1-4, 1992, Proceedings, pp. 91-109, 1992, Springer, 3-540-56596-5. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
fixed point transformations, Smyth powerdomain, Egli-Milner powerdomain, refinement, deadlock, recursion, fixed points, backtracking, weakest preconditions, predicate transformers |
42 | Dieter Hofbauer |
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings, pp. 347-358, 1990, Springer, 3-540-53162-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
36 | Paolo Boldi, Massimo Santini 0001, Sebastiano Vigna |
Permuting Web Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, 6th International Workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009. Proceedings, pp. 116-126, 2009, Springer, 978-3-540-95994-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Shinya Umeno |
Event order abstraction for parametric real-time system verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Proceedings of the 8th ACM & IEEE International conference on Embedded software, EMSOFT 2008, Atlanta, GA, USA, October 19-24, 2008, pp. 1-10, 2008, ACM, 978-1-60558-468-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
automatic timing synthesis, counter-example guided abstraction refinement (cegar), event-based approach, parametric verification |
36 | Mohammad Reza Mousavi 0001, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski |
The Meaning of Ordered SOS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings, pp. 333-344, 2006, Springer, 3-540-49994-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain |
Mechanically Proving Termination Using Polynomial Interpretations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 34(4), pp. 325-363, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
polynomial interpretations, termination, term rewriting |
36 | Bernhard Gramlich, Salvador Lucas |
Simple termination of context-sensitive rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Workshop on Rule-Based Programming ![In: Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming, Pittsburgh, Pennsylvania, USA, 2002, pp. 29-42, 2002, ACM, 1-58113-606-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
automatic proofs of termination, context-sensitive rewriting, modular program analysis and verification, declarative programming, evaluation strategies |
36 | Gabriel Valiente |
A General Method for Graph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 428-431, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
36 | Feodor F. Dragan, Andreas Brandstädt |
Dominating Cliques in Graphs with Hypertree Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 735-746, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
34 | Andreas Blass, Yuri Gurevich |
Program termination and well partial orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(3), pp. 18:1-18:26, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
covering observation, game criterion, well partial orderings, Program termination |
33 | Nicolas Bedon |
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 61-75, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Jesús Angulo |
From Scalar-Valued Images to Hypercomplex Representations and Derived Total Orderings for Morphological Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Mathematical Morphology and Its Application to Signal and Image Processing, 9th International Symposium, ISMM 2009, Groningen, The Netherlands, August 24-27, 2009 Proceedings, pp. 238-249, 2009, Springer, 978-3-642-03612-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Antonio Montalbán |
Countably Complementable Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(4), pp. 321-331, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
countable linear ordering, extension property, embeddability |
33 | Alexander Semenov |
On Connection Between Constructive Involutive Divisions and Monomial Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings, pp. 261-278, 2006, Springer, 3-540-45182-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Maxim Teslenko, Andrés Martinelli, Elena Dubrova |
Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(2), pp. 236-237, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
ROBDD, bound set, variable ordering |
33 | Véronique Bruyère, Olivier Carton |
Hierarchy Among Automata on Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(5), pp. 593-621, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio |
Orderings for Innermost Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 17-31, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Nachum Dershowitz, E. Castedo Ellerman |
Leanest Quasi-orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 32-45, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Pinar Heggernes, Yngve Villanger |
Simple and Efficient Modifications of Elimination Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PARA ![In: Applied Parallel Computing, State of the Art in Scientific Computing, 7th International Workshop, PARA 2004, Lyngby, Denmark, June 20-23, 2004, Revised Selected Papers, pp. 788-797, 2004, Springer, 3-540-29067-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Yong Meng Teo, Bhakti S. S. Onggo |
Formalization and Strictness of Simulation Event Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADS ![In: 18th Workshop on Parallel and Distributed Simulation, PADS 2004, Kufstein, Austria, May 16-19, 2004, pp. 89-96, 2004, IEEE Computer Society, 0-7695-2111-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Chloe Rispal, Olivier Carton |
Complementation of Rational Sets on Countable Scattered Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, pp. 381-392, 2004, Springer, 3-540-24014-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Olivier Carton, Chloe Rispal |
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 292-301, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Olivier Carton |
Accessibility in Automata on Scattered Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 155-164, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Véronique Bruyère, Olivier Carton |
Automata on Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers, pp. 103-115, 2002, Springer, 3-540-40431-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Deepak Kapur, G. Sivakumar |
Proving Associative-Communicative Termination Using RPO-Compatible Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTP (LNCS Selection) ![In: Automated Deduction in Classical and Non-Classical Logics, Selected Papers, pp. 39-61, 1998, Springer, 3-540-67190-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Harry Preuß, Anand Srivastav |
Blockwise Variable Orderings for Shared BDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 636-644, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Piero A. Bonatti, Maria Luisa Sapino, V. S. Subrahmanian |
Merging Heterogeneous Security Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 96, 4th European Symposium on Research in Computer Security, Rome, Italy, September 25-27, 1996, Proceedings, pp. 183-197, 1996, Springer, 3-540-61770-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Theoretical Foundations of Security, Heterogeneous Mediated/Federated Systems |
33 | Scott Hauck, Gaetano Borriello |
Logic Partition Orderings for Multi-FPGA Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the Third International ACM Symposium on Field-Programmable Gate Arrays,FPGA 1995, Monterey, California, USA, February 12-14, 1995, pp. 32-38, 1995, ACM, 0-89791-743-X. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Joachim Steinbach |
Automatic Termination Proofs With Transformation Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 11-25, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu |
On Domination Elimination Orderings and Domination Graphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 81-92, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
33 | Leo Bachmair, Harald Ganzinger |
Ordered Chaining for Total Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 435-450, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
33 | Dieter Hutter |
Synthesis of Induction Orderings for Existence Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings, pp. 29-41, 1994, Springer, 3-540-58156-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
33 | Alberto Pettorossi |
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings, pp. 432-447, 1981, Springer, 3-540-10843-2. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
31 | Susumu Kubo, Kazuhisa Makino, Souta Sakamoto |
Composition Orderings for Linear Functions and Matrix Multiplication Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.10451, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
31 | Sergio Abriola, Santiago Figueira |
A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLEI ![In: XL Latin American Computing Conference, CLEI 2014, Montevideo, Uruguay, September 15-19, 2014, pp. 1-9, 2014, IEEE, 978-1-4799-6130-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
31 | Federico Heras, Javier Larrosa |
Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 12(4-5), pp. 287-306, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Weighted CSPs, Local consistency |
31 | Uwe Waldmann |
Extending Reduction Orderings to ACU-Compatible Reduction Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 67(1), pp. 43-49, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Ryu Hasegawa |
An Analysis of Divisibility Orderings and Recursive Path Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIAN ![In: Advances in Computing Science - ASIAN '97, Third Asian Computing Science Conference, Kathmandu, Nepal, December 9-11, 1997, Proceedings, pp. 283-296, 1997, Springer, 3-540-63875-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Pierre Lescanne |
Well Rewrite Orderings and Well Quasi-Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 14(5), pp. 419-436, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
31 | Carl G. Jockusch Jr., Robert I. Soare |
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 52(1-2), pp. 39-64, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
28 | Bikram Sengupta, Rance Cleaveland |
An Integrated Framework for Scenarios and State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFM ![In: Integrated Formal Methods, 5th International Conference, IFM 2005, Eindhoven, The Netherlands, November 29 - December 2, 2005, Proceedings, pp. 366-385, 2005, Springer, 3-540-30492-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
refinement orderings, scenarios, state-machines, heterogeneous specifications |
28 | Leo Bachmair, Harald Ganzinger |
Ordered Chaining Calculi for First-Order Theories of Transitive Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(6), pp. 1007-1049, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
chaining calculi, reduction orderings, transitive relations, term rewriting, rewrite systems, equational logic |
28 | Sonia Mettali Gammar, Farouk Kamoun |
A comparison of scheduling algorithms for real time distributed transactional systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTDCS ![In: 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '97), 29-31 October 1997, Tunis, Tunisia, Proceedings, pp. 257-261, 1997, IEEE Computer Society, 0-8186-8153-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
real time distributed transactional systems, distributed database update, globally consistent orderings, nonpreemptive earliest deadline first, simulation, distributed databases, concurrency control, consensus, scheduling algorithms, deadlines, serializability, client server, tokens, timeliness, system parameters, database consistency |
28 | N. Schmechel |
On Lattice-Isomorphism Between Fuzzy Equivalence Relations and Fuzzy Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 146-151, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fuzzy equivalence relations, bijection, pattern recognition, cluster analysis, fuzzy set theory, partial orderings, equivalence classes, lattice theory, fuzzy partitions, lattice-isomorphism, lattice isomorphism |
28 | Kimon P. Valavanis, Socrates J. Carelo |
An efficient planning technique for robotic assemblies and intelligent robotic systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 3(4), pp. 321-347, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Organization level, robotic assemblies and systems, task precedence, criticality of tasks-events, valid repetive orderings, automated planning |
28 | Jean-Pierre Jouannaud, Claude Marché |
Completion modulo Associativity, Commutativity and Identity (AC1). ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISCO ![In: Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '90, Capri, Italy, April 10-12, 1990, Proceedings, pp. 111-120, 1990, Springer, 3-540-52531-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Class rewriting, Constrained rewriting, Completion modulo AC1, Constrained completion, Rewrite orderings, Termination |
28 | Ravi S. Sandhu |
Recognizing Immediacy in an N-Tree Hierarchy and Its Application to Protection Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(12), pp. 1518-1525, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
immediacy, N-tree hierarchy, protection groups, subgroup relation, inverted rooted trees, access control, data structures, refinement, trees (mathematics), recursively, security of data, set theory, granularity, partial order, multi-access systems, linear orderings, integers |
27 | Gwendolyn Voskuilen, Faraz Ahmad, T. N. Vijaykumar |
Timetraveler: exploiting acyclic races for optimizing memory race recording. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCA ![In: 37th International Symposium on Computer Architecture (ISCA 2010), June 19-23, 2010, Saint-Malo, France, pp. 198-209, 2010, ACM, 978-1-4503-0053-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
race recording, debugging, determinism, replay |
27 | Hind Castel-Taleb, Nihal Pekergin |
Stochastic Monotonicity in Queueing Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPEW ![In: Computer Performance Engineering, 6th European Performance Engineering Workshop, EPEW 2009, London, UK, July 9-10, 2009, Proceedings, pp. 116-130, 2009, Springer, 978-3-642-02923-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Hermann Gruber, Markus Holzer 0001, Michael Tautschnig |
Short Regular Expressions from Finite Automata: Empirical Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings, pp. 188-197, 2009, Springer, 978-3-642-02978-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Nikos Gorogiannis, Anthony Hunter |
Merging First-Order Knowledge Using Dilation Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008, Proceedings, pp. 132-150, 2008, Springer, 978-3-540-77683-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Thuan Quang Huynh, Abhik Roychoudhury |
Memory model sensitive bytecode verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 31(3), pp. 281-305, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Programming language memory models, Software model checking, Bytecode verification |
27 | Nicolas Bedon, Chloe Rispal |
Series-Parallel Languages on Scattered and Countable Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 477-488, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Yiling Chen 0001, Lance Fortnow, Evdokia Nikolova, David M. Pennock |
Betting on permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 326-335, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
expressive betting, order matching, computational complexity, prediction market |
27 | Ulrich Bodenhofer, Josef Küng, Susanne Saminger |
Flexible Query Answering Using Distance-Based Fuzzy Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory and Applications of Relational Structures as Knowledge Instruments ![In: Theory and Applications of Relational Structures as Knowledge Instruments II, International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers, pp. 207-228, 2006, Springer, 3-540-69223-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Roman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv |
Abstract Counterexample-Based Refinement for Powerset Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program Analysis and Compilation ![In: Program Analysis and Compilation, Theory and Practice, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday, pp. 273-292, 2006, Springer, 978-3-540-71315-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Alexandre Riazanov, Andrei Voronkov |
Efficient Checking of Term Ordering Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings, pp. 60-74, 2004, Springer, 3-540-22345-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Salvador Lucas |
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings, pp. 200-209, 2004, Springer, 3-540-22153-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Peyman Faratin, Bartel A. Van de Walle |
Agent preference relations: strict, indifferent and incomparable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The First International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2002, July 15-19, 2002, Bologna, Italy, Proceedings, pp. 1317-1324, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
(Fuzzy) multi criteria decision making, multi-agent systems, incomparability |
27 | Parosh Aziz Abdulla, Aletta Nylén |
Better is Better than Well: On Efficient Verification of Infinite-State Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 132-140, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
lossy channel systems, integral relational automata, model checking, Verification, timed Petri nets, infinite-state systems, broadcast protocols |
27 | Litong Song, Yoshihiko Futamura |
A New Termination Approach for Specialization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAIG ![In: Semantics, Applications, and Implementation of Program Generation, International Workshop SAIG 2000, Montreal, Canada, September 20, 2000, Proceedings, pp. 72-91, 2000, Springer, 3-540-41054-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Robert Nieuwenhuis, José Miguel Rivero |
Solved Forms for Path Ordering Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 1-15, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Shinichi Morishita |
Avoiding Cartesian products for multiple joins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(1), pp. 57-85, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
database scheme, join expression tree, join strategy, optimality, Cartesian product, semijoin |
27 | Ursula Martin |
Linear Interpretations by Counting Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings, pp. 421-433, 1993, Springer, 3-540-56868-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Mark de Berg |
Translating Polygons with Applications to Hidden Surface Removal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 60-70, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
separation problems, relative convex hulls, Computational geometry, hidden surface removal |
Displaying result #1 - #100 of 1309 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|