default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMircea Marin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]Octavian-Florin Maghiar, Adrian Copie, Teodora Selea
, Mircea Marin, Flavia Micota, Daniela Zaharie, Ionut Tepeneu:
Behaviour Analysis of Trajectory and Population-Based Metaheuristics on Flexible Assembly Scheduling. MIC (2) 2024: 80-95- 2023
- [c36]Octavian-Florin Maghiar, Teodora Selea, Adrian Copie, Flavia Micota, Mircea Marin:
Comparative Analysis of Exact, Heuristic and Metaheuristic Algorithms for Flexible Assembly Scheduling. FedCSIS 2023: 615-625 - [c35]Mircea Marin, Temur Kutsia, Cleo Pau, Mikheil Rukhaia:
Enumerating All Maximal Clique-Partitions of an Undirected Graph. FROM 2023: 65-79 - 2022
- [j9]Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues:
Regular matching problems for infinite trees. Log. Methods Comput. Sci. 18(1) (2022) - [e4]Bruno Buchberger, Mircea Marin, Viorel Negru, Daniela Zaharie:
24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2022, Hagenberg / Linz, Austria, September 12-15, 2022. IEEE 2022, ISBN 978-1-6654-6545-8 [contents] - 2021
- [j8]Besik Dundua, Temur Kutsia, Mircea Marin:
Variadic equational matching in associative and commutative theories. J. Symb. Comput. 106: 78-109 (2021) - [e3]Carsten Schneider, Mircea Marin, Viorel Negru, Daniela Zaharie:
23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2021, Timisoara, Romania, December 7-10, 2021. IEEE 2021, ISBN 978-1-6654-0650-5 [contents] - 2020
- [c34]Besik Dundua, Temur Kutsia, Mircea Marin, Ioana-Cleopatra Pau:
Constraint Solving over Multiple Similarity Relations. FSCD 2020: 30:1-30:19 - [c33]Mircea Marin, Besik Dundua, Temur Kutsia:
A Rule-Based System for Computation and Deduction in Mathematica. WRLA@ETAPS 2020: 57-74 - [i4]Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues:
Regular matching problems for infinite trees. CoRR abs/2004.09926 (2020)
2010 – 2019
- 2019
- [c32]Besik Dundua, Temur Kutsia, Mircea Marin:
Variadic Equational Matching. CICM 2019: 77-92 - [c31]Mircea Marin, Temur Kutsia, Besik Dundua:
A Rule-based Approach to the Decidability of Safety of ABACα. SACMAT 2019: 173-178 - [e2]Mircea Marin, Adrian Craciun:
Proceedings Third Symposium on Working Formal Methods, FROM 2019, Timişoara, Romania, 3-5 September 2019. EPTCS 303, 2019 [contents] - [i3]Gabriel Istrate, Cosmin Bonchis, Mircea Marin:
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm. CoRR abs/1909.12353 (2019) - 2016
- [j7]Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
CLP(H): Constraint logic programming for hedges. Theory Pract. Log. Program. 16(2): 141-162 (2016) - [c30]Mircea Marin, Temur Kutsia, Besik Dundua:
A rewrite-based computational model for functional logic programming. SCSS 2016: 95-106 - 2015
- [j6]Temur Kutsia, Mircea Marin:
Regular expression order-sorted unification and matching. J. Symb. Comput. 67: 42-67 (2015) - [i2]Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
CLP(H): Constraint Logic Programming for Hedges. CoRR abs/1503.00336 (2015) - 2014
- [j5]Mircea Marin, Gabriel Istrate:
Learning Cover Context-Free Grammars from Structural Data. Sci. Ann. Comput. Sci. 24(2): 253-286 (2014) - [c29]Besik Dundua, Mário Florido, Temur Kutsia, Mircea Marin:
Constraint Logic Programming for Hedges: A Semantic Reconstruction. FLOPS 2014: 285-301 - [c28]Mircea Marin, Gabriel Istrate:
Learning Cover Context-Free Grammars from Structural Data. ICTAC 2014: 241-258 - [i1]Mircea Marin, Gabriel Istrate:
Learning cover context-free grammars from structural data. CoRR abs/1404.2409 (2014) - 2012
- [c27]Temur Kutsia, Mircea Marin:
Solving, Reasoning, and Programming in Common Logic. SYNASC 2012: 119-126 - 2011
- [j4]Mircea Marin:
Foreword. Log. J. IGPL 19(6): 703-704 (2011) - 2010
- [j3]Mircea Marin, Temur Kutsia:
On the computation of quotients and factors of regular languages. Frontiers Comput. Sci. China 4(2): 173-184 (2010) - [c26]Mircea Marin, Temur Kutsia:
Regular Hedge Language Factorization Revisited. Developments in Language Theory 2010: 328-339 - [c25]Temur Kutsia, Mircea Marin:
Order-Sorted Unification with Regular Expression Sorts. RTA 2010: 193-208 - [c24]Mircea Marin, Adrian Craciun:
Type Inference for Regular Expression Pattern Matching. SYNASC 2010: 366-373
2000 – 2009
- 2009
- [c23]Mircea Marin, Temur Kutsia:
Linear Systems for Regular Hedge Languages. ADBIS (Workshops) 2009: 104-112 - [c22]Mircea Marin, Adrian Craciun:
Factorizations of Regular Hedge Languages. SYNASC 2009: 307-314 - [c21]Besik Dundua, Temur Kutsia, Mircea Marin:
Strategies in PRholog. WRS 2009: 32-43 - 2008
- [c20]Mircea Marin, Temur Kutsia:
Matching with Membership Constraints for Hedge and Context Variables. UNIF 2008: 55-68 - [e1]Mircea Marin:
Proceedings of the 22nd International Workshop on Unification, UNIF 2008, Castle of Hagenberg, Austria, July 18, 2008. 2008 [contents] - 2007
- [c19]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi:
Modeling Origami for Computational Construction and Beyond. ICCSA (2) 2007: 653-665 - [c18]Fadoua Ghourabi, Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Asem Kasem:
Logical and algebraic view of Huzita's origami axioms with applications to computational origami. SAC 2007: 767-772 - [c17]Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fadoua Ghourabi:
Computational Origami Construction as Constraint Solving and Rewriting. WFLP@RDP 2007: 31-44 - 2006
- [j2]Norio Kobayashi, Mircea Marin, Yoshimasa Tanaka, Hideko Urushihara:
On the Development of an Analysis System for Upstream Sequences in Dictyostelium discoideum Genome. Inf. Media Technol. 1(2): 742-747 (2006) - [j1]Mircea Marin, Temur Kutsia:
Foundations of the rule-based system rLog. J. Appl. Non Class. Logics 16(1-2): 151-168 (2006) - [c16]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi, Asem Kasem:
Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. ICMS 2006: 361-372 - 2005
- [c15]Temur Kutsia, Mircea Marin:
Matching with Regular Constraints. LPAR 2005: 215-229 - [c14]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin:
Computational Origami of a Morley's Triangle. MKM 2005: 267-282 - [c13]Mircea Marin, Tetsuo Ida:
Rule-Based Programming with sigma-Log. SYNASC 2005: 31-38 - 2004
- [c12]Mircea Marin, Aart Middeldorp:
New completeness results for lazy conditional narrowing. PPDP 2004: 120-131 - 2003
- [c11]Tetsuo Ida, Mircea Marin, Hidekazu Takahashi:
Constraint Functional Logic Programming for Origami Construction. APLAS 2003: 73-88 - [c10]Mircea Marin, Florina Piroi:
Deduction and Presentation in rho Log. MKM Symposium 2003: 161-182 - 2002
- [c9]Tetsuo Ida, Mircea Marin, Taro Suzuki:
Reducing Search Space in Solving Higher-Order Equations. Progress in Discovery Science 2002: 19-30 - 2001
- [c8]Norio Kobayashi, Mircea Marin, Tetsuo Ida:
Collaborative Constraint Functional Logic Programming in an Open Environment. APLAS 2001: 49-59 - [c7]Tetsuo Ida, Mircea Marin, Taro Suzuki:
Higher-Order Lazy Narrowing Calculus: A Solver for Higher-Order Equations. EUROCAST 2001: 479-493 - 2000
- [c6]Tetsuo Ida, Mircea Marin:
An Open Environment for Cooperative Equational Solving. APLAS 2000: 163-166 - [c5]Mircea Marin, Tetsuo Ida, Taro Suzuki:
Higher-order Lazy Narrowing Calculi in Perspective. WFLP 2000: 238-252 - [c4]Mircea Marin, Tetsuo Ida:
Cooperative Constraint Functional Logic Programming. WFLP 2000: 382-390
1990 – 1999
- 1999
- [c3]Mircea Marin, Tetsuo Ida, Taro Suzuki:
On Reducing the Search Space of Higher-Order Lazy Narrowing. Fuji International Symposium on Functional and Logic Programming 1999: 319-334 - 1998
- [c2]Wolfgang Schreiner, Werner Danielczyk-Landerl, Mircea Marin, Wolfgang Stöcher:
A Generic Programming Environment for High-Performance Mathematical Libraries. Generic Programming 1998: 256-268 - 1997
- [c1]Bruno Buchberger, Tudor Jebelean, Franz Kriftner, Mircea Marin, Elena Tomuta, Daniela Vasaru:
A Survey of the Theorema Project. ISSAC 1997: 384-391
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-28 23:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
