%0 Conference Paper %1 conf/vlsi/LaceF03 %A Lace, Lelde %A Freivalds, Rusins %B VLSI %D 2003 %E Arabnia, Hamid R. %E Yang, Laurence Tianruo %I CSREA Press %K dblp %P 309-316 %T Lower Bounds for Query Complexity of Some Graph Problems. %U http://dblp.uni-trier.de/db/conf/vlsi/vlsi2003.html#LaceF03 %@ 1-932415-10-6

@inproceedings{conf/vlsi/LaceF03, added-at = {2003-10-17T00:00:00.000+0200}, author = {Lace, Lelde and Freivalds, Rusins}, biburl = {https://www.bibsonomy.org/bibtex/283109158327bbcc9f6e452cfd8f21ace/dblp}, booktitle = {VLSI}, crossref = {conf/vlsi/2003}, date = {2003-10-17}, description = {dblp}, editor = {Arabnia, Hamid R. and Yang, Laurence Tianruo}, interhash = {9be16e17149418e2aa645da69bbac02f}, intrahash = {83109158327bbcc9f6e452cfd8f21ace}, isbn = {1-932415-10-6}, keywords = {dblp}, pages = {309-316}, publisher = {CSREA Press}, timestamp = {2003-10-17T00:00:00.000+0200}, title = {Lower Bounds for Query Complexity of Some Graph Problems.}, url = {http://dblp.uni-trier.de/db/conf/vlsi/vlsi2003.html#LaceF03}, year = 2003 }