{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:02:18Z","timestamp":1729641738416,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ismvl.2002.1011068","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:42:54Z","timestamp":1056573774000},"page":"39-45","source":"Crossref","is-referenced-by-count":4,"title":["Sierpinski gaskets for logic functions representation"],"prefix":"10.1109","author":[{"given":"D.V.","family":"Popel","sequence":"first","affiliation":[]},{"given":"A.","family":"Dani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"61","article-title":"New fast approach to approximate ESOP minimization for incompletely specified multi-output functions","author":"song","year":"1997","journal-title":"Proc IFIP 10 5 Workshop Applications Reed-Muller Expansion Circuit Design"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004280900954"},{"key":"ref12","first-page":"246","article-title":"Fixed polarity Reed-Muller expressions of symmetric Boolean functions","author":"suprun","year":"1995","journal-title":"Proc IFIP 10 5 Workshop Applications Reed-Muller Expansion Circuit Design"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2000.848630"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1049\/ip-e.1990.0047","article-title":"reed-muller expansions with fixed and mixed polarities over gf(4)","volume":"137","author":"green","year":"1990","journal-title":"Computers and Digital Techniques IEE Proceedings-"},{"key":"ref3","article-title":"Minimizing esop expressions using fractals","author":"dani","year":"2001","journal-title":"Proc Int Workshop on Post-Binary Ultra-Large Scale Integration"},{"journal-title":"The Fractal Geometry of Nature","year":"1982","author":"mandelbrot","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.1998.679310"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5139-3"},{"key":"ref7","first-page":"509","article-title":"Towards efficient calculation of information measures for reordering of Binary Decision Diagrams","author":"popel","year":"2001","journal-title":"Proc Int Symp Signals Circuits Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/43.892862"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref9","first-page":"77","article-title":"On a curve every point of which is a point of ramification","volume":"27","author":"sierpinski","year":"1916","journal-title":"Prace Mat Fiz (In Polish)"}],"event":{"name":"32nd IEEE International Symposium on Multi-Valued Logic","acronym":"ISMVL-02","location":"Boston, MA, USA"},"container-title":["Proceedings 32nd IEEE International Symposium on Multiple- Valued Logic"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7900\/21788\/01011068.pdf?arnumber=1011068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:40:42Z","timestamp":1497566442000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1011068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ismvl.2002.1011068","relation":{},"subject":[]}}