term rewriting - researchr tag

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 34263

2018

Size-based termination of higher-order rewritingFrédéric Blanqui. JFP, 28, 2018. [doi]

2013

An Evaluation of a Pure Embedded Domain-Specific Language for Strategic Term RewritingPremaratne, Shirren, Anthony M. Sloane, Hamey, Leonard G. C.. Formal and Practical Aspects of Domain-Specific Languages: Recent Developments, IGI Global, 2013.

Optimizing Data Structures in High-Level ProgramsTiark Rompf, Arvind K. Sujeeth, Nada Amin, Kevin J. Brown, Vojin Jovanovic, HyoukJoong Lee, Manohar Jonnalagedda, Kunle Olukotun, Martin Odersky. In POPL 2013. 2013:

2012

Scheduling jobs on identical machines with agreement graphMohamed Bendraouche, Mourad Boudhar. cor, 39(2):382-390, 2012. [doi]

Graph-based criteria for spectrum-aware clustering in cognitive radio networksMilan Bradonjic, Loukas Lazos. adhoc, 10(1):75-94, 2012. [doi]

Eventually Consistent TransactionsBurckhardt, Sebastian, Leijen, Daan, Fahndrich, Manuel, Sagiv, Mooly. In Programming Languages and Systems. Volume 7211 of Lecture Notes in Computer Science, pages 67-86, Springer Berlin / Heidelberg, 2012.

Embedding domain-specific modeling languages into Maude specificationsVlad Rusu. Software and Systems Modeling (Preprint) 2012.

Embedding domain-specific modeling languages into Maude specificationsVlad Rusu. SoSyM, , 2012.

Coloring large graphs based on independent set extractionQinghua Wu, Jin-Kao Hao. cor, 39(2):283-290, 2012. [doi]

2011

Proceedings of the 2011 Workshop on Graph-based Methods for Natural Language Processing, TextGraphs-6, June 23, 2011, Portland, Oregon, USAThe Association for Computer Linguistics, 2011.

Minimization strategies for maximally parallel multiset rewriting systemsArtiom Alhazov, Sergey Verlan. TCS, 412(17):1581-1591, 2011. [doi]

Backward Trace Slicing for Rewriting Logic TheoriesMaría Alpuente, Demis Ballis, Javier Espert, Daniel Romero. cade 2011: 34-48 [doi]

A Mapping from Conceptual Graphs to Formal Concept AnalysisSimon Andrews, Simon Polovina. iccs 2011: 63-76 [doi]

Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphsTatiana Bassetto, Francesco Mason. eor, 208(3):253-262, 2011. [doi]

Identifying irreducible loops in the Instrumentation Point GraphAdam Betts, Guillem Bernat. jsa, 57(7):720-733, 2011. [doi]

Commutativity conditions for groups arising from acyclic directed graphs and posetsThomas Bier, Imed Zaguia. ejc, 32(2):301-307, 2011. [doi]

DHHTGraphs - Modeling beyond plain graphsDaniel Bildhauer, Jürgen Ebert. icde 2011: 100-105 [doi]

Almost Resolvable Maximum Packings of Complete Graphs with 4-CyclesElizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner. gc, 27(2):161-170, 2011. [doi]

Goal-driven evaluation of process fragments using weighted dependency graphsThomas Birkhölzer, Hesam Chiniforooshan Esfahani, Christoph Dickmann, Jürgen Vaupel, Stefan Ast. ispw 2011: 184-188 [doi]

Large joints in graphsBéla Bollobás, Vladimir Nikiforov. ejc, 32(1):33-44, 2011. [doi]

Acyclic 5-choosability of planar graphs without adjacent short cyclesOleg V. Borodin, Anna O. Ivanova. jgt, 68(2):169-176, 2011. [doi]

List strong linear 2-arboricity of sparse graphsOleg V. Borodin, Anna O. Ivanova. jgt, 67(2):83-90, 2011. [doi]

Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorableOleg V. Borodin, Alexei N. Glebov. jgt, 66(1):1-31, 2011. [doi]

List injective colorings of planar graphsOleg V. Borodin, Anna O. Ivanova. DM, 311(2-3):154-165, 2011. [doi]

Estimation de la densité d arcs dans les graphes de grande taille : une alternative à la détection de clustersMarc Boullé. f-egc 2011: 353-364

Hamiltonian Cycles in Kneser Graphs for n=2k+2L. R. Bueno, Celina M. Herrera de Figueiredo, Luerbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen. endm, 37:291-296, 2011. [doi]

Regularity and Context-Freeness over Word Rewriting SystemsDidier Caucal, Dinh Trong Hieu. fossacs 2011: 214-228 [doi]

DBridge: A program rewrite tool for set-oriented query executionMahendra Chavan, Ravindra Guravannavar, Karthik Ramachandra, S. Sudarshan. icde 2011: 1284-1287 [doi]

All minimum ::::C::::::5::-saturated graphsYa-Chen Chen. jgt, 67(1):9-26, 2011. [doi]

Conditional matching preclusion for the alternating group graphs and split-starsEddie Cheng, László Lipták, Marc J. Lipman, Matthew Toeniskoetter. ijcm, 88(6):1120-1136, 2011. [doi]

Comparison of Two Techniques for Proving Nonexistence of Strongly Regular GraphsVasek Chvátal. gc, 27(2):171-175, 2011. [doi]

Parity vertex colouring of plane graphsJúlius Czap, Stanislav Jendrol, Margit Voigt. DM, 311(6):512-520, 2011. [doi]

Exploring Complex Networks with Graph Investigator Research ApplicationW. Czech, Witold Dzwinel, S. Goryczka, Tomasz Arodz, Arkadiusz Z. Dudek. cai, 30(2):381-410, 2011. [doi]

An Improved Riemannian Metric Approximation for Graph CutsOndrej Danek, Pavel Matula. dgci 2011: 71-82 [doi]

Visualizing meetings as a graph for more accessible meeting artifactsYurdaer N. Doganata, Mercan Topkara. CHI 2011: 1939-1944 [doi]

Fully-Dynamic Hierarchical Graph Clustering Using Cut TreesChristof Doll, Tanja Hartmann, Dorothea Wagner. wads 2011: 338-349 [doi]

Graph marginalization for rapid assignment in wide-area surveillanceMark Ebden, Stephen Roberts. adhoc, 9(2):180-188, 2011. [doi]

Aggregated Search in Graph Databases: Preliminary ResultsHaytham Elghazel, Mohand-Said Hacid. gbrpr 2011: 92-101 [doi]

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)Yuri Faenza, Gianpaolo Oriolo, Claudia Snels. orl, 39(3):213-217, 2011. [doi]

Maximum gap labelings of graphsTomás Feder, Carlos S. Subi. ipl, 111(4):169-173, 2011. [doi]

Hybrid Logics and NP Graph PropertiesFrancicleber Martins Ferreira, Cibele Matos Freire, Mario R. F. Benevides, L. Menasché Schechter, Ana Teresa C. Martins. wollic 2011: 123-134 [doi]

Codes from the incidence matrices of graphs on 3-setsW. Fish, Jennifer D. Key, Eric Mwambene. DM, 311(16):1823-1840, 2011. [doi]

Management of security policy configuration using a Semantic Threat Graph approachSimon N. Foley, William M. Fitzgerald. jcs, 19(3):567-605, 2011. [doi]

Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycleLaura Frigerio, Federico Lastaria, Norma Zagaglia Salvi. dmgt, 31(3):547-557, 2011. [doi]

A Note on Lights-Out-Puzzle: Parity-State GraphsSeverino V. Gervacio, Hiroshi Maehara. gc, 27(1):109-119, 2011. [doi]

Tight bounds for rumor spreading in graphs of a given conductanceGeorge Giakkoupis. STACS 2011: 57-68 [doi]

On terminal delta-wye reducibility of planar graphsIsidoro Gitler, Feliu Sagols. networks, 57(2):174-186, 2011. [doi]

Proving weak properties of rewritingIsabelle Gnaedig, Hélène Kirchner. TCS, 412(34):4405-4438, 2011. [doi]

Graphs Encoded by Regular ExpressionsStefan Gulan. STACS 2011: 495-506 [doi]

Cutting Graphs Using Competing Ant Colonies and an Edge Clustering HeuristicMax Hinne, Elena Marchiori. evoW 2011: 60-71 [doi]

A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graphGongbing Hong, Pradip K. Srimani. ACMse 2011: 306-307 [doi]

The GReTL Transformation LanguageTassilo Horn, Jürgen Ebert. ICMT 2011: 183-197

GRAONTO: A graph-based approach for automatic construction of domain ontologyXin Hou, Soh-Khim Ong, Andrew Yeh-Ching Nee, X. T. Zhang, W. J. Liu. eswa, 38(9):11958-11975, 2011. [doi]

The spanning connectivity of line graphsPo-Yi Huang, Lih-Hsing Hsu. appml, 24(9):1614-1617, 2011. [doi]

The Minimum Distance of Graph CodesTom Høholdt, Jørn Justesen. codcry 2011: 201-212 [doi]

An Expansion Tester for Bounded Degree GraphsSatyen Kale, C. Seshadhri. SICOMP, 40(3):709-720, 2011. [doi]

Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphsMenelaos I. Karavelas. comgeo, 44(1):20-51, 2011. [doi]

Counterexamples in infinitary rewriting with non-fully-extended rulesJeroen Ketema. ipl, 111(13):642-646, 2011. [doi]

Parallel Graph Transformations Supported by Replicated Complementary GraphsLeszek Kotulski, Adam Sedziwy. icannga 2011: 254-264 [doi]

Termination of Isabelle Functions via Termination of RewritingAlexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl. itp 2011: 152-167 [doi]

Graphs whose flow polynomials have only integral rootsJoseph P. S. Kung, Gordon F. Royle. ejc, 32(6):831-840, 2011. [doi]

Mutually Independent Hamiltonian Cycle of Burnt Pancake GraphsYung-Ling Lai, Da-Chung Yu, Lih-Hsing Hsu. ieicet, 94-A(7):1553-1557, 2011. [doi]

An effective compact formulation of the max cut problem on sparse graphsGiuseppe Lancia, Paolo Serafini. endm, 37:111-116, 2011. [doi]

Multi-layer graph-based semi-supervised learning for large-scale image datasets using mapreduceWen-Yu Lee, Liang Chi Hsieh, Guan-Long Wu, Winston Hsu, Ya-Fan Su. sigir 2011: 1121-1122 [doi]

Sandpile groups and spanning trees of directed line graphsLionel Levine. JCT, 118(2):350-364, 2011. [doi]

Combined rough set theory and flow network graph to predict customer churn in credit card accountsChiun-Sin Lin, Gwo-Hshiung Tzeng, Yang-Chieh Chin. eswa, 38(1):8-15, 2011. [doi]

Bond graph based Bayesian network for fault diagnosisC. H. Lo, Y. K. Wong, Ahmad B. Rad. asc, 11(1):1208-1212, 2011. [doi]

On graph equivalences preserved under extensionsZbigniew Lonc, Miroslaw Truszczynski. DM, 311(12):966-977, 2011. [doi]

Radio numbers for generalized prism graphsPaul Martinez, Juan Ortiz, Maggy Tomova, Cindy Wyels. dmgt, 31(1):45-62, 2011. [doi]

An Erdos-Ko-Rado theorem for the derangement graph of PGL(2, q) acting on the projective lineKaren Meagher, Pablo Spiga. JCT, 118(2):532-544, 2011. [doi]

The Rewriting Logic Semantics Project: A Progress ReportJosé Meseguer, Grigore Rosu. fct 2011: 1-37 [doi]

Cayley Graph Representation and Graph Product Representation of HypercubesMiya Morota, Ryoichi Hatayama, Yukio Shibata. ieicet, 94-A(3):946-954, 2011. [doi]

Errors in graph embedding algorithmsWendy Myrvold, William Kocay. jcss, 77(2):430-438, 2011. [doi]

XML graphs in program analysisAnders Møller, Michael I. Schwartzbach. SCP, 76(6):492-515, 2011. [doi]

On the differences between Szeged and Wiener indices of graphsM. J. Nadjafi-Arani, H. Khodashenas, A. R. Ashrafi. DM, 311(20):2233-2237, 2011. [doi]

Collective graph identificationGalileo Namata, Stanley Kok, Lise Getoor. kdd 2011: 87-95 [doi]

Regularity of edge ideals of C::4::-free graphs via the topology of the lcm-latticeEran Nevo. JCT, 118(2):491-501, 2011. [doi]

Structural matching of 2D electrophoresis gels using deformed graphsAlexandre Noma, Alvaro Pardo, Roberto Marcondes Cesar Junior. prl, 32(1):3-11, 2011. [doi]

Des graphes de documents aux réseaux sociauxMichel Plantié, Michel Crampes. f-egc 2011: 307-308

Probabilistic Atlas Based Segmentation Using Affine Moment Descriptors and Graph-CutsCarlos Platero, Victor Rodrigo, María Carmen Tobar, Javier Sanguino, Olga Velasco, José Manuel Poncela. caip 2011: 144-151 [doi]

Variable-Length Source Compression Using Successive Refinement and Non-linear Graph-Based CodesFrancisco Ramirez-Javega, Meritxell Lamarca. dcc 2011: 473 [doi]

Document seal detection using GHT and character proximity graphsPartha Pratim Roy, Umapada Pal, Josep Lladós. PR, 44(6):1282-1295, 2011. [doi]

Optimal Estimation on the Graph Cycle SpaceWm. Joshua Russell, Daniel J. Klein, João P. Hespanha. tsp, 59(6):2834-2846, 2011. [doi]

Intention Recognition with Event Calculus Graphs and Weight of EvidenceFariba Sadri. icaart 2011: 470-475

Modeling, simulation and analysis of aircraft arresting system using bond graph approachS. C. Sati, A. S. Kanaskar, S. R. Kajale, A. Mukherjee. simpra, 19(3):936-958, 2011. [doi]

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, SerbiaManfred Schmidt-Schauß, editor, Volume 10 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.

Measuring complexity of component based architecture: a graph based approachSabnam Sengupta, Ananya Kanjilal, Swapan Bhattacharya. sigsoft, 36(1):1-10, 2011. [doi]

Distance independence in graphsJ. Louis Sewell, Peter J. Slater. dmgt, 31(2):397-409, 2011. [doi]

The Value State Dependence Graph RevisitedJames Stanier, Alan Lawrence. WIR 2011: 53-60

Using Ripley s K-function to improve graph-based clustering techniquesKevin Streib, James W. Davis. cvpr 2011: 2305-2312 [doi]

On the derandomization of the graph test for homomorphism over groupsLinqing Tang. TCS, 412(18):1718-1728, 2011. [doi]

Evaluating value-graph translation validation for LLVMJean-Baptiste Tristan, Paul Govereau, Greg Morrisett. PLDI 2011: 295-305 [doi]

A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphsPing-Ying Tsai. ipl, 111(8):375-378, 2011. [doi]

A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalenceThierry Vallée, Alain Bretto. DM, 311(5):336-341, 2011. [doi]

On the b-coloring of P::4::-tidy graphsClara Inés Betancur Velasquez, Flavia Bonomo, Ivo Koch. DAM, 159(1):60-68, 2011. [doi]

Algorithms for Partition of Some Class of Graphs under CompactionNarayan Vikas. cocoon 2011: 319-330 [doi]

CHAP and rewrite componentsSándor Vágvölgyi. ACTA, 48(5-6):317-361, 2011. [doi]

Combined rough sets with flow graph and formal concept analysis for business aviation decision-makingYu-Ping Ou Yang, How-Ming Shieh, Gwo-Hshiung Tzeng, Leon Yen, Chien-Chung Chan. jiis, 36(3):347-366, 2011. [doi]

First and second extremal bipartite graphs with respect to PI indexZahra Yarahmadi, A. R. Ashrafi, I. Gutman. mcm, 54(9-10):2460-2463, 2011. [doi]

Intractability of min- and max-cut in streaming graphsMariano Zelke. ipl, 111(3):145-150, 2011. [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Tag: term rewriting

Viewing Publication 1 - 100 from 34263

2018

2013

2012

2011

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Tag: term rewriting

Viewing Publication 1 - 100 from 34263

2018

2013

2012

2011

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1